An introduction to a class of matrix cone programming
From MaRDI portal
(Redirected from Publication:2452376)
Recommendations
- No gap second-order optimality conditions for a matrix cone programming induced by the nuclear norm
- scientific article; zbMATH DE number 89042
- Augmented Lagrangian methods for convex matrix optimization problems
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- An implementable proximal point algorithmic framework for nuclear norm minimization
Cites work
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 3437485 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- scientific article; zbMATH DE number 3027026 (Why is no real title available?)
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- A boundary point method to solve semidefinite programs
- A simpler approach to matrix completion
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Computing a nearest symmetric positive semidefinite matrix
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convex Analysis
- Exact matrix completion via convex optimization
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- How to differentiate the projection on a convex set in Hilbert space. Some applications to variational inequalities
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Introduction to Piecewise Differentiable Equations
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Matrix Analysis
- Matrix Completion From a Few Entries
- Monotone functions on formally real Jordan algebras
- Newton's Method for B-Differentiable Equations
- Non-interior continuation methods for solving semidefinite complementarity problems
- Nonsmooth analysis of singular values. II: Applications
- On eigenvalues of matrices dependent on a parameter
- Optimization and nonsmooth analysis
- Rank-Sparsity Incoherence for Matrix Decomposition
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Regularization methods for semidefinite programming
- Robust principal component analysis?
- Semismooth Matrix-Valued Functions
- Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
- Structured low rank approximation
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Twice differentiable spectral functions
- Über monotone Matrixfunktionen
Cited in
(43)- An Adaptive Correction Approach for Tensor Completion
- Characterizations of boundary conditions on some non-symmetric cones
- Derivatives of functions of eigenvalues and eigenvectors for symmetric matrices
- A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets
- B-subdifferentials of the projection onto the generalized simplex
- B-subdifferential of the projection onto the generalized spectraplex
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
- Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Spectral operators of matrices
- A superlinearly convergent smoothing Newton continuation algorithm for variational inequalities over definable sets
- Monotonicity and circular cone monotonicity associated with circular cones
- Characterizations of the set less order relation in nonconvex set optimization
- On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints
- Variational analysis of norm cones in finite dimensional Euclidean spaces
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm
- The analytic solutions of a class of constrained matrix minimization and maximization problems with applications
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- Differential properties of Euclidean projection onto power cone
- No gap second-order optimality conditions for a matrix cone programming induced by the nuclear norm
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- High-dimensional interactions detection with sparse principal Hessian matrix
- The cone of flow matrices: Approximation hierarchies and applications
- Variational analysis of the Ky Fan k-norm
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
- A unified approach to error bounds for structured convex optimization problems
- Several classes of stationary points for rank regularized minimization problems
- The vector-valued functions associated with circular cones
- Augmented Lagrangian methods for convex matrix optimization problems
- Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions
- Constructions of complementarity functions and merit functions for circular cone complementarity problem
- The decompositions with respect to two core non-symmetric cones
- Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm
- Extended Newton-type method for inverse singular value problems with multiple and/or zero singular values
- Nonsingularity in matrix conic optimization induced by spectral norm via a smoothing metric projector
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- A cone programming approach to the bilinear matrix inequality problem and its geometry
- Solving graph equipartition SDPs on an algebraic variety
- A new series of conjectures and open questions in optimization and matrix analysis
This page was built for publication: An introduction to a class of matrix cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452376)
