An introduction to a class of matrix cone programming

DOI10.1007/s10107-012-0619-7zbMath1301.65043OpenAlexW2030451378MaRDI QIDQ2452376

Kim-Chuan Toh, Chao Ding, Defeng Sun

Publication date: 2 June 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0619-7

zbMATH Keywords

conic optimizationaugmented Lagrange methodmatrix coneslarge scale semidefinite programmingmetric projectors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items

Monotonicity and circular cone monotonicity associated with circular cones, Variational analysis of the Ky Fan \(k\)-norm, \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems, A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets, Characterizations of the set less order relation in nonconvex set optimization, A rank-corrected procedure for matrix completion with fixed basis coefficients, An Adaptive Correction Approach for Tensor Completion, Nonsingularity in matrix conic optimization induced by spectral norm via a smoothing metric projector, Augmented Lagrangian methods for convex matrix optimization problems, Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian, Unnamed Item, A unified approach to error bounds for structured convex optimization problems, Spectral operators of matrices, On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm, Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm, Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, Variational analysis of norm cones in finite dimensional Euclidean spaces, Solving graph equipartition SDPs on an algebraic variety, Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications, Differential properties of Euclidean projection onto power cone, Extended Newton-type method for inverse singular value problems with multiple and/or zero singular values, Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions, The vector-valued functions associated with circular cones, Several Classes of Stationary Points for Rank Regularized Minimization Problems, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, Derivatives of functions of eigenvalues and eigenvectors for symmetric matrices, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, Constructions of complementarity functions and merit functions for circular cone complementarity problem, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, The decompositions with respect to two core non-symmetric cones, \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex, The Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with Applications, Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems, A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets, Characterizations of Boundary Conditions on Some Non-Symmetric Cones, On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints, B-Subdifferentials of the Projection onto the Generalized Simplex, B-subdifferential of the projection onto the generalized spectraplex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotone functions on formally real Jordan algebras
• A boundary point method to solve semidefinite programs
• Computing a nearest symmetric positive semidefinite matrix
• How to differentiate the projection on a convex set in Hilbert space. Some applications to variational inequalities
• Non-interior continuation methods for solving semidefinite complementarity problems
• Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
• Über monotone Matrixfunktionen
• Structured low rank approximation
• On eigenvalues of matrices dependent on a parameter
• Nonsmooth analysis of singular values. II: Applications
• Exact matrix completion via convex optimization
• Twice Differentiable Spectral Functions
• Introduction to Piecewise Differentiable Equations
• Robust principal component analysis?
• Rank-Sparsity Incoherence for Matrix Decomposition
• Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
• Newton's Method for B-Differentiable Equations
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Matrix Analysis
• Optimization and nonsmooth analysis
• GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
• Hyperbolic Polynomials and Interior Point Methods for Convex Programming
• Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
• Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Regularization Methods for Semidefinite Programming
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion
• Convex Analysis
• Semismooth Matrix-Valued Functions