Convexlike alternative theorems and mathematical programming
The author extends a theorem of the alternative for convexlike functions, due to \textit{M. Hayashi} and \textit{H. Komiya} [J. Optimization Theory Appl. 38, 179-189 (1982; Zbl 0471.49033)], to a larger class of functions, which are called \(\rho\)-convexlike. This is used to derive a saddlepoint theorem and a Lagrangian duality theorem for inequality constrained minimization problems defined by \(\rho\)-convexlike functions. For nondifferentiable problems, under a \(\rho\)-convexlikeness assumption on the directional derivatives of the functions, local necessary conditions of Fritz John and Kuhn Tucker types are presented. Another alternative theorem of Motzkin type for convexlike functions taking values in finite dimensional spaces, which extends a theorem of \textit{F. Giannessi} [ibid. 42, 331-365 (1984; Zbl 0504.49012)] for the convex case, is also given. This is applied to obtain new Fritz John and Kuhn Tucker type necessary optimality conditions for nondifferentiable problems, the directional derivatives of whose functions satisfy a convexlikeness condition.
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Infinite programming and theorems of the alternative
- Alternative theorems and optimality conditions with weakened convexity
- Generalized Motzkin theorems of the alternative and vector optimization problems
- A theorem of the alternative with application to convex programming: optimality, duality, and stability
- Duality in Fractional Programming: A Unified Approach
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- Minimax Theorems
- Perfect duality for convexlike programs
- Regularity and stability for the mathematical programming problem in Banach spaces
- Theorems of the alternative and optimality conditions
- Existence results and gap functions for the generalized equilibrium problem with composed functions
- Theorems of the alternative for multifunctions with applications to optimization: General results
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- Alternative theorems and optimality conditions with weakened convexity
- A class of nonconvex functions and pre-variational inequalities
- Zero duality gaps in infinite-dimensional programming
- Optimality conditions and duality involving arcwise connected and generalized arcwise connected functions
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
- Lagrangian duality for minimization of nonconvex multifunctions
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- Arcwise connected cone-convex functions and mathematical programming
- On convex generalized systems
- Generalized connected functions with respect to cones
- A theorem of the alternative with an arbitrary number of inequalities and quadratic programming
- New generalized convexity notion for set-valued maps and application to vector optimization
- Vector optimization with generalized cone locally connected functions
- Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions
- Invex-convexlike functions and duality
- Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
- Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces
- Theorems of the alternative revisited and some extensions of Yuan's lemma
- A decomposition approach to vector equilibrium problems
- Saddle-point type optimality criteria for optimization problem over cones.
- Approximate solutions and optimality conditions of vector variational inequalities in Banach spaces
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Image convexity of generalized systems with infinite-dimensional image and applications
- Existence results for strong vector equilibrium problems and their applications
- Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems
- On alternative theorems and necessary conditions for efficiency
- Nondifferentiable programming and duality with modified convexity
- A class of nonconvex functions and mathematical programming
- scientific article; zbMATH DE number 4044587 (Why is no real title available?)
- Non-convex infinite games
- On saddle points and optima for non-smooth and non-convex programs
- Invex nonsmooth alternative theorem and applications*
- Regularity Conditions and Optimality in Vector Optimization
- Nonconvex theorems of the alternative and minimization
- 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
- Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems
- Infinite programming and theorems of the alternative
- scientific article; zbMATH DE number 6729884 (Why is no real title available?)
- Optimality conditions and duality for fractional programming problems involving arcwise connected functions and their generalizations
- Nearly subconvexlike set-valued maps and vector optimization problems
- Decomposition of generalized vector variational inequalities
- Some new minimax theorems for generalized convexity
- Convex composite multi-objective nonsmooth programming
- Alternative theorem for sequences of functions and applications to optimization
- Vector optimization problems with weakened convex and weakened affine constraints in linear topological spaces
- -weak Pareto minimality in D. C. vector optimization
- A note on constraint qualification for saddle point conditions involving convex and linear affine functions
- Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities
- Duality and saddle-points for convex-like vector optimization problems on real linear spaces
- Generalized Motzkin theorems of the alternative and vector optimization problems
- Moreau-Rockafellar theorems for nonconvex set-valued maps
This page was built for publication: Convexlike alternative theorems and mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705226)