Does optimality imply ill-posedness? some remarks about certain min-max optimization problems

DOI10.1080/02331930008844502zbMATH Open0956.49016OpenAlexW2021279230MaRDI QIDQ4512753FDOQ4512753

Authors: Jean-Pierre Dedieu 

Publication date: 5 November 2000

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930008844502

Recommendations

• Genericity and minimax optimization
• On minimax eigenvalue problems via constrained optimization
• On the need for special purpose algorithms for minimax eigenvalue problems
• A note on maxmin problem
• Nondifferentiability of an objective function at its point of minimum for most minimax problems

zbMATH Keywords

optimalityspectral radiusill-posednesslargest eigenvaluesymmetric matrixmin-max optimizationdegenerate solution

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35)

Cites Work

• On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• The shape of the ideal column
• On Eigenvalue Optimization
• Semi-Definite Matrix Constraints in Optimization

Cited In (2)

• Obituary: Jean-Pierre Dedieu, 1949-2012
• Title not available (Why is that?)

This page was built for publication: Does optimality imply ill-posedness? some remarks about certain min-max optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4512753)