Lagrangian duality and cone convexlike functions
From MaRDI portal
Publication:2471094
DOI10.1007/s10957-007-9221-1zbMath1146.90087OpenAlexW3122195666MaRDI QIDQ2471094
Publication date: 18 February 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://repub.eur.nl/pub/1931/ERS%202005%20019%20LIS.pdf
Related Items
Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions ⋮ Unnamed Item ⋮ A note on nonconvex minimax theorem with separable homogeneous polynomials ⋮ Image space approach and subdifferentials of integral functionals ⋮ Strong duality for generalized convex optimization problems ⋮ Lagrangian duality and cone convexlike functions ⋮ Duality for almost convex optimization problems via the perturbation approach ⋮ Optimality conditions of vector set-valued optimization problem involving relative interior ⋮ Some applications of the image space analysis to the duality theory for constrained extremum problems ⋮ Are dualities appropriate for duality theories in optimization? ⋮ A set-valued Lagrange theorem based on a process for convex vector programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimax results and finite-dimensional separation
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Perfect duality for convexlike programs
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Image of a parametric optimization problem and continuity of the perturbation function
- Lagrange multipliers and saddle points in multiobjective programming
- On convex generalized systems
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Theorems of the alternative and optimality conditions
- On equivalent results in minimax theory
- Lagrangian duality and cone convexlike functions
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convex Analysis
- Minimax Theorems
