Convexlike alternative theorems and mathematical programming

DOI10.1080/02331938508843061zbMath0581.90079OpenAlexW1996019509MaRDI QIDQ3705226

Vaithilingam Jeyakumar

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508843061

zbMATH Keywords

necessary optimality conditionsdirectional derivativestheorem of the alternativenondifferentiable problemsinequality constrained minimizationconvexlike functionsLagrangian duality theoremsaddlepoint theorem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Related Items (47)

Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces ⋮ Duality and saddle-points for convex-like vector optimization problems on real linear spaces ⋮ Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems ⋮ Image convexity of generalized systems with infinite-dimensional image and applications ⋮ Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems ⋮ Theorems of the alternative for multifunctions with applications to optimization: General results ⋮ Existence results for strong vector equilibrium problems and their applications ⋮ Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems ⋮ Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions ⋮ Invex-convexlike functions and duality ⋮ Theorems of the alternative revisited and some extensions of Yuan's lemma ⋮ Nondifferentiable programming and duality with modified convexity ⋮ Generalized Motzkin theorems of the alternative and vector optimization problems ⋮ Nearly subconvexlike set-valued maps and vector optimization problems ⋮ A decomposition approach to vector equilibrium problems ⋮ Lagrangian duality for minimization of nonconvex multifunctions ⋮ Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity ⋮ Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. ⋮ Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems ⋮ 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 ⋮ Decomposition of generalized vector variational inequalities ⋮ Non-convex infinite games ⋮ Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions ⋮ On saddle points and optima for non-smooth and non-convex programs ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization ⋮ Convex composite multi-objective nonsmooth programming ⋮ Saddle-point type optimality criteria for optimization problem over cones. ⋮ Approximate solutions and optimality conditions of vector variational inequalities in Banach spaces ⋮ A class of nonconvex functions and pre-variational inequalities ⋮ Regularity Conditions and Optimality in Vector Optimization ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ Optimality conditions and duality for fractional programming problems involving arcwise connected functions and their generalizations ⋮ Vector optimization with generalized cone locally connected functions ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ On alternative theorems and necessary conditions for efficiency ⋮ Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities ⋮ Zero duality gaps in infinite-dimensional programming ⋮ Nonconvex theorems of the alternative and minimization ⋮ Optimality conditions and duality involving arcwise connected and generalized arcwise connected functions ⋮ On convex generalized systems ⋮ Existence results and gap functions for the generalized equilibrium problem with composed functions ⋮ Generalized connected functions with respect to cones ⋮ Invex nonsmooth alternative theorem and applications^* ⋮ Convexlike and concavelike conditions in alternative, minimax, and minimization theorems

Cites Work

• Unnamed Item
• Perfect duality for convexlike programs
• Regularity and stability for the mathematical programming problem in Banach spaces
• Theorems of the alternative and optimality conditions
• A theorem of the alternative with application to convex programming: optimality, duality, and stability
• Duality in Fractional Programming: A Unified Approach
• Minimax Theorems

This page was built for publication: Convexlike alternative theorems and mathematical programming