Pages that link to "Item:Q5428420"
From MaRDI portal
The following pages link to New Farkas-type constraint qualifications in convex infinite programming (Q5428420):
Displaying 50 items.
- Constraint qualifications in convex vector semi-infinite optimization (Q320868) (← links)
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs (Q353157) (← links)
- Normal subdifferentials of efficient point multifunctions in parametric vector optimization (Q360483) (← links)
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints (Q377740) (← links)
- Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization (Q386471) (← links)
- A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484) (← links)
- Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian (Q454254) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Isolated and proper efficiencies in semi-infinite vector optimization problems (Q467444) (← links)
- New glimpses on convex infinite optimization duality (Q496382) (← links)
- Optimality conditions for nonlinear infinite programming problems (Q497442) (← links)
- Semi-infinite optimization under convex function perturbations: Lipschitz stability (Q535062) (← links)
- \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions (Q536840) (← links)
- Necessary optimality conditions for nonsmooth semi-infinite programming problems (Q537966) (← links)
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
- Clarke coderivatives of efficient point multifunctions in parametric vector optimization (Q603038) (← links)
- Revisiting some rules of convex analysis (Q683299) (← links)
- Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
- On constraint qualifications of a nonconvex inequality (Q723504) (← links)
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming (Q724901) (← links)
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155) (← links)
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs (Q849329) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- Characterizations of optimal solution sets of convex infinite programs (Q1024702) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications (Q1615937) (← links)
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems (Q1660296) (← links)
- A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization (Q1935288) (← links)
- Stationarity and regularity of infinite collections of sets (Q1937086) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications (Q2025164) (← links)
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data (Q2037900) (← links)
- Simple bilevel programming and extensions (Q2039237) (← links)
- Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus (Q2047258) (← links)
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs (Q2076392) (← links)
- An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty (Q2188944) (← links)
- Marco A. López, a pioneer of continuous optimization in Spain (Q2189625) (← links)
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting (Q2191769) (← links)
- Multiobjective DC programs with infinite convex constraints (Q2249821) (← links)
- Nonsmooth semi-infinite multiobjective optimization problems (Q2251568) (← 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)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- The stable duality of DC programs for composite convex functions (Q2358470) (← links)
