Characterizations of optimality without constraint qualification for the abstract convex program

DOI10.1007/BFB0120983MaRDI QIDQ3959766zbMATH OpenOpenAlexFDO

Authors 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 conditionssubdifferentialdirectional derivativesemi-infinite programmingSlater's conditionLagrange multiplier theoremclosed convex conelocally convex Hausdorff spacesabstract convex programmingcharacterizations of the optimal solutionfaithfully convexoperator constrained problems

Mathematics Subject Classification ID

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

Cited in

(27)

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

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

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