Vector Optimization and Monotone Operators via Convex Duality
From MaRDI portal
Publication:2922135
DOI10.1007/978-3-319-08900-3zbMath1337.90080OpenAlexW2480150299MaRDI QIDQ2922135
Publication date: 9 October 2014
Published in: Vector Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08900-3
Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Duality theory (optimization) (49N15)
Related Items (11)
Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ Inertial forward–backward methods for solving vector optimization problems ⋮ Complete characterizations of robust strong duality for robust vector optimization problems ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ Characterizations via linear scalarization of minimal and properly minimal elements ⋮ Robust duality for nonconvex uncertain vector optimization via a general scalarization ⋮ Nonlinear Cone Separation Theorems in Real Topological Linear Spaces ⋮ On epsilon-stability in optimization ⋮ Duality for Multiobjective Semidefinite Optimization Problems ⋮ New Farkas-type results for vector-valued functions: a non-abstract approach ⋮ Lagrange multipliers, duality, and sensitivity in set-valued convex programming via pointed processes
This page was built for publication: Vector Optimization and Monotone Operators via Convex Duality
