On minimax eigenvalue problems via constrained optimization

DOI10.1007/BF00939329zbMath0619.90067MaRDI QIDQ1090242

C. J. Goh, Kok Lay Teo

Publication date: 1988

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

maximum eigenvalues; nonlinearly constrained optimization

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

On the need for special purpose algorithms for minimax eigenvalue problems, Method of centers for minimizing generalized eigenvalues, A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix, Simultaneous stabilization of linear single-input systems by linear state feedback control

Uses Software

• NLPQL

Cites Work

• Unnamed Item
• Unnamed Item
• Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
• A globally convergent method for nonlinear programming
• The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem
• Algorithm Models for Nondifferentiable Optimization
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems