A fast space-decomposition scheme for nonconvex eigenvalue optimization

Eigenvalues, singular values, and eigenvectors (15A18) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A Spectral Bundle Method for Semidefinite Programming
Semidefinite Programming
Convex Analysis
A spectral bundle method with bounds
Composite proximal bundle method
Optimization and nonsmooth analysis
Geometric algorithms and combinatorial optimization.
A proximal method for composite minimization
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
Sensitivity analysis of all eigenvalues of a symmetric matrix
Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
The 𝒰-Lagrangian of a convex function
Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
A semidefinite programming approach to the quadratic knapsack problem
Sufficiency of Exact Penalty Minimization
Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
A second-order bundle method to minimize the maximum eigenvalue function.
Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
Solutions to shape and topology eigenvalue optimization problems using a homogenization method
Partially Augmented Lagrangian Method for Matrix Inequality Constraints
On Eigenvalue Optimization
Semidefinite programming in combinatorial optimization
Semi-Definite Matrix Constraints in Optimization
Large-Scale Optimization of Eigenvalues
The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
A spectral quadratic-SDP method with applications to fixed-order $H_2$ and $H_\infty$ synthesis
Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
The $\U$-Lagrangian of the Maximum Eigenvalue Function
Interior-point methods: An old and new approach to nonlinear programming

Cited In (7)

A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
Title not available (Why is that?)
The space decomposition theory for a class of eigenvalue optimizations
A Decomposition Algorithm for the Sums of the Largest Eigenvalues
On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
$\mathcal{UV}$-theory of a class of semidefinite programming and its applications
The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications

This page was built for publication: A fast space-decomposition scheme for nonconvex eigenvalue optimization

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