Generic well posedness of supinf problems

DOI10.1017/S0004972700015033zbMath0874.90191OpenAlexW2067151942MaRDI QIDQ4346955

Roberto Lucchetti, Kenderov, Petar S.

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

well posednessdense completely metrisable subset

Mathematics Subject Classification ID

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

Related Items (2)

Variational principles for supinf problems with constraints ⋮ Perturbations of supinf problems with constraints

Cites Work

• Borel selectors for upper semi-continuous set-valued maps
• Dynamic noncooperative game theory
• The EPI-Distance Topology: Continuity and Stability Results with Applications to Convex Optimization Problems
• The Banach-Mazur Game and Generic Existence of Solutions to Optimization Problems
• Convex Optimization and the Epi-Distance Topology
• On the stability of the functional optimization problem
• Unnamed Item
• Unnamed Item

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