The space decomposition theory for a class of eigenvalue optimizations
From MaRDI portal
Publication:457214
DOI10.1007/s10589-013-9624-xzbMath1335.90072OpenAlexW2087309362MaRDI QIDQ457214
Li-Ping Pang, Zun-Quan Xia, Ming Huang
Publication date: 26 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9624-x
nonsmooth optimizationeigenvalue optimizationD.C. function\({\mathcal{U}}\)-Lagrangian\({\mathcal{VU}}\)-decompositionlow rank matrix approximationsecond-order derivative
Related Items (8)
The bundle scheme for solving arbitrary eigenvalue optimizations ⋮ A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations ⋮ A space decomposition scheme for maximum eigenvalue functions and its applications ⋮ 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 superlinear space decomposition algorithm for constrained nonsmooth convex program
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- First and second order analysis of nonlinear semidefinite programs
- A semidefinite programming approach to the quadratic knapsack problem
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem
- Extremal eigenvalue problems for two-phase conductors
- A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- Exact matrix completion via convex optimization
- On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- Large-Scale Optimization of Eigenvalues
- Solutions to shape and topology eigenvalue optimization problems using a homogenization method
- Variational Analysis
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- 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
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- A Simpler Approach to Matrix Completion
- Convex Analysis
- A second-order bundle method to minimize the maximum eigenvalue function.
This page was built for publication: The space decomposition theory for a class of eigenvalue optimizations
