Computing the recession cone of a convex upper image via convex projection
From MaRDI portal
Publication:6593832
DOI10.1007/s10898-023-01351-3MaRDI QIDQ6593832
Firdevs Ulus, Gabriela Kováčová
Publication date: 27 August 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
recession coneconvex vector optimizationlinear vector optimizationconvex projectionunbounded vector optimization
Semidefinite programming (90C22) Convex programming (90C25) Multi-objective and goal programming (90C29) Quadratic programming (90C20) Linear programming (90C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Primal and dual approximation algorithms for convex vector optimization problems
- A parametric simplex algorithm for linear vector optimization problems
- An approximation algorithm for convex multi-objective programming problems
- Benson type algorithms for linear vector optimization and applications
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Multiobjective duality for convex semidefinite programming problems
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- Scalarizing vector optimization problems
- A note on completely positive relaxations of quadratic problems in a multiobjective framework
- Convex projection and convex multi-objective optimization
- A norm minimization-based convex vector optimization algorithm
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
- On the approximation of unbounded convex sets by polyhedra
- On solving parametric multiobjective quadratic programs with parameters in general locations
- Vector Optimization with Infimum and Supremum
- Semidefinite Programming
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Foundations of Set-Semidefinite Optimization
- Continuity of Some Convex-Cone-Valued Mappings
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
- Using multiobjective optimization to map the entropy region
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
This page was built for publication: Computing the recession cone of a convex upper image via convex projection