A decomposition algorithm for the sums of the largest eigenvalues
From MaRDI portal
Recommendations
- 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 space decomposition theory for a class of eigenvalue optimizations
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
- scientific article; zbMATH DE number 7313894
Cites work
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- A semidefinite programming approach to the quadratic knapsack problem
- A space decomposition scheme for maximum eigenvalue functions and its applications
- A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
- Active Sets, Nonsmoothness, and Sensitivity
- Extremal eigenvalue problems for two-phase conductors
- First- and second-order epi-differentiability in eigenvalue optimization
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 3214194 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- scientific article; zbMATH DE number 967335 (Why is no real title available?)
- Large-Scale Optimization of Eigenvalues
- Manifolds, tensor analysis, and applications.
- On Eigenvalue Optimization
- Optimal stability and eigenvalue multiplicity
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- Semidefinite Programming
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Solutions to shape and topology eigenvalue optimization problems using a homogenization method
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- The \U-Lagrangian of the Maximum Eigenvalue Function
- The space decomposition theory for a class of eigenvalue optimizations
- The 𝒰-Lagrangian of a convex function
Cited in
(7)- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
- 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
- An algorithm for the largest eigenvalue of nonhomogeneous nonnegative polynomials
- The \U-Lagrangian of the Maximum Eigenvalue Function
- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
- A proximal bundle approach for solving the generalized variational inequalities with inexact data
This page was built for publication: A decomposition algorithm for the sums of the largest eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985169)