A proximal augmented method for semidefinite programming problems
From MaRDI portal
Publication:2048441
Recommendations
- scientific article; zbMATH DE number 6719195
- An augmented Lagrangian algorithm for solving semiinfinite programming
- Augmented Lagrangian and nonlinear semidefinite programs
- Alternating direction augmented Lagrangian methods for semidefinite programming
- The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs
- A proximal augmented Lagrangian method for equilibrium problems
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- A proximal multiplier method for separable convex minimization
Cites work
- scientific article; zbMATH DE number 741122 (Why is no real title available?)
- A .699-approximation algorithm for Max-Bisection.
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A boundary point method to solve semidefinite programs
- A modified augmented Lagrangian method for a class of monotone variational inequalities
- A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- An efficient inexact ABCD method for least squares semidefinite programming
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Linear Matrix Inequalities in System and Control Theory
- OSQP: an operator splitting solver for quadratic programs
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- Regularization methods for semidefinite programming
- Solving Lift-and-Project Relaxations of Binary Integer Programs
Cited in
(10)- A novel approach for solving semidefinite programs
- A Newton-CG augmented Lagrangian method for semidefinite programming
- Regularization methods for semidefinite programming
- On how to solve large-scale log-determinant optimization problems
- Using a factored dual in augmented Lagrangian methods for semidefinite programming
- scientific article; zbMATH DE number 2068039 (Why is no real title available?)
- A sequential convex semidefinite programming algorithm with an application to multiple-load free material optimization
- A novel adaptive method based on new minorant-majorant functions without line search for semidefinite optimization
- scientific article; zbMATH DE number 6719195 (Why is no real title available?)
- The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming
This page was built for publication: A proximal augmented method for semidefinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048441)
