On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
From MaRDI portal
Recommendations
Cites work
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Convex Analysis
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 592622 (Why is no real title available?)
- scientific article; zbMATH DE number 1046022 (Why is no real title available?)
- scientific article; zbMATH DE number 750721 (Why is no real title available?)
- scientific article; zbMATH DE number 895354 (Why is no real title available?)
- Inequality systems and optimization
- Lagrange multipliers and saddle points in multiobjective programming
- Minimax Theorems
- Nonconvex theorems of the alternative and minimization
- On the image of a constrained extremum problem and some applications to the existence of a minimum
- Perfect duality for convexlike programs
- Über das von-Neumannsche Minimax-Theorem
Cited in
(25)- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- On first order optimality conditions for vector optimization
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- A new class of generalized convex programming
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- Improvement sets and vector optimization
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- A general approach for studying duality in multiobjective optimization
- New constraint qualification and conjugate duality for composed convex optimization problems
- Lagrangian duality and cone convexlike functions
- On second-order generalized convexity
- GeneralizedF-convexity and its classification
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions
- On the Fritz John saddle point problem for differentiable multiobjective optimization
- Optimality conditions of vector set-valued optimization problem involving relative interior
- Applying convexificators in robust multiobjective optimization
- Mas-Colell properness condition and almost convexity in nonconvex optimization
- Proper efficiency in vector optimization on real linear spaces.
- On approximate efficiency in multiobjective programming
- On linear programming duality and necessary and sufficient conditions in minimax theory
- Strong duality for generalized convex optimization problems
- Duality for almost convex optimization problems via the perturbation approach
- Separation of sets and Wolfe duality
This page was built for publication: On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807819)
