Solving a minimization problem for a class of constrained maximum eigenvalue function
From MaRDI portal
Recommendations
- An approximate proximal bundle method to minimize a class of maximum eigenvalue functions
- A second-order bundle method to minimize the maximum eigenvalue function.
- A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
Cited in
(14)- Sufficient conditions for an extremum in eigenvalue optimization problems
- On minimax eigenvalue problems via constrained optimization
- A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions
- An approximate proximal bundle method to minimize a class of maximum eigenvalue functions
- A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- The bundle scheme for solving arbitrary eigenvalue optimizations
- Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions
- A second-order bundle method to minimize the maximum eigenvalue function.
- On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
This page was built for publication: Solving a minimization problem for a class of constrained maximum eigenvalue function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5416578)
