Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives

From MaRDI portal
Revision as of 21:50, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (30)

Global optimization on an intervalSafe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz frameworkSpace-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in roboticsCombining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedbackGranular sieving algorithm for selecting best n$$ n $$ parametersMetaheuristic vs. deterministic global optimization algorithms: the univariate caseOn the Least-Squares Fitting of Data by SinusoidsGlobal optimization method with numerically calculated function derivativesLipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimizationNovel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivativesA deterministic global optimization using smooth diagonal auxiliary functionsOn Acceleration of Derivative-Free Univariate Lipschitz Global Optimization MethodsA Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective OptimizationA one-step worst-case optimal algorithm for bi-objective univariate optimizationVisualization of a statistical approximation of the Pareto frontOperational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithmsOptimal switching between cash-flow streamsGlobally-biased disimpl algorithm for expensive global optimizationGOSH: derivative-free global optimization using multi-dimensional space-filling curvesA deterministic method for continuous global optimization using a dense curveBranching and bounding improvements for global optimization algorithms with Lipschitz continuity propertiesOn the search of the shape parameter in radial basis functions using univariate global optimization methodsDeterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constantsDerivative-free local tuning and local improvement techniques embedded in the univariate global optimizationAdvantages of simplicial partitioning for Lipschitz optimization problems with linear constraintsPerformance of convex underestimators in a branch-and-bound frameworkSteklov regularization and trajectory methods for univariate global optimizationGlobal optimization of expensive black box functions using potential Lipschitz constants and response surfacesMultidimensional global optimization using numerical estimates of objective function derivativesOn 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