A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
From MaRDI portal
Publication:5962724
DOI10.1007/S10107-014-0853-2zbMATH Open1342.90100OpenAlexW2046509554MaRDI QIDQ5962724FDOQ5962724
Authors: Caihua Chen, Yong-Jin Liu, Defeng Sun, 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
Recommendations
- Alternating direction method for a class of constrained matrix approximation problems
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
- scientific article
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
alternating direction method of multipliersproximal point algorithmsemismooth Newton-CG methodspectral operatorspectral norm approximation
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical linear algebra (65F99)
Cites Work
- The university of Florida sparse matrix collection
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A Newton-CG augmented Lagrangian method for semidefinite programming
- Title not available (Why is that?)
- Convex Analysis
- Characterization of the subdifferential of some matrix norms
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- A nonsmooth version of Newton's method
- Fast linear iterations for distributed averaging
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Matrix completion via an alternating direction method
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Proximité et dualité dans un espace hilbertien
- Title not available (Why is that?)
- A new inexact alternating directions method for monotone variational inequalities
- Title not available (Why is that?)
- Validation of subgradient optimization
- Title not available (Why is that?)
- Nonsmooth analysis of singular values. II: Applications
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- An introduction to a class of matrix cone programming
- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- Smooth convex approximation to the maximum eigenvalue function
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Fastest Mixing Markov Chain on a Graph
- Fastest Mixing Markov Chain on a Path
- A Generalization of the Proximal Point Algorithm
- On Chebyshev polynomials of matrices
- The Chebyshev Polynomials of a Matrix
- Properties of linear approximations of matrices in the spectral norm
- On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
Cited In (13)
- Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions
- Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian
- An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
- Spectral operators of matrices
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- Augmented Lagrangian methods for convex matrix optimization problems
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
- The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
Uses Software
This page was built for publication: A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962724)
