Perfect duality for convexlike programs
DOI10.1007/BF00934081zbMATH Open0471.49033OpenAlexW1978305174MaRDI QIDQ1157569FDOQ1157569
Authors: S. H. Smith 
Publication date: 1982
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934081
duality gapmaximizing problemLagrangian functionminimizing problemconvex Gateaux derivativeconvexlike programs perfect dualitynecessary condition for optimality
Methods of successive quadratic programming type (90C55) Optimality conditions for minimax problems (49K35) Differentiation theory (Gateaux, Fréchet, etc.) on manifolds (58C20)
Cites Work
Cited In (42)
- Generalized connected functions with respect to cones
- A class of nonconvex functions and mathematical programming
- Lagrangian duality for minimization of nonconvex multifunctions
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- A class of semilocal \(E\)-preinvex functions and its applications in nonlinear programming
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- Lagrangian duality and cone convexlike functions
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
- Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity
- Pre-invex functions in multiple objective optimization
- On nonlinear multiple objective fractional programming involving semilocally type-I univex functions
- Arcwise cone connected functions and optimality.
- Saddle-point type optimality criteria for optimization problem over cones.
- Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
- Arcwise connected cone-convex functions and mathematical programming
- On the image of a constrained extremum problem and some applications to the existence of a minimum
- Multiobjective fractional programming involving generalized semilocally V-type I-preinvex and related functions
- Saddle-point type optimality criteria and duality relations for generalized fractional programming.
- Theorems of the alternative for multifunctions.
- A sharp Lagrange multiplier theorem for nonlinear programs
- Optimality and duality in vector optimization problems involving arcwise connected \(d\)-type-I functions over cones
- Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
- Convexity for set-valued maps
- Dominating sets for convex functions with some applications
- Image space approach and subdifferentials of integral functionals
- Semilocal E-convexity and semilocal E-convex programming
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- On convex generalized systems
- Theorems of the alternative revisited and some extensions of Yuan's lemma
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Multiple objective fractional programming involving semilocally type I-preinvex and related functions
- Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems
- Nonconvex theorems of the alternative and minimization
- Nonlinear programming via König's maximum theorem
- Invex nonsmooth alternative theorem and applications*
- Nondifferentiable optimization in banach space
- A derivative for semipreinvex functions and its applications in semipreinvex programming
- Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity
- Convexlike alternative theorems and mathematical programming
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)
