On parallel and batch-cutting strategies for norm-minimization-based convex vector optimization
From MaRDI portal
Cites work
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- A class of adaptive algorithms for approximating convex bodies by polyhedra
- A modified Quasi-Newton method for vector optimization problem
- A norm minimization-based convex vector optimization algorithm
- An approximation algorithm for convex multi-objective programming problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Asymptotic estimates for best and stepwise approximation of convex bodies II
- Asymptotic estimates for best and stepwise approximation of convex bodies III
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 2205688 (Why is no real title available?)
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Multicriteria optimization using a genetic algorithm for determining a Pareto set
- Newton's method for convex programming and Tschebyscheff approximation
- Outer approximation algorithms for convex vector optimization problems
- Primal and dual approximation algorithms for convex vector optimization problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- The Cutting-Plane Method for Solving Convex Programs
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- Vector Optimization
- Vector Optimization with Infimum and Supremum
This page was built for publication: On parallel and batch-cutting strategies for norm-minimization-based convex vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325582)
