A deterministic algorithm for global multi-objective optimization
From MaRDI portal
Recommendations
- An interval algorithm for multi-objective optimization
- A piecewise convexification method for non-convex multi-objective optimization programs with box constraints
- A numerical method for constructing the Pareto front of multi-objective optimization problems
- An efficient sampling approach to multiobjective optimization
- A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization
Cites work
- A deterministic algorithm for global optimization
- A deterministic approach to global box-constrained optimization
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- 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
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Gap-free computation of Pareto-points by quadratic scalarizations
- Multi-objective optimization using evolutionary algorithms
- Multiobjective evolutionary algorithms and applications.
- Nonlinear multiobjective optimization
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- On the placement of open-loop robotic manipulators for reachability
- Scalarizations for adaptively solving multi-objective optimization problems
- Scalarizing vector optimization problems
- Theory of multiobjective optimization
Cited in
(21)- Comparative efficiency of machine learning models for enhancing algorithms in solving multiextremal multicriteria problems
- Multiobjective optimization by using cutting angle methods and hypervolume criterion
- A new trisection method for solving Lipschitz bi-objective optimization problems
- Damage location in mechanical structures by multi-objective pattern search
- Computationally efficient approach for solving lexicographic multicriteria optimization problems
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
- Toward finding strong Pareto optimal policies in multi-agent reinforcement learning
- scientific article; zbMATH DE number 1975074 (Why is no real title available?)
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- An interval algorithm for multi-objective optimization
- Advancements in the computation of enclosures for multi-objective optimization problems
- On the extension of the \textsc{direct} algorithm to multiple objectives
- An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria
- Nonconvex constrained optimization by a filtering branch and bound
- A note on a deterministic global optimization algorithm
- A deterministic global optimization algorithm
- Sequential hierarchical least-squares programming for prioritized non-linear optimal control
- An efficient sampling approach to multiobjective optimization
- Integrating -dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
This page was built for publication: A deterministic algorithm for global multi-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926067)
