Pages that link to "Item:Q3959766"

The following pages link to Characterizations of optimality without constraint qualification for the abstract convex program (Q3959766):

Displaying 26 items.

• Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
• An extension lemma and homogeneous programming (Q761254) (← links)
• A geometric Gordan-Stiemke theorem (Q798735) (← links)
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems (Q1101679) (← links)
• Characterizing optimality in mathematical programming models (Q1108200) (← links)
• Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem (Q1117445) (← links)
• Regularizing the abstract convex program (Q1156085) (← links)
• Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330) (← links)
• Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971) (← links)
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes (Q1821698) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
• Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
• Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
• On minimization subject to cone constraints (Q3331805) (← links)
• Generalized convexity in nondifferentiable programming (Q3338844) (← links)
• Perturbed convex programming in reflexive Banach spaces (Q3347642) (← links)
• A simple constraint qualification in infinite dimensional programming (Q3731366) (← links)
• Results of farkas type (Q3732434) (← links)
• Nonlinear alternative theorems and nondifferentiable programming (Q3760302) (← links)
• Geometry of optimality conditions and constraint qualifications: The convex case (Q3877415) (← links)
• Direct theorems in semi-infinite convex programming (Q3923950) (← links)
• Necessary and sufficient conditions for regularity of constraints in convex programming (Q4327951) (← links)
• Nonconvex theorems of the alternative and minimization (Q4720306) (← links)
• Small convex-valued subdifferentials in mathematical programming (Q4764586) (← links)
• Optimization of steerable sensor network for threat detection (Q5300452) (← links)