The space decomposition theory for a class of eigenvalue optimizations

DOI10.1007/S10589-013-9624-XzbMATH Open1335.90072OpenAlexW2087309362MaRDI QIDQ457214FDOQ457214

Authors: Ming Huang, Li-Ping Pang, Zun-Quan Xia 

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

Recommendations

• The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
• A space decomposition scheme for maximum eigenvalue functions and its applications
• The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
• A fast space-decomposition scheme for nonconvex eigenvalue optimization
• scientific article; zbMATH DE number 7313894
• The space decomposition strategy to a class of nonconvex constrained optimization
• A UV-decomposition method for a class of maximum eigenvalue optimizations
• scientific article; zbMATH DE number 2188943
• Eigenvalues and nonsmooth optimization
• Correction to: ``A space decomposition scheme for maximum eigenvalue functions and its applications

zbMATH Keywords

eigenvalue optimizationnonsmooth optimizationD.C. function\({\mathcal{U}}\)-Lagrangian\({\mathcal{VU}}\)-decompositionlow rank matrix approximationsecond-order derivative

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Variational Analysis
• Exact matrix completion via convex optimization
• Semidefinite Programming
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Sensitivity analysis of all eigenvalues of a symmetric matrix
• Extremal eigenvalue problems for two-phase conductors
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• A simpler approach to matrix completion
• First and second order analysis of nonlinear semidefinite programs
• A \(\mathcal{VU}\)-algorithm for convex minimization
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The 𝒰-Lagrangian of a convex function
• Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
• A semidefinite programming approach to the quadratic knapsack problem
• Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
• Title not available (Why is that?)
• 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
• On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
• 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
• A second-order bundle method to minimize the maximum eigenvalue function.
• Solutions to shape and topology eigenvalue optimization problems using a homogenization method
• Title not available (Why is that?)
• Partially Augmented Lagrangian Method for Matrix Inequality Constraints
• On Eigenvalue Optimization
• Large-Scale Optimization of Eigenvalues
• A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem
• 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
• Title not available (Why is that?)
• The $\U$-Lagrangian of the Maximum Eigenvalue Function
• A superlinear space decomposition algorithm for constrained nonsmooth convex program

Cited In (13)

• A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
• Title not available (Why is that?)
• Some results on the \(\mathcal U\)-Langrangian of a class of maximum eigenvalue functions
• \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
• A second-order bundle method based on \(\mathcal{UV}\)-decomposition strategy for a special class of eigenvalue optimizations
• Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems
• The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
• A UV-decomposition method for a class of maximum eigenvalue optimizations
• The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
• A space decomposition scheme for maximum eigenvalue functions and its applications
• The bundle scheme for solving arbitrary eigenvalue optimizations
• On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
• A decomposition algorithm for the sums of the largest eigenvalues

This page was built for publication: The space decomposition theory for a class of eigenvalue optimizations

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