activity
20242026
most citedSpacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method

2 citations · 2 across the 3 of their papers we have counts for

collaborators

6 papers

math.OC2026

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions

Govind M. Chari, Uijeong Jang, Ernest K. Ryu +1

When minimizing the sum of a convex and a strongly convex function, or when finding the zero of the sum of a monotone operator and a strongly monotone operator, Chambolle and Pock…

math.OC2026

QOCO-GPU: A Quadratic Objective Conic Optimizer with GPU Acceleration

Govind M. Chari, Behçet Açıkmeşe

We present a GPU-accelerated backend for QOCO, a C-based solver for quadratic objective second-order cone programs (SOCPs) based on a primal-dual interior point method. Our backend…

math.OC2025

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

Fast Monte Carlo Analysis for 6-DoF Powered-Descent Guidance via GPU-Accelerated Sequential Convex Programming

Govind M. Chari, Abhinav G. Kamath, Purnanand Elango +1

We introduce a GPU-accelerated Monte Carlo framework for nonconvex, free-final-time trajectory optimization problems. This framework makes use of the prox-linear method, which belo…

math.OC2024

Constraint Preconditioning and Parameter Selection for a First-Order Primal-Dual Method applied to Model Predictive Control

Govind M. Chari, Yue Yu, Behçet Açıkmeşe

Many techniques for real-time trajectory optimization and control require the solution of optimization problems at high frequencies. However, ill-conditioning in the optimization p…

math.OC20242 cited

Spacecraft Rendezvous Guidance via Factorization-Free Sequential Convex Programming using a First-Order Method

Govind M. Chari, Behçet Açıkmeşe

We implement a fully factorization-free algorithm for nonconvex, free-final-time trajectory optimization. This algorithm is based on sequential convex programming and utilizes an i…