On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization

DOI10.1016/J.CNSNS.2015.11.002MaRDI QIDQ2199619zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

optimal algorithmsbi-objective optimizationLipschitz optimizationtrisection

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

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

• scientific article; zbMATH DE number 43985 (Why is no real title available?)
• scientific article; zbMATH DE number 2205701 (Why is no real title available?)
• scientific article; zbMATH DE number 5487989 (Why is no real title available?)
• A Sequential Method Seeking the Global Maximum of a Function
• A deterministic global optimization using smooth diagonal auxiliary functions
• A one-step worst-case optimal algorithm for bi-objective univariate optimization
• A statistical model-based algorithm for `black-box' multi-objective optimisation
• A univariate global search working with a set of Lipschitz constants for the first derivative
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
• An algorithm for finding the absolute extremum of a function
• Average-case analysis of numerical problems
• Computational Complexity
• Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Introduction to global optimization.
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• On the worst-case optimal multi-objective global optimization
• Optimal strategies of the search for an extremum
• Stochastic global optimization.

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

Describes a project that uses

Uses Software

• Global Optimization Toolbox For Maple

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)