A norm minimization-based convex vector optimization algorithm
From MaRDI portal
Publication:2156397
DOI10.1007/s10957-022-02045-8zbMath1495.90171arXiv2104.10282OpenAlexW3154547765MaRDI QIDQ2156397
Çağın Ararat, Firdevs Ulus, Muhammad Umer
Publication date: 18 July 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.10282
approximation algorithmmultiobjective optimizationscalarizationnorm minimizationconvex vector optimization
Related Items (3)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Outer approximation algorithms for convex vector optimization problems
Cites Work
- 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
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
- Merit functions in vector optimization
- Polyhedral cones and positive operators
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- The vector linear program solver Bensolve -- notes on theoretical background
- On min-norm and min-max methods of multi-objective optimization
- Scalarizing vector optimization problems
- Multiple criteria decision analysis. State of the art surveys
- Trade-off analysis approach for interactive nonlinear multiobjective optimization
- Comparison of some scalarization methods in multiobjective optimization
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
- A Benson type algorithm for nonconvex multiobjective programming problems
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- Approximation methods in multiobjective programming
- Graph Implementations for Nonsmooth Convex Programs
- Vector Optimization
- Vector Optimization with Infimum and Supremum
- Solution concepts in vector optimization: a fresh look at an old story
- Scalarization in vector optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- A revised simplex method for linear multiple objective programs
- Distance Between Sets - A survey
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
- Multicriteria Optimization
- Set-valued Optimization
- Convex Analysis
This page was built for publication: A norm minimization-based convex vector optimization algorithm
