Adaptive metrics for norm-minimization-based outer approximation in convex vector optimization
From MaRDI portal
Cites work
- A Benson type algorithm for nonconvex multiobjective programming problems
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A class of adaptive algorithms for approximating convex bodies by polyhedra
- A norm minimization-based convex vector optimization algorithm
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- An approximation algorithm for convex multi-objective programming problems
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximation of convex bodies by polytopes
- Constrained optimization using multiple objective programming
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Graph implementations for nonsmooth convex programs
- scientific article; zbMATH DE number 2205688 (Why is no real title available?)
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Outer approximation algorithms for convex vector optimization problems
- Primal and dual approximation algorithms for convex vector optimization problems
- Solving multiobjective mixed integer convex optimization problems
- The quickhull algorithm for convex hulls
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- Unbiased approximation in multicriteria optimization
- Vector Optimization
- Vector Optimization with Infimum and Supremum
- Vector variational inequalities and vector optimization. Theory and applications
This page was built for publication: Adaptive metrics for norm-minimization-based outer approximation in convex vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446521)