Closedness conditions for the optimality of a family of non-convex optimization problems
From MaRDI portal
Publication:3220380
DOI10.1080/02331938408842946zbMath0555.90104OpenAlexW2089583469MaRDI QIDQ3220380
Publication date: 1984
Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938408842946
Set-valued maps in general topology (54C60) Special maps on topological spaces (open, closed, perfect, etc.) (54C10) Programming in abstract spaces (90C48)
Related Items
Optimality conditions in convex multiobjective SIP ⋮ Convex functions with continuous epigraph or continuous level sets ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs ⋮ Complete characterizations of stable Farkas' lemma and cone-convex programming duality ⋮ Non-convex infinite games ⋮ \(\varepsilon\)-optimality conditions for composed convex optimization problems ⋮ A dual criterion for maximal monotonicity of composition operators ⋮ A note on d-stability of convex programs and limiting Lagrangians ⋮ Relationships Between Farthest Point Problem and Best Approximation Problem ⋮ Necessary and sufficient conditions for stable conjugate duality ⋮ An application of the bivariate inf-convolution formula to enlargements of monotone operators ⋮ Infinite-dimensional convex programming with applications to constrained approximation