The mathematics of eigenvalue optimization
From MaRDI portal
Publication:1403286
DOI10.1007/s10107-003-0441-3zbMath1035.90085OpenAlexW2127450210MaRDI QIDQ1403286
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0441-3
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Inequalities involving eigenvalues and eigenvectors (15A42) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (24)
A multilevel, level-set method for optimizing eigenvalues in shape design problems ⋮ A way of updating the density function for the design of the drum ⋮ Generalized derivatives of eigenvalues of a symmetric matrix ⋮ Regularity properties of non-negative sparsity sets ⋮ Counting Real Critical Points of the Distance to Orthogonally Invariant Matrix Sets ⋮ Exact matrix completion via convex optimization ⋮ The degrees of freedom of partly smooth regularizers ⋮ Some majorization inequalities induced by Schur products in Euclidean Jordan algebras ⋮ The higher-order derivatives of spectral functions ⋮ Variational analysis of convexly generated spectral max functions ⋮ The exponentiated Hencky-logarithmic strain energy. I: Constitutive issues and rank-one convexity ⋮ A boundary piecewise constant level set method for boundary control of eigenvalue optimization problems ⋮ On the computation of analytic sensitivities of eigenpairs in isogeometric analysis ⋮ Some New Methods for Generating Convex Functions ⋮ Computational geometry of positive definiteness ⋮ Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler ⋮ The exponentiated Hencky-logarithmic strain energy. II: Coercivity, planar polyconvexity and existence of minimizers ⋮ Convex \(\mathrm{SO}(N) \times \mathrm{SO}(n)\)-invariant functions and refinements of von Neumann's inequality ⋮ Differentiation of generalized inverses for rational and polynomial matrices ⋮ Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints ⋮ Primal-Dual Interior-Point Methods for Domain-Driven Formulations ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Approximate residual-minimizing shift parameters for the low-rank ADI iteration ⋮ A Subgradient Algorithm for Data-Rate Optimization in the Remote State Estimation Problem
This page was built for publication: The mathematics of eigenvalue optimization
