On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
From MaRDI portal
Publication:1807819
DOI10.1023/A:1021780423989zbMath0937.90127OpenAlexW1605010047MaRDI QIDQ1807819
Publication date: 14 June 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021780423989
Related Items (21)
On approximate efficiency in multiobjective programming ⋮ On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions ⋮ Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints ⋮ Applying convexificators in robust multiobjective optimization ⋮ Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. ⋮ A complete characterization of strong duality in nonconvex optimization with a single constraint ⋮ On first order optimality conditions for vector optimization ⋮ A general approach for studying duality in multiobjective optimization ⋮ New constraint qualification and conjugate duality for composed convex optimization problems ⋮ On linear programming duality and necessary and sufficient conditions in minimax theory ⋮ Strong duality for generalized convex optimization problems ⋮ Lagrangian duality and cone convexlike functions ⋮ Duality for almost convex optimization problems via the perturbation approach ⋮ Separation of sets and Wolfe duality ⋮ A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints ⋮ On the Fritz John saddle point problem for differentiable multiobjective optimization ⋮ Improvement sets and vector optimization ⋮ Optimality conditions of vector set-valued optimization problem involving relative interior ⋮ Proper efficiency in vector optimization on real linear spaces.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequality systems and optimization
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- On the image of a constrained extremum problem and some applications to the existence of a minimum
- Perfect duality for convexlike programs
- Lagrange multipliers and saddle points in multiobjective programming
- Über das von-Neumannsche Minimax-Theorem
- Nonconvex theorems of the alternative and minimization
- Convex Analysis
- Minimax Theorems
This page was built for publication: On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
