Lagrange multipliers, duality, and sensitivity in set-valued convex programming via pointed processes
DOI10.1007/S10957-022-02005-2zbMATH Open1487.90584OpenAlexW4210931769MaRDI QIDQ2116620FDOQ2116620
Fernando García-Castaño, Miguel Angel Melguizo Padial
Publication date: 18 March 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02005-2
Recommendations
- A set-valued Lagrange theorem based on a process for convex vector programming
- Lagrangian duality in set-valued optimization
- Approximate Lagrangian duality and saddle point optimality in set optimization
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Lagrangian duality for the set optimization problem
Convex programming (90C25) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48)
Cites Work
- Vector Optimization with Infimum and Supremum
- Title not available (Why is that?)
- Set-valued analysis
- On set-valued optimization.
- Convexity for set-valued maps
- Vector Optimization
- On cone convexity of set-valued maps
- Title not available (Why is that?)
- Set-valued Optimization
- Title not available (Why is that?)
- Nonconvex scalarization in set optimization with set-valued maps
- Contingent derivative of the perturbation map in multiobjective optimization
- Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems
- Lagrange duality in set optimization
- A duality theory for set-valued functions. I: Fenchel conjugation theory
- Existence theorems for set optimization problems
- Existence theorems of set optimization with set-valued maps
- Nonlinear analysis and variational problems. In Honor of George Isac
- Lagrangian duality in set-valued optimization
- Title not available (Why is that?)
- Some equivalent problems in set optimization
- Vector Optimization and Monotone Operators via Convex Duality
- A Fenchel–Rockafellar duality theorem for set-valued optimization
- Variational Analysis and Applications
- A set-valued Lagrange theorem based on a process for convex vector programming
Uses Software
This page was built for publication: Lagrange multipliers, duality, and sensitivity in set-valued convex programming via pointed processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116620)
