On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
From MaRDI portal
Publication:2199619
DOI10.1016/j.cnsns.2015.11.002OpenAlexW2119260517MaRDI QIDQ2199619
Gražina Gimbutienė, Antanas Žilinskas
Publication date: 11 September 2020
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.2015.11.002
Related Items
A new trisection method for solving Lipschitz bi-objective optimization problems ⋮ Reference-point-based branch and bound algorithm for multiobjective optimization ⋮ On the extension of the \textsc{direct} algorithm to multiple objectives ⋮ A multi-objective \textbf{DIRECT} algorithm for ship hull optimization ⋮ A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the worst-case optimal multi-objective global optimization
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- A deterministic global optimization using smooth diagonal auxiliary functions
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Average-case analysis of numerical problems
- 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
- Stochastic global optimization.
- An algorithm for finding the absolute extremum of a function
- A statistical model-based algorithm for ‘black-box’ multi-objective optimisation
- Computational Complexity
- A Sequential Method Seeking the Global Maximum of a Function
- Optimal strategies of the search for an extremum
- 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: On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
