Perfect duality for convexlike programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3696866 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3261766 (Why is no real title available?)
- A note on perfect duality and limiting lagrangeans
- Bitopological Spaces
- Convex analysis treated by linear programming
- Nonlinear programming in Banach spaces
Cited in
(42)- Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
- On nonlinear multiple objective fractional programming involving semilocally type-I univex functions
- Nonlinear programming via König's maximum theorem
- A class of nonconvex functions and mathematical programming
- Theorems of the alternative revisited and some extensions of Yuan's lemma
- Lagrangian duality for minimization of nonconvex multifunctions
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Saddle-point type optimality criteria and duality relations for generalized fractional programming.
- Theorems of the alternative for multifunctions.
- Invex nonsmooth alternative theorem and applications*
- Lagrangian duality and cone convexlike functions
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- A class of semilocal \(E\)-preinvex functions and its applications in nonlinear programming
- Nonconvex theorems of the alternative and minimization
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- Pre-invex functions in multiple objective optimization
- Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity
- A sharp Lagrange multiplier theorem for nonlinear programs
- On convex generalized systems
- Image space approach and subdifferentials of integral functionals
- Generalized connected functions with respect to cones
- Dominating sets for convex functions with some applications
- Arcwise connected cone-convex functions and mathematical programming
- Optimality and duality in vector optimization problems involving arcwise connected \(d\)-type-I functions over cones
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Multiple objective fractional programming involving semilocally type I-preinvex and related functions
- On the image of a constrained extremum problem and some applications to the existence of a minimum
- Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems
- Convexlike alternative theorems and mathematical programming
- Multiobjective fractional programming involving generalized semilocally V-type I-preinvex and related functions
- Arcwise cone connected functions and optimality.
- Convexity for set-valued maps
- Saddle-point type optimality criteria for optimization problem over cones.
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
- Semilocal E-convexity and semilocal E-convex programming
- Nondifferentiable optimization in banach space
- Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity
- Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality
- A derivative for semipreinvex functions and its applications in semipreinvex programming
- Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
This page was built for publication: Perfect duality for convexlike programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157569)
