The bundle scheme for solving arbitrary eigenvalue optimizations
From MaRDI portal
Publication:2628175
DOI10.3934/jimo.2016039zbMath1364.49016OpenAlexW2404365976MaRDI QIDQ2628175
Li-Ping Pang, Ming Huang, Yuan Lu, Xi-Jun Liang
Publication date: 12 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016039
nonsmooth optimizationeigenvalue optimizationnonconvex optimizationD.C. functionfirst-order proximal bundle method
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications ⋮ \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications ⋮ A proximal-projection partial bundle method for convex constrained minimax problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The space decomposition theory for a class of eigenvalue optimizations
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- Proximity control in bundle methods for convex nondifferentiable minimization
- First- and second-order epi-differentiability in eigenvalue optimization
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Interior-point methods: An old and new approach to nonlinear programming
- First and second order analysis of nonlinear semidefinite programs
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- An aggregate subgradient method for nonsmooth convex minimization
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- A Linearization Algorithm for Nonsmooth Minimization
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- An Algorithm for Constrained Optimization with Semismooth Functions
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- A Spectral Bundle Method for Semidefinite Programming
- On The Second Eigenvalue For Nonhomogeneous Quasi-linear Operators
- The $\U$-Lagrangian of the Maximum Eigenvalue Function
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- On Eigenvalue Optimization
- Semidefinite Programming
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Second-order directional derivatives of all eigenvalues of a symmetric matrix
