Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
From MaRDI portal
Publication:1321653
DOI10.1007/BF01585173zbMath0806.90114OpenAlexW1969558191MaRDI QIDQ1321653
Robert S. Womersley, Michael L. Overton
Publication date: 23 May 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585173
Related Items
Variational analysis of the Ky Fan \(k\)-norm, An Improved Private Mechanism for Small Databases, The bundle scheme for solving arbitrary eigenvalue optimizations, Global method for learning an integrated temperature prediction model in a slab reheating furnace, A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations, Some geometric results in semidefinite programming, Augmented Lagrangian methods for convex matrix optimization problems, Constraint consensus methods for finding strictly feasible points of linear matrix inequalities, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, Discontinuous piecewise linear optimization, A space decomposition scheme for maximum eigenvalue functions and its applications, Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, Constructing optimal transition matrix for Markov chain Monte Carlo, Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines, A new perspective on low-rank optimization, Inradius and circumradius of various convex cones arising in applications, The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications, Computing maximin efficient experimental designs using the methods of semidefinite programming, \( L^2 \)-gradient flows of spectral functionals, Pareto robust optimization on Euclidean vector spaces, A fresh variational-analysis look at the positive semidefinite matrices world, The space decomposition theory for a class of eigenvalue optimizations, Multiple eigenvalue sensitivity analysis, First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints, A homotopy method based on penalty function for nonlinear semidefinite programming, Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems, Derivatives of orbital function and an extension of Berezin-Gel'fand's theorem, Supervised dimensionality reduction via sequential semidefinite programming, \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications, DC formulations and algorithms for sparse optimization problems, A fast space-decomposition scheme for nonconvex eigenvalue optimization, Semidefinite programming for discrete optimization and matrix completion problems, Calibrating low-rank correlation matrix problem: an SCA-based approach, Smoothing method for minimizing the sum of therlargest functions, Fast linear iterations for distributed averaging, Second-order directional derivatives of all eigenvalues of a symmetric matrix, On a minimum enclosing ball of a collection of linear subspaces, Method of centers for minimizing generalized eigenvalues, A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix, Feature selection in SVM via polyhedral \(k\)-norm, A new barrier for a class of semidefinite problems, An empirical comparison of two approaches for CDPCA in high-dimensional data, A Decomposition Algorithm for the Sums of the Largest Eigenvalues, Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality, Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering, First- and second-order epi-differentiability in eigenvalue optimization, Error bounds for eigenvalue and semidefinite matrix inequality systems, 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 quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix, B-Subdifferentials of the Projection onto the Generalized Simplex, On norm sub-additivity and super-additivity inequalities for concave and convex functions, Penalty/Barrier multiplier algorthm for semidefinit programming∗
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal problems on the set of nonnegative definite matrices
- Linear programming with matrix variables
- A projection technique for partitioning the nodes of a graph
- Semi-Definite Matrix Constraints in Optimization
- Matrix Analysis
- Optimization and nonsmooth analysis
- The Formulation and Analysis of Numerical Methods for Inverse Eigenvalue Problems
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Dual Algorithm for Orthogonal Procrustes Rotations
- Convex spectral functions
- Large-Scale Optimization of Eigenvalues
- Selection of Chain Sampling Plans ChSP-1 and ChSP-(0.1) for Given Acceptable Quality Level and Limiting Quality Level
- On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
- Convex Analysis
- Some convexity theorems for matrices
- An Extremum Property of Sums of Eigenvalues
