A proximal augmented method for semidefinite programming problems
From MaRDI portal
Publication:2048441
DOI10.1016/j.apnum.2021.07.007zbMath1473.90109OpenAlexW3186516125MaRDI QIDQ2048441
Publication date: 5 August 2021
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2021.07.007
Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A boundary point method to solve semidefinite programs
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- A modified augmented Lagrangian method for a class of monotone variational inequalities
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems
- An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Linear Matrix Inequalities in System and Control Theory
- An Interior-Point Method for Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- A .699-approximation algorithm for Max-Bisection.
This page was built for publication: A proximal augmented method for semidefinite programming problems
