A Triangular Log-Det PDHG for Semidefinite Programming: Complementarity Selection and Global Linear Convergence
math.OC
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Burer-Monteiro ADMM for Large-scale SDPs
- New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming
- On the Local Linear Convergence of Operator Splitting Methods for Conic Programming
- Local linear convergence of the primal-dual hybrid gradient algorithm for semidefinite programming
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity
- Strict complementarity in semidefinite programming, singularity degree, and the (dis)connection of forward and backward errors
- Strict Complementarity in MaxCut SDP
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise