An Augmented Primal-Dual Method for Linear Conic Programs
From MaRDI portal
Publication:3629521
DOI10.1137/070687128zbMath1173.90497OpenAlexW1999915705MaRDI QIDQ3629521
Publication date: 27 May 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070687128
Semidefinite programming (90C22) Convex programming (90C25) Numerical methods involving duality (49M29)
Related Items
Matrix Relaxations in Combinatorial Optimization, An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems, A trust region method for solving semidefinite programs, On the stable solution of large scale problems over the doubly nonnegative cone, On a box-constrained linear symmetric cone optimization problem, An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection, Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming, A globally convergent filter-type trust region method for semidefinite programming, High-accuracy solution of large-scale semidefinite programs, Iteration-complexity of first-order augmented Lagrangian methods for convex programming, On the regularity of second order cone programs and an application to solving large scale problems, Projection Methods in Conic Optimization, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, On the computation of \(C^*\) certificates, Primal–dual first-order methods for a class of cone programming
Uses Software
