Pages that link to "Item:Q5428420"

The following pages link to New Farkas-type constraint qualifications in convex infinite programming (Q5428420):

Displaying 23 items.

• Optimality conditions in convex multiobjective SIP (Q2364489) (← links)
• Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems (Q2392776) (← links)
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions (Q2438323) (← links)
• On strong and total Lagrange duality for convex optimization problems (Q2473844) (← links)
• Weaker conditions for subdifferential calculus of convex functions (Q2630793) (← links)
• Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality'' (Q2677659) (← links)
• On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems (Q2693966) (← links)
• Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials (Q2698576) (← links)
• Optimality conditions for non-smooth semi-infinite programming (Q2786319) (← links)
• Asymptotic optimality conditions for linear semi-infinite programming (Q2790886) (← links)
• γ-Active Constraints in Convex Semi-Infinite Programming (Q2877741) (← links)
• Extended Farkas lemma and strong duality for composite optimization problems with DC functions (Q2970390) (← links)
• Optimality Conditions for a Simple Convex Bilevel Programming Problem (Q2995267) (← links)
• A closedness condition and its applications to DC programs with convex constraints (Q3577846) (← links)
• Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function (Q4634099) (← links)
• Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials (Q4985185) (← links)
• The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces (Q4989940) (← links)
• Strong and total Lagrange dualities for quasiconvex programming (Q5088817) (← links)
• Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming (Q5857290) (← links)
• Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators (Q5865281) (← links)
• Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality (Q5879572) (← links)
• Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings (Q5963691) (← links)
• On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data (Q6126586) (← links)