QSDPNAL

swMATH18799MaRDI QIDQ30630FDOQ30630

Author name not available (Why is that?)

Source code repository: https://github.com/optXuDLi/QSDPNAL

Described by source

• QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming

Cited In (36)

• Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions
• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
• Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
• Finding the global optimum of a class of quartic minimization problem
• B-subdifferential of the projection onto the generalized spectraplex
• A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond
• A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
• An efficient algorithm for batch images alignment with adaptive rank-correction term
• An efficient duality-based approach for PDE-constrained sparse optimization
• On Degenerate Doubly Nonnegative Projection Problems
• Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
• Polynomial Norms
• An efficient inexact ABCD method for least squares semidefinite programming
• A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems
• Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
• QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
• Title not available (Why is that?)
• \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
• On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming
• On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
• A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
• A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems
• A Euclidean distance matrix model for protein molecular conformation
• A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
• The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion
• An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
• A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
• An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
• Synthesizing invariant barrier certificates via difference-of-convex programming
• A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
• A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
• A FE-ADMM algorithm for Lavrentiev-regularized state-constrained elliptic control problem

This page was built for software: QSDPNAL