A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
From MaRDI portal
Publication:5962724
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; zbMATH DE number 89042
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
Cites work
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 3244852 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- A Generalization of the Proximal Point Algorithm
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- A nonsmooth version of Newton's method
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An introduction to a class of matrix cone programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Characterization of the subdifferential of some matrix norms
- Convex Analysis
- Fast linear iterations for distributed averaging
- Fastest Mixing Markov Chain on a Graph
- Fastest Mixing Markov Chain on a Path
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Matrix completion via an alternating direction method
- Monotone Operators and the Proximal Point Algorithm
- Nonsmooth analysis of singular values. II: Applications
- On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm
- On Chebyshev polynomials of matrices
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Properties of linear approximations of matrices in the spectral norm
- Proximité et dualité dans un espace hilbertien
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Smooth convex approximation to the maximum eigenvalue function
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
- Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
- The Chebyshev Polynomials of a Matrix
- The University of Florida sparse matrix collection
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Validation of subgradient optimization
Cited in
(14)- Spectral operators of matrices
- On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
- Alternating direction method for a class of constrained matrix approximation problems
- 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 semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
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)
