Lagrange multipliers, duality, and sensitivity in set-valued convex programming via pointed processes

DOI10.1007/S10957-022-02005-2MaRDI QIDQ2116620zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10957-022-02005-2

zbMATH Keywords

sensitivitydualityLagrange multiplierprocessset-valued convex optimization

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48)

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

Cites work

• scientific article; zbMATH DE number 193898 (Why is no real title available?)
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 1379525 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• A Fenchel-Rockafellar duality theorem for set-valued optimization
• A duality theory for set-valued functions. I: Fenchel conjugation theory
• A set-valued Lagrange theorem based on a process for convex vector programming
• Contingent derivative of the perturbation map in multiobjective optimization
• Convexity for set-valued maps
• Existence theorems for set optimization problems
• Existence theorems of set optimization with set-valued maps
• Lagrange duality in set optimization
• Lagrangian duality in set-valued optimization
• Nonconvex scalarization in set optimization with set-valued maps
• Nonlinear analysis and variational problems. In Honor of George Isac
• On cone convexity of set-valued maps
• On set-valued optimization.
• Optimality conditions for several types of efficient solutions of set-valued optimization problems
• Set-valued analysis
• Set-valued optimization. An introduction with applications
• Some equivalent problems in set optimization
• Variational analysis and applications
• Vector Optimization
• Vector Optimization with Infimum and Supremum
• Vector optimization and monotone operators via convex duality. Recent advances

Cited in

(3)

• A set-valued Lagrange theorem based on a process for convex vector programming
• Approximate Lagrangian duality and saddle point optimality in set optimization
• Lagrange duality in set optimization

Describes a project that uses

Uses Software

• BENSOLVE

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)