A fast space-decomposition scheme for nonconvex eigenvalue optimization
From MaRDI portal
Publication:526388
DOI10.1007/s11228-016-0365-8zbMath1360.90212OpenAlexW2257040417MaRDI QIDQ526388
Yuan Lu, Ming Huang, Zun-Quan Xia, Li-Ping Pang
Publication date: 12 May 2017
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-016-0365-8
second-order bundle methodsbilinear matrix inequalitycomposite optimization\(\mathcal{VU}\)-decompositionnonconvex eigenvalue optimization
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) 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 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proximal method for composite minimization
- Composite proximal bundle method
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Geometric algorithms and combinatorial 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
- Semidefinite programming in combinatorial optimization
- Interior-point methods: An old and new approach to nonlinear programming
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- A spectral bundle method with bounds
- A semidefinite programming approach to the quadratic knapsack problem
- 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
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- Semi-Definite Matrix Constraints in Optimization
- Optimization and nonsmooth analysis
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Large-Scale Optimization of Eigenvalues
- Solutions to shape and topology eigenvalue optimization problems using a homogenization method
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- A Spectral Bundle Method for Semidefinite Programming
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- The 𝒰-Lagrangian of a convex function
- The $\U$-Lagrangian of the Maximum Eigenvalue Function
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- On Eigenvalue Optimization
- Semidefinite Programming
- Sufficiency of Exact Penalty Minimization
- Convex Analysis
- A second-order bundle method to minimize the maximum eigenvalue function.
- Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
