Pages that link to "Item:Q1741120"

The following pages link to QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120):

Displaying 31 items.

• QSDPNAL (Q30630) (← links)
• A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems (Q781111) (← links)
• Synthesizing invariant barrier certificates via difference-of-convex programming (Q832194) (← links)
• A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems (Q2027683) (← links)
• \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
• Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints (Q2059164) (← links)
• A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
• A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems (Q2095559) (← links)
• Finding the global optimum of a class of quartic minimization problem (Q2114839) (← links)
• B-subdifferential of the projection onto the generalized spectraplex (Q2115259) (← links)
• Augmented Lagrangian methods for convex matrix optimization problems (Q2158112) (← links)
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
• On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
• A Euclidean distance matrix model for protein molecular conformation (Q2307747) (← links)
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming (Q2330654) (← links)
• A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions (Q4588864) (← links)
• Polynomial Norms (Q4620456) (← links)
• (Q4998892) (← links)
• An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications (Q5003212) (← links)
• On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming (Q5012883) (← links)
• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming (Q5124003) (← links)
• The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion (Q5149515) (← links)
• A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond (Q5149523) (← links)
• Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (Q5217598) (← links)
• On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
• Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications (Q6071884) (← links)
• A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) (← links)
• Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming (Q6179872) (← links)
• An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost (Q6200957) (← links)