Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
From MaRDI portal
Publication:5300536
DOI10.1137/110859129zbMath1270.90049arXiv1307.3522OpenAlexW2045376744MaRDI QIDQ5300536
Daniela Lera, Yaroslav D. Sergeyev
Publication date: 27 June 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.3522
global optimizationaccelerationLipschitz functionsLipschitz derivativesbalancing local and global information
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (30)
Global optimization on an interval ⋮ Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback ⋮ Granular sieving algorithm for selecting best n$$ n $$ parameters ⋮ Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ On the Least-Squares Fitting of Data by Sinusoids ⋮ Global optimization method with numerically calculated function derivatives ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ Visualization of a statistical approximation of the Pareto front ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ Optimal switching between cash-flow streams ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ A deterministic method for continuous global optimization using a dense curve ⋮ Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ⋮ On the search of the shape parameter in radial basis functions using univariate global optimization methods ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ Performance of convex underestimators in a branch-and-bound framework ⋮ Steklov regularization and trajectory methods for univariate global optimization ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ Multidimensional global optimization using numerical estimates of objective function derivatives ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
This page was built for publication: Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives