Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
From MaRDI portal
Publication:907199
DOI10.1016/j.cnsns.2014.08.025zbMath1329.90134OpenAlexW2023119259MaRDI QIDQ907199
Julius Žilinskas, Antanas Žilinskas
Publication date: 25 January 2016
Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cnsns.2014.08.025
Related Items (20)
An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations ⋮ An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making ⋮ A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems ⋮ A new trisection method for solving Lipschitz bi-objective optimization problems ⋮ An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ Reference-point-based branch and bound algorithm for multiobjective optimization ⋮ Preface to the special issue NUMTA 2013 ⋮ A hybrid of Bayesian approach based global search with clustering aided local refinement ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ Computationally efficient approach for solving lexicographic multicriteria optimization problems ⋮ Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants ⋮ Efficient multicriterial optimization based on intensive reuse of search information ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ A multi-objective \textbf{DIRECT} algorithm for ship hull optimization ⋮ Nonconvex constrained optimization by a filtering branch and bound ⋮ A general branch-and-bound framework for continuous global multiobjective optimization ⋮ A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization ⋮ An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
Uses Software
Cites Work
- On the worst-case optimal multi-objective global optimization
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Deterministic global optimization. Geometric branch-and-bound methods and their applications
- One-dimensional global optimization for observations with noise
- Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
- Nonlinear multiobjective optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Krill herd: A new bio-inspired optimization algorithm
- Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization
- Multi-objective optimal design of feedback controls for dynamical systems with hybrid simple cell mapping algorithm
- Stochastic global optimization.
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
- Simplicial Global Optimization
- An algorithm for finding the absolute extremum of a function
- Computational Complexity
- A Sequential Method Seeking the Global Maximum of a Function
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Introduction to global optimization.
This page was built for publication: Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
