A Benson-type algorithm for bounded convex vector optimization problems with vertex selection

DOI10.1080/10556788.2021.1880579zbMath1502.90164arXiv2006.15600OpenAlexW3130355952MaRDI QIDQ5043850

Christopher Schneider, Daniel Dörfler, Benjamin Weißing, Andreas Löhne

Publication date: 6 October 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.15600

zbMATH Keywords

algorithmsvector optimizationconvex programmingpolyhedral approximationmultiple objective optimization

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Convex projection and convex multi-objective optimization ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Existence results and optimization over the set of efficient solutions in vector-valued approximation theory ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Outer approximation algorithms for convex vector optimization problems ⋮ Polyhedral approximation of spectrahedral shadows via homogenization

Uses Software

• Gurobi
• CVX
• ElemStatLearn
• BENSOLVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• Primal and dual approximation algorithms for convex vector optimization problems
• An approximation algorithm for convex multi-objective programming problems
• Benson type algorithms for linear vector optimization and applications
• Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
• Approximating the nondominated set of an MOLP by approximately solving its dual problem
• An outer approximation method for globally minimizing a concave function over a compact convex set
• On outer approximation methods for solving concave minimization problems
• Extensions of Radstrom's lemma with application to stability theory of mathematical programming
• Scalarization of vector optimization problems
• Analysis of the objective space in multiple objective linear programming
• Trees and hills: methodology for maximizing functions of systems of linear relations
• Newton's method for convex programming and Tschebyscheff approximation
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• A vector linear programming approach for certain global optimization problems
• Tractability of convex vector optimization problems in the sense of polyhedral approximations
• Least angle regression. (With discussion)
• Optimization methods in structural design
• Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net
• Approximation methods in multiobjective programming
• Graph Implementations for Nonsmooth Convex Programs
• Vector Optimization with Infimum and Supremum
• Solution concepts in vector optimization: a fresh look at an old story
• The Cutting-Plane Method for Solving Convex Programs
• Scalarization in vector optimization
• Efficient optimization of hyper-parameters for least squares support vector regression
• Regularization and Variable Selection Via the Elastic Net
• Variable Ordering Structures in Vector Optimization
• The Supporting Hyperplane Method for Unimodal Programming
• Using multiobjective optimization to map the entropy region

This page was built for publication: A Benson-type algorithm for bounded convex vector optimization problems with vertex selection