Geometric Duality for Convex Vector Optimization Problems
From MaRDI portal
Publication:2850733
zbMath1301.90083arXiv1109.3592MaRDI QIDQ2850733
Publication date: 30 September 2013
Full work available at URL: https://arxiv.org/abs/1109.3592
vector optimizationsecond-order subdifferentialLegendre-Fenchel conjugateDupin indicatrixgeometric duality theory
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Convex functions and convex programs in convex geometry (52A41) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (7)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Primal and dual approximation algorithms for convex vector optimization problems ⋮ Tractability of convex vector optimization problems in the sense of polyhedral approximations ⋮ Set Optimization—A Rather Short Introduction ⋮ Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs ⋮ Benson type algorithms for linear vector optimization and applications
Uses Software
This page was built for publication: Geometric Duality for Convex Vector Optimization Problems
