On efficiency of a single variable bi-objective optimization algorithm
From MaRDI portal
Publication:2300650
Recommendations
- Multiobjective Optimization Through a Series of Single-Objective Formulations
- Tracing locally Pareto-optimal points by numerical integration
- scientific article; zbMATH DE number 3891128
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- Approximations of objective functions and constraints in bi-criteria optimization problems
Cites work
- Adaptive approximation of the minimum of Brownian motion
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
- An adaptive univariate global optimization algorithm and its convergence rate under the Wiener measure
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Complexity of gradient descent for multiobjective optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- scientific article; zbMATH DE number 4070651 (Why is no real title available?)
- scientific article; zbMATH DE number 5487989 (Why is no real title available?)
- Non-convex multi-objective optimization
- On convergence rate of a rectangular partition based global optimization algorithm
- On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
- On the worst-case optimal multi-objective global optimization
- Tractability of multivariate problems. Volume II: Standard information for functionals.
Cited in
(8)- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- scientific article; zbMATH DE number 3891128 (Why is no real title available?)
- Tracing locally Pareto-optimal points by numerical integration
- Multiobjective Optimization Through a Series of Single-Objective Formulations
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems
- A Partition Based Bayesian Multi-objective Optimization Algorithm
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization
This page was built for publication: On efficiency of a single variable bi-objective optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300650)