A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
From MaRDI portal
Publication:6097765
DOI10.1007/s10589-023-00467-2zbMath1519.90115MaRDI QIDQ6097765
No author found.
Publication date: 7 June 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
density matrixproximal point algorithmquadratic growth conditionsemismooth Newton algorithmmaximum eigenvalue problem
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Smooth convex approximation to the maximum eigenvalue function
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- Augmented Lagrangian methods for convex matrix optimization problems
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Spectral operators of matrices
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Twice Differentiable Spectral Functions
- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Implicit Functions and Solution Mappings
- Optimization and nonsmooth analysis
- Some continuity properties of polyhedral multifunctions
- Large-Scale Optimization of Eigenvalues
- On the Optimal Design of Columns Against Buckling
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Spectral Bundle Method for Semidefinite Programming
- Derivatives of Spectral Functions
- Validation of subgradient optimization
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- A second-order bundle method to minimize the maximum eigenvalue function.
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
