Work

Exploiting problem structure in optimization under uncertainty via online convex optimization

Year: 2018

Type: article

Source: Mathematical Programming

DOI: 10.1007/s10107-018-1262-8

Authors: Nam Ho-Nguyen, Fatma Kılınç-Karzan

Institution: Carnegie Mellon University

Language: English

Topic: Advanced Bandit Algorithms Research

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: green

Funders: National Science Foundation, Division of Civil, Mechanical and Manufacturing Innovation

Awards: G2804179227, CAREER: Fundamentals of Low-complexity Relaxations for Nonconvex Optimization Problems with Conic Structure

OpenAlex ID: W2751998381

FWCI: 2.286

Cites: 49

Cited by: 28

Related to: 10