A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem

DOI10.1007/S10589-023-00467-2zbMATH Open1519.90115MaRDI QIDQ6097765FDOQ6097765

Authors:

Publication date: 7 June 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Recommendations

• A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
• On convergence of the dual Newton method for a linear semidefinite programming problem
• The semismooth and smoothing Newton methods for solving Pareto eigenvalue problem
• scientific article; zbMATH DE number 5583532
• An approximate proximal bundle method to minimize a class of maximum eigenvalue functions
• A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions
• A duality based semismooth Newton framework for solving variational inequalities of the second kind
• A semismooth Newton method for tensor eigenvalue complementarity problem
• Nonsmooth algorithms for minimizing the largest eigenvalue with applications to inner numerical radius
• A semismooth Newton method for nonlinear symmetric cone programming

zbMATH Keywords

density matrixproximal point algorithmquadratic growth conditionsemismooth Newton algorithmmaximum eigenvalue problem

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90)

Cites Work

• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Title not available (Why is that?)
• A Newton-CG augmented Lagrangian method for semidefinite programming
• A Spectral Bundle Method for Semidefinite Programming
• Convex Analysis
• Title not available (Why is that?)
• Nonlinear optimization.
• Implicit Functions and Solution Mappings
• Optimization and nonsmooth analysis
• Some continuity properties of polyhedral multifunctions
• 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?)
• Proximité et dualité dans un espace hilbertien
• Validation of subgradient optimization
• Sensitivity analysis of all eigenvalues of a symmetric matrix
• Twice differentiable spectral functions
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Derivatives of Spectral Functions
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
• Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
• Characterization of metric regularity of subdifferentials
• A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
• Smooth convex approximation to the maximum eigenvalue function
• Spectral operators of matrices
• On the Optimal Design of Columns Against Buckling
• A second-order bundle method to minimize the maximum eigenvalue function.
• Large-Scale Optimization of Eigenvalues
• Augmented Lagrangian methods for convex matrix optimization problems
• An accelerated linearized alternating direction method of multipliers
• A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
• The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
• A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems

Cited In (2)

• An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
• A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems

This page was built for publication: A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097765)