A novel approach for solving semidefinite programs
From MaRDI portal
Publication:2336591
Summary: A novel linearizing alternating direction augmented Lagrangian approach is proposed for effectively solving semidefinite programs (SDP). For every iteration, by fixing the other variables, the proposed approach alternatively optimizes the dual variables and the dual slack variables; then the primal variables, that is, Lagrange multipliers, are updated. In addition, the proposed approach renews all the variables in closed forms without solving any system of linear equations. Global convergence of the proposed approach is proved under mild conditions, and two numerical problems are given to demonstrate the effectiveness of the presented approach.
Recommendations
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Solving semidefinite programming problems via alternating direction methods
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- A proximal augmented method for semidefinite programming problems
Cites work
- A boundary point method to solve semidefinite programs
- A class of linearized proximal alternating direction methods
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- A feasible direction method for the semidefinite program with box constraints
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
- A homotopy method for nonlinear semidefinite programming
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A primal-dual interior point method for nonlinear semidefinite programming
- A trust region method for solving semidefinite programs
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- An inexact spectral bundle method for convex quadratic semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- Benchmarking optimization software with performance profiles.
- Dual interior point methods for linear semidefinite programming problems
- Frequency planning and ramifications of coloring
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- Linear Matrix Inequalities in System and Control Theory
- Lower-order penalization approach to nonlinear semidefinite programming
- Penalty and barrier methods for convex semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Proximal Decomposition Via Alternating Linearization
- Regularization methods for semidefinite programming
- Semidefinite Programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Solving semidefinite programming problems via alternating direction methods
- Solving some large scale semidefinite programs via the conjugate residual method
- Successive linearization methods for nonlinear semidefinite programs
- Two-Point Step Size Gradient Methods
Cited in
(11)- An object-oriented approach to semidefinite programming
- Solving semidefinite programming problems via alternating direction methods
- New approaches for optimizing over the semimetric polytope
- Semidefinite programming based approaches to the break minimization problem
- A new barrier for a class of semidefinite problems
- A framework for solving mixed-integer semidefinite programs
- Linearly convergent first-order algorithms for semidefinite programming
- A robust algorithm for semidefinite programming
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Finding a strict feasible solution of a linear semidefinite program
- A boundary point method to solve semidefinite programs
This page was built for publication: A novel approach for solving semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336591)
