Characterizations of optimality without constraint qualification for the abstract convex program

DOI10.1007/BFB0120983zbMath0495.90085OpenAlexW179438227MaRDI QIDQ3959766

Jonathan M. Borwein, Henry Wolkowicz

Publication date: 1982

Published in: Optimality and Stability in Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120983

zbMATH Keywords

optimality conditionssubdifferentialsemi-infinite programmingLagrange multiplier theoremdirectional derivativeSlater's conditionclosed convex conelocally convex Hausdorff spacesabstract convex programmingcharacterizations of the optimal solutionfaithfully convexoperator constrained problems

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) General theory of locally convex spaces (46A03) Methods of successive quadratic programming type (90C55)

Related Items (26)

Optimization of steerable sensor network for threat detection ⋮ Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems ⋮ A simple constraint qualification in infinite dimensional programming ⋮ Results of farkas type ⋮ Characterizing optimality in mathematical programming models ⋮ Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Nonlinear alternative theorems and nondifferentiable programming ⋮ Strong duality and minimal representations for cone optimization ⋮ Implicit optimality criterion for convex SIP problem with box constrained index set ⋮ Necessary and sufficient conditions for regularity of constraints in convex programming ⋮ Regularizing the abstract convex program ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Generalizations of Slater's constraint qualification for infinite convex programs ⋮ Optimality criteria without constraint qualifications for linear semidefinite problems ⋮ On minimization subject to cone constraints ⋮ Generalized convexity in nondifferentiable programming ⋮ Perturbed convex programming in reflexive Banach spaces ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ Geometry of optimality conditions and constraint qualifications: The convex case ⋮ Nonconvex theorems of the alternative and minimization ⋮ An extension lemma and homogeneous programming ⋮ A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes ⋮ Direct theorems in semi-infinite convex programming ⋮ A geometric Gordan-Stiemke theorem ⋮ Small convex-valued subdifferentials in mathematical programming

This page was built for publication: Characterizations of optimality without constraint qualification for the abstract convex program