Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form
From MaRDI portal
Publication:1321302
DOI10.1007/BF00939609zbMath0802.49020MaRDI QIDQ1321302
Publication date: 1 December 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some remarks on the construction of higher order algorithms in convex optimization
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- Perturbation theory and derivatives of matrix eigensystems
- On eigenvalues of matrices dependent on a parameter
- Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
- Semi-Definite Matrix Constraints in Optimization
- Optimization and nonsmooth analysis
- Exclusion Theorems and the Perturbation Analysis of the Generalized Eigenvalue Problem
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Eigenvalue perturbations and nonlinear parametric optimization
- A Note on Local Behavior of Multiple Eigenvalues
- On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
- Convex Analysis
This page was built for publication: Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form