activity
20192025
most citedSuccessive Convexification for Trajectory Optimization with Continuous-Time Constraint Satisfaction

14 citations · 19 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2025★ 1 cited

QOCO: A Quadratic Objective Conic Optimizer with Custom Solver Generation

Govind M Chari, Behçet Açikmeşe

Second-order cone programs (SOCPs) with quadratic objective functions are common in optimal control and other fields. Most SOCP solvers which use interior-point methods are designe…

math.OC2024★ 14 cited

Successive Convexification for Trajectory Optimization with Continuous-Time Constraint Satisfaction

Purnanand Elango, Dayou Luo, Abhinav G. Kamath +3

We present successive convexification, a real-time-capable solution method for nonconvex trajectory optimization, with continuous-time constraint satisfaction and guaranteed conver…

math.OC2020★ 1 cited

Fixed Points of the Set-Based Bellman Operator

Sarah H. Q. Li, Assalé Adjé, Pierre-Loïc Garoche +1

Motivated by uncertain parameters encountered in Markov decision processes (MDPs), we study the effect of parameter uncertainty on Bellman operator-based methods. Specifically, we…

cs.GT2019★ 3 cited

Tolling for Constraint Satisfaction in Markov Decision Process Congestion Games

Sarah H. Q. Li, Yue Yu, Daniel Calderone +2

Markov decision process (MDP) congestion game is an extension of classic congestion games, where a continuous population of selfish agents solves Markov decision processes with con…

math.OC2019

Variable Demand and Multi-commodity Flow in Markovian Network Equilibrium

Yue Yu, Dan Calderone, Sarah H. Q. Li +2

Markovian network equilibrium generalizes the classical Wardrop equilibrium in network games. At a Markovian network equilibrium, each player of the game solves a Markov decision p…