On minimax eigenvalue problems via constrained optimization (Q1090242): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable optimization algorithm for designing control systems having singular value inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Models for Nondifferentiable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problem / rank
 
Normal rank

Latest revision as of 20:04, 17 June 2024

scientific article
Language Label Description Also known as
English
On minimax eigenvalue problems via constrained optimization
scientific article

    Statements

    On minimax eigenvalue problems via constrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    We consider the problem of minimizing the maximum eigenvalues of a matrix. The aim is to show that this optimization problem can be transformed into a standard nonlinearly constrained optimization problem, and hence is solvable by existing software packages. For illustration, two examples are solved by using the proposed method.
    0 references
    0 references
    maximum eigenvalues
    0 references
    nonlinearly constrained optimization
    0 references