Pages that link to "Item:Q2706314"
From MaRDI portal
The following pages link to Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities (Q2706314):
Displaying 50 items.
- Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions (Q301732) (← links)
- Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity (Q475360) (← links)
- About \([q]\)-regularity properties of collections of sets (Q488731) (← links)
- Necessary optimality conditions for nonsmooth semi-infinite programming problems (Q537966) (← links)
- On constraint qualifications in nonsmooth optimization. (Q703169) (← links)
- On constraint qualifications of a nonconvex inequality (Q723504) (← links)
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming (Q724901) (← links)
- Study of a special nonlinear problem arising in convex semi-infinite programming (Q844519) (← links)
- Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets (Q852110) (← links)
- On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces (Q856819) (← links)
- Semi-infinite programming (Q869581) (← links)
- Characterizing robust local error bounds for linear inequality systems under data uncertainty (Q891541) (← links)
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces (Q929661) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices (Q987504) (← links)
- Abadie constraint qualifications for convex constraint systems and applications to calmness property (Q1673889) (← links)
- Optimality conditions for semi-infinite programming problems involving generalized convexity (Q1733329) (← links)
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems (Q1787821) (← links)
- Linear semi-infinite programming theory: an updated survey (Q1848390) (← links)
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization (Q1925778) (← links)
- Stationarity and regularity of infinite collections of sets (Q1937086) (← links)
- Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
- Characterizations for strong Abadie constraint qualification and applications to calmness (Q2032014) (← links)
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints (Q2046540) (← links)
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs (Q2076392) (← links)
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming (Q2228389) (← links)
- Strong Abadie CQ, ACQ, calmness and linear regularity (Q2248746) (← links)
- Quantitative characterizations of regularity properties of collections of sets (Q2260647) (← links)
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems (Q2261970) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q2336429) (← links)
- Optimality conditions in convex multiobjective SIP (Q2364489) (← links)
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems (Q2392776) (← links)
- An extension of the basic constraint qualification to nonconvex vector optimization problems (Q2393089) (← links)
- On strong and total Lagrange duality for convex optimization problems (Q2473844) (← links)
- Nonsmooth semi-infinite programming problems with mixed constraints (Q2518285) (← links)
- Strong uniqueness of the restricted Chebyshev center with respect to an RS-set in a Banach space (Q2567264) (← links)
- On nondifferentiable semi-infinite multiobjective programming with interval-valued functions (Q2691484) (← links)
- Optimality conditions for non-smooth semi-infinite programming (Q2786319) (← links)
- γ-Active Constraints in Convex Semi-Infinite Programming (Q2877741) (← links)
- Some results about the facial geometry of convex semi-infinite systems (Q3426239) (← links)
- On duality theory of convex semi-infinite programming (Q3534642) (← links)
- Strong CHIP for infinite systems of convex sets in normed linear spaces (Q3553765) (← links)
- <i>ϵ</i>-Efficient solutions in semi-infinite multiobjective optimization (Q4634336) (← links)
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators (Q4639127) (← links)
- Optimality, scalarization and duality in linear vector semi-infinite programming (Q4643678) (← links)
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming (Q4646538) (← links)
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces (Q4989940) (← links)
- Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation (Q5221266) (← links)
