Cited in
(49)- A FE-ADMM algorithm for Lavrentiev-regularized state-constrained elliptic control problem
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- On the convergence rate of inexact majorized sGS ADMM with indefinite proximal terms for convex composite programming
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Finding the global optimum of a class of quartic minimization problem
- B-subdifferential of the projection onto the generalized spectraplex
- 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
- A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond
- An efficient duality-based approach for PDE-constrained sparse optimization
- The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
- 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
- An inexact augmented Lagrangian method for second-order cone programming with applications
- An efficient inexact ABCD method for least squares semidefinite programming
- A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems
- QSDP
- LMIRank
- SNLSDP
- iFEM
- DISCO
- SDPNAL+
- SPOT
- PPROJ
- spectralGraphTopology
- MSCRA_rankmin
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- 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
- On degenerate doubly nonnegative projection problems
- RASL
- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
- QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
- scientific article; zbMATH DE number 7370538 (Why is no real title available?)
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- cuPDLP.jl
- QPPAL
- 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
- Polynomial norms
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
- 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
This page was built for software: QSDPNAL
