An Augmented Primal-Dual Method for Linear Conic Programs
From MaRDI portal
Recommendations
- A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming
- Augmented Lagrangian algorithms for linear programming
- On primal convergence for augmented Lagrangian duality
- Local linear convergence of a primal-dual algorithm for the augmented convex models
- Towards an efficient augmented Lagrangian method for convex quadratic programming
- A primal-dual simplex method for linear programs
- A primal-dual augmented Lagrangian
- Augmented Lagrangian applied to convex quadratic problems
- Practical augmented Lagrangian methods for constrained optimization
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
Cited in
(19)- A globally convergent filter-type trust region method for semidefinite programming
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Iteration-Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming
- On the regularity of second order cone programs and an application to solving large scale problems
- scientific article; zbMATH DE number 2010164 (Why is no real title available?)
- A primal-dual augmented Lagrangian
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- High-accuracy solution of large-scale semidefinite programs
- Matrix relaxations in combinatorial optimization
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- On a box-constrained linear symmetric cone optimization problem
- On the stable solution of large scale problems over the doubly nonnegative cone
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- Solution refinement at regular points of conic problems
- A trust region method for solving semidefinite programs
- Primal-dual first-order methods for a class of cone programming
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- On the computation of \(C^*\) certificates
- Projection Methods in Conic Optimization
This page was built for publication: An Augmented Primal-Dual Method for Linear Conic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629521)
