QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
From MaRDI portal
Publication:1741120
DOI10.1007/S12532-018-0137-6zbMath1411.90213arXiv1512.08872OpenAlexW2964208659MaRDI QIDQ1741120
Kim-Chuan Toh, Xudong Li, Defeng Sun
Publication date: 3 May 2019
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.08872
Schur complementaugmented Lagrangianquadratic semidefinite programminginexact semismooth Newton method
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10)
Related Items (31)
Synthesizing invariant barrier certificates via difference-of-convex programming ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ Unnamed Item ⋮ Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming ⋮ An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming ⋮ Polynomial Norms ⋮ On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming ⋮ The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion ⋮ A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond ⋮ A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems ⋮ On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex ⋮ A Euclidean distance matrix model for protein molecular conformation ⋮ Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints ⋮ QSDPNAL ⋮ A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems ⋮ On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming ⋮ An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications ⋮ A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics ⋮ A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ On Degenerate Doubly Nonnegative Projection Problems ⋮ Finding the global optimum of a class of quartic minimization problem ⋮ B-subdifferential of the projection onto the generalized spectraplex
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Copositive and semidefinite relaxations of the quadratic assignment problem
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- QAPLIB - a quadratic assignment problem library
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Local Duality of Nonlinear Semidefinite Programming
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Optimization and nonsmooth analysis
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Semismooth Matrix-Valued Functions
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
This page was built for publication: QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
