An approximation algorithm for multi-objective optimization problems using a box-coverage
From MaRDI portal
Publication:2141729
DOI10.1007/s10898-021-01109-9zbMath1489.90173OpenAlexW3216881728MaRDI QIDQ2141729
Gabriele Eichfelder, Leo Warnow
Publication date: 25 May 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01109-9
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Adaptive sampling stochastic multigradient algorithm for stochastic multiobjective optimization ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Unnamed Item
Cites Work
- On the representation of the search region in multi-objective optimization
- A literature survey of benchmark functions for global optimisation problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Primal and dual approximation algorithms for convex vector optimization problems
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- An approximation algorithm for convex multi-objective programming problems
- The multicriteria big cube small cube method
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Nonlinear multiobjective optimization
- Variational methods in partially ordered spaces
- Unbiased approximation in multicriteria optimization
- Scalarizing vector optimization problems
- A general branch-and-bound framework for continuous global multiobjective optimization
- An algorithmic approach to multiobjective optimization with decision uncertainty
- An objective space cut and bound algorithm for convex multiplicative programmes
- The relationship between multi-objective robustness concepts and set-valued optimization
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Non-convex multi-objective optimization
- Finding representative systems for discrete bicriterion optimization problems
- Approximation methods in multiobjective programming
- An exact algorithm for biobjective integer programming problems
- A Method for Constrained Multiobjective Optimization Based on SQP Techniques
- A deterministic algorithm for global multi-objective optimization
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- Efficiency in multiple objective optimization problems
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
- Multicriteria Optimization
- Set-valued Optimization
This page was built for publication: An approximation algorithm for multi-objective optimization problems using a box-coverage
