Spectrally constrained optimization

DOI10.1007/S10915-024-02636-9MaRDI QIDQ6608071FDOQ6608071

Authors: Casey Garner, Gilad Lerman, Shuzhong Zhang 

Publication date: 19 September 2024

Published in: Journal of Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionconstrained optimizationeigenvalue optimizationFrank-Wolfe algorithmnon-smooth analysis

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Cites Work

• Adaptive subgradient methods for online learning and stochastic optimization
• Matrix Analysis
• Title not available (Why is that?)
• A Singular Value Thresholding Algorithm for Matrix Completion
• First-order methods in optimization
• Title not available (Why is that?)
• Condition-Number-Regularized Covariance Estimation
• Exact matrix completion via convex optimization
• Semidefinite Programming
• Methods of conjugate gradients for solving linear systems
• An overview of the estimation of large covariance and precision matrices
• Calculus without derivatives
• Distance metric learning with eigenvalue optimization
• Error bounds for eigenvalue and semidefinite matrix inequality systems
• Title not available (Why is that?)
• The Clarke and Michel-Penot subdifferentials of the eigenvalues of a symmetric matrix
• Nonsmooth analysis of eigenvalues
• Twice differentiable spectral functions
• Derivatives of Spectral Functions
• A primal-dual interior point method whose running time depends only on the constraint matrix
• Title not available (Why is that?)
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Title not available (Why is that?)
• Global Error Bounds for Convex Conic Problems
• Matrix Preconditioning Techniques and Applications
• On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
• The mathematics of eigenvalue optimization
• Projection onto a polyhedron that exploits sparsity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of semidefinite programming for sensor network localization
• On Eigenvalue Optimization
• Title not available (Why is that?)
• Large-Scale Optimization of Eigenvalues
• Numerical optimization of eigenvalues of Hermitian matrix functions
• Preconditioning
• Phase retrieval via matrix completion
• Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
• On generalizing trace minimization principles
• Positive definite matrix approximation with condition number constraint
• A subspace method for large-scale eigenvalue optimization
• Global Optimality in Low-Rank Matrix Optimization

Cited In (1)

• Eigenvalue programming beyond matrices

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)