Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
From MaRDI portal
Publication:2199788
DOI10.1016/J.CAM.2020.113134zbMATH Open1450.90036OpenAlexW3047097445MaRDI QIDQ2199788FDOQ2199788
Authors: Yaroslav D. Sergeyev, Maria Chiara Nasso, Marat S. Mukhametzhanov, Dmitri E. Kvasov 
Publication date: 14 September 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2020.113134
Recommendations
- Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
- scientific article; zbMATH DE number 1058962
- Global one-dimensional optimization using smooth auxiliary functions
- A univariate global search working with a set of Lipschitz constants for the first derivative
- scientific article; zbMATH DE number 757681
Cites Work
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- 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
- Lipschitz global optimization methods in control problems
- Higher order numerical differentiation on the infinity computer
- Global one-dimensional optimization using smooth auxiliary functions
- A deterministic algorithm for global optimization
- A parallel method for finding the global minimum of univariate functions
- Parallel characteristical algorithms for solving problems of global optimization
- An algorithm for finding the absolute extremum of a function
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
- An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- A one-dimensional deterministic global minimization algorithm
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- On convergence of "divide the best" global optimization algorithms
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- Title not available (Why is that?)
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
- Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- Iterative grossone-based computation of negative curvature directions in large-scale optimization
- Computation of higher order Lie derivatives on the infinity computer
- A Simulink-Based Infinity Computer Simulator and Some Applications
- Combining Bayesian optimization and Lipschitz optimization
Cited In (7)
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- Novel first and second order numerical differentiation techniques and their application to nonlinear analysis of Kirchhoff-Love shells
- Modelling human active search in optimizing black-box functions
- Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework
- Foreword to the virtual special issue dedicated to the 3rd international conference NUMTA 2019 ``Numerical computations: theory and algorithms
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
Uses Software
This page was built for publication: Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199788)
