Perfect duality for convexlike programs

DOI10.1007/BF00934081zbMath0471.49033OpenAlexW1978305174MaRDI QIDQ1157569

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

zbMATH Keywords

duality gap Lagrangian function necessary condition for optimality maximizing problem minimizing problem convex Gateaux derivative convexlike programs perfect duality

Mathematics Subject Classification ID

Differentiation theory (Gateaux, Fréchet, etc.) on manifolds (58C20) Optimality conditions for minimax problems (49K35) Methods of successive quadratic programming type (90C55)

Related Items (42)

Optimality and duality in vector optimization problems involving arcwise connected \(d\)-type-I functions over cones ⋮ Convexlike alternative theorems and mathematical programming ⋮ Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems ⋮ A sharp Lagrange multiplier theorem for nonlinear programs ⋮ On the image of a constrained extremum problem and some applications to the existence of a minimum ⋮ A Derivative for Semipreinvex Functions and Its Applications in Semipreinvex Programming ⋮ Nonlinear programming via König's maximum theorem ⋮ Theorems of the alternative revisited and some extensions of Yuan's lemma ⋮ Pre-invex functions in multiple objective optimization ⋮ Lagrangian duality for minimization of nonconvex multifunctions ⋮ Convexity for set-valued maps ⋮ Dominating sets for convex functions with some applications ⋮ A class of semilocal \(E\)-preinvex functions and its applications in nonlinear programming ⋮ Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems ⋮ Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality ⋮ A class of nonconvex functions and mathematical programming ⋮ Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions. ⋮ Arcwise connected cone-convex functions and mathematical programming ⋮ Image space approach and subdifferentials of integral functionals ⋮ Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions ⋮ Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization ⋮ Saddle-point type optimality criteria and duality relations for generalized fractional programming. ⋮ Theorems of the alternative for multifunctions. ⋮ Arcwise cone connected functions and optimality. ⋮ Lagrangian duality and cone convexlike functions ⋮ Saddle-point type optimality criteria for optimization problem over cones. ⋮ Nondifferentiable optimization in banach space ⋮ Multiobjective fractional programming involving generalized semilocally V-type I-preinvex and related functions ⋮ Revisiting the Hahn-Banach theorem and nonlinear infinite programming ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality ⋮ On nonlinear multiple objective fractional programming involving semilocally type-I univex functions ⋮ Nonconvex theorems of the alternative and minimization ⋮ Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity ⋮ On convex generalized systems ⋮ Theorems of the alternative and optimality conditions for convexlike and general convexlike programming ⋮ Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity ⋮ Multiple objective fractional programming involving semilocally type I-preinvex and related functions ⋮ Generalized connected functions with respect to cones ⋮ Semilocal E-convexity and semilocal E-convex programming ⋮ Invex nonsmooth alternative theorem and applications^* ⋮ Convexlike and concavelike conditions in alternative, minimax, and minimization theorems

Cites Work

This page was built for publication: Perfect duality for convexlike programs