Pages that link to "Item:Q849329"

The following pages link to Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs (Q849329):

Displaying 50 items.

• Optimality conditions for pessimistic semivectorial bilevel programming problems (Q257725) (← 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)
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
• Variational analysis of marginal functions with applications to bilevel programming (Q415393) (← links)
• Subdifferential of optimal value functions in nonlinear infinite programming (Q434364) (← links)
• Nonsmooth semi-infinite programming problem using limiting subdifferentials (Q454252) (← links)
• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
• Isolated and proper efficiencies in semi-infinite vector optimization problems (Q467444) (← links)
• \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions (Q536840) (← links)
• Clarke coderivatives of efficient point multifunctions in parametric vector optimization (Q603038) (← links)
• Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
• A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function (Q635806) (← links)
• Necessary optimality conditions for bilevel minimization problems (Q654107) (← links)
• Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (Q663722) (← links)
• Duality for nonsmooth semi-infinite programming problems (Q691458) (← links)
• Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
• Generalized Clarke epiderivatives of parametric vector optimization problems (Q711695) (← links)
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← 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)
• Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• Nondifferentiable fractional semi-infinite multiobjective optimization problems (Q1785759) (← links)
• Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization (Q1925778) (← links)
• The bilevel programming problem: reformulations, constraint qualifications and optimality conditions (Q1949263) (← links)
• Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
• Simple bilevel programming and extensions (Q2039237) (← links)
• Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces (Q2116030) (← links)
• Interval-valued value function and its application in interval optimization problems (Q2140768) (← links)
• A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization (Q2230945) (← links)
• Multiobjective DC programs with infinite convex constraints (Q2249821) (← links)
• A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps'' (Q2317857) (← links)
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
• Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems (Q2351175) (← links)
• Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints (Q2392768) (← links)
• Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials (Q2698576) (← links)
• A Cutting Plane Approach for Solving Linear Bilevel Programming Problems (Q2808063) (← links)
• A class of integer linear fractional bilevel programming problems (Q2926478) (← 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)
• Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs (Q4634158) (← links)
• DC approach to weakly convex optimization and nonconvex quadratic optimization problems (Q4639126) (← links)
• Optimality Conditions for Special Semidefinite Bilevel Optimization Problems (Q4641672) (← links)
• Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials (Q4985185) (← links)
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions (Q4986403) (← links)