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 QIDQ2199619FDOQ2199619
Authors: 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
Recommendations
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- scientific article; zbMATH DE number 757681
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
Cites Work
- Title not available (Why is that?)
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Computational Complexity
- Average-case analysis of numerical problems
- Introduction to global optimization.
- On the worst-case optimal multi-objective global optimization
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- An algorithm for finding the absolute extremum of a function
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Stochastic global optimization.
- A univariate global search working with a set of Lipschitz constants for the first derivative
- A statistical model-based algorithm for `black-box' multi-objective optimisation
- Optimal strategies of the search for an extremum
- 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
Cited In (7)
- A new trisection method for solving Lipschitz bi-objective optimization problems
- On the extension of the \textsc{direct} algorithm to multiple objectives
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- Reference-point-based branch and bound algorithm for multiobjective optimization
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
Uses Software
This page was built for publication: On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199619)
