Generic well posedness of supinf problems

DOI10.1017/S0004972700015033MaRDI QIDQ4346955zbMATH OpenOpenAlexFDO

Authors Petar S. Kenderov, Roberto Lucchetti

Publication date 11 November 1997

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0004972700015033

zbMATH Keywords

dense completely metrisable subsetwell posedness

Mathematics Subject Classification ID

Programming in abstract spaces (90C48) Games involving topology, set theory, or logic (91A44)

Recommendations

• scientific article; zbMATH DE number 4113280
• scientific article; zbMATH DE number 3921349
• Perturbations of supinf problems with constraints
• Generic existence of solutions and generic well-posedness of optimization problems
• Generic well-posedness in minimization problems

Cites work

• Borel selectors for upper semi-continuous set-valued maps
• Convex Optimization and the Epi-Distance Topology
• Dynamic noncooperative game theory
• scientific article; zbMATH DE number 597945 (Why is no real title available?)
• scientific article; zbMATH DE number 923895 (Why is no real title available?)
• On the stability of the functional optimization problem
• The Banach-Mazur Game and Generic Existence of Solutions to Optimization Problems
• The EPI-Distance Topology: Continuity and Stability Results with Applications to Convex Optimization Problems

Cited in

(5)

• Variational principles for supinf problems with constraints
• Perturbations of supinf problems with constraints
• On a generalized sup-inf problem
• Variational principles for supinf problems
• Saddle points in completely regular topological spaces

This page was built for publication: Generic well posedness of supinf problems

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