A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
From MaRDI portal
Publication:5962724
DOI10.1007/S10107-014-0853-2zbMath1342.90100OpenAlexW2046509554MaRDI QIDQ5962724
Caihua Chen, Defeng Sun, Yong-Jin Liu, Kim-Chuan Toh
Publication date: 23 February 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0853-2
spectral operatoralternating direction method of multipliersproximal point algorithmsemismooth Newton-CG methodspectral norm approximation
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical linear algebra (65F99)
Related Items (12)
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 ⋮ A regularized semi-smooth Newton method with projection steps for composite convex programs ⋮ Spectral operators of matrices ⋮ On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem ⋮ The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion ⋮ A semismooth Newton stochastic proximal point algorithm with variance reduction ⋮ An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An implementable proximal point algorithmic framework for nuclear norm minimization
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Characterization of the subdifferential of some matrix norms
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- Smooth convex approximation to the maximum eigenvalue function
- Properties of linear approximations of matrices in the spectral norm
- A nonsmooth version of Newton's method
- An introduction to a class of matrix cone programming
- Fast linear iterations for distributed averaging
- Nonsmooth analysis of singular values. II: Applications
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
- The university of Florida sparse matrix collection
- On Chebyshev Polynomials of Matrices
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Matrix completion via an alternating direction method
- A Generalization of the Proximal Point Algorithm
- On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- The Chebyshev Polynomials of a Matrix
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Fastest Mixing Markov Chain on a Graph
- Validation of subgradient optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Fastest Mixing Markov Chain on a Path
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
This page was built for publication: A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
