Spectrally constrained optimization
From MaRDI portal
Publication:6608071
Recommendations
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- On minimizing the largest eigenvalue of a symmetric matrix
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
Cites work
- scientific article; zbMATH DE number 3791529 (Why is no real title available?)
- scientific article; zbMATH DE number 46301 (Why is no real title available?)
- scientific article; zbMATH DE number 3554030 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 802915 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- scientific article; zbMATH DE number 967335 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A primal-dual interior point method whose running time depends only on the constraint matrix
- A subspace method for large-scale eigenvalue optimization
- Adaptive subgradient methods for online learning and stochastic optimization
- An overview of the estimation of large covariance and precision matrices
- Calculus without derivatives
- Condition-Number-Regularized Covariance Estimation
- Derivatives of Spectral Functions
- Distance metric learning with eigenvalue optimization
- Error bounds for eigenvalue and semidefinite matrix inequality systems
- Exact matrix completion via convex optimization
- First-order methods in optimization
- Global Error Bounds for Convex Conic Problems
- Global Optimality in Low-Rank Matrix Optimization
- Large-Scale Optimization of Eigenvalues
- Matrix Analysis
- Matrix Preconditioning Techniques and Applications
- Methods of conjugate gradients for solving linear systems
- Nonsmooth analysis of eigenvalues
- Numerical optimization of eigenvalues of Hermitian matrix functions
- On Eigenvalue Optimization
- On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
- On generalizing trace minimization principles
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Phase retrieval via matrix completion
- Positive definite matrix approximation with condition number constraint
- Preconditioning
- Projection onto a polyhedron that exploits sparsity
- Semidefinite Programming
- Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- The Clarke and Michel-Penot subdifferentials of the eigenvalues of a symmetric matrix
- The mathematics of eigenvalue optimization
- Theory of semidefinite programming for sensor network localization
- Twice differentiable spectral functions
This page was built for publication: Spectrally constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608071)