Global optimization of univariate Lipschitz functions. I: Survey and properties

DOI10.1007/BF01581202zbMath0825.90755OpenAlexW1963550851MaRDI QIDQ1198732

Shi Hui Lu, Pierre Hansen, Brigitte Jaumard

Publication date: 16 January 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581202

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (26)

Finding maximum likelihood estimators for the three-parameter Weibull distribution ⋮ Finding all solutions of nonlinearly constrained systems of equations ⋮ An adaptive stochastic global optimization algorithm for one-dimensional functions ⋮ Towards pure adaptive search ⋮ \(\alpha BB\): A global optimization method for general constrained nonconvex problems ⋮ An algorithm for solving global optimization problems with nonlinear constraints ⋮ Planning of life-depleting preventive maintenance activities with replacements ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds. ⋮ Lipschitz minorants of Brownian motion and Lévy processes ⋮ On Timonov's algorithm for global optimization of univariate Lipschitz functions ⋮ Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization ⋮ Unconstrained and constrained global optimization of polynomial functions in one variable ⋮ A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization) ⋮ A global minimization algorithm for Lipschitz functions ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison ⋮ Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem ⋮ Optimum departure times for commuters in congested networks ⋮ On convergence of "divide the best" global optimization algorithms ⋮ A multi-local optimization algorithm ⋮ A global optimization approach for solving non-monotone variational inequality problems ⋮ Global one-dimensional optimization using smooth auxiliary functions ⋮ New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints ⋮ On using estimates of Lipschitz constants in global optimization ⋮ Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Extended univariate algorithms for \(n\)-dimensional global optimization
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• The cubic algorithm
• On the convergence of global methods in multiextremal optimization
• An interval version of Shubert's iterative method for the localization of the global maximum
• Global optimization on convex sets
• An algorithm for global optimization of Lipschitz continuous functions
• Precision, complexity, and computational schemes of the cubic algorithms
• The Beta-algorithm
• Bounds for min-max heaps
• On Timonov's algorithm for global optimization of univariate Lipschitz functions
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
• On using estimates of Lipschitz constants in global optimization
• Outer approximation algorithm for nondifferentiable optimization problems
• On a sequential search strategy in global optimization problems
• Optimum departure times for commuters in congested networks
• Uncapacitated Plant Location Under Alternative Spatial Price Policies
• Globally convergent methods for n-dimensional multiextremal optimization
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Min-max heaps and generalized priority queues
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• The search for a global maximum of a function of several variables in a set specified by constraints of the inequality type
• Determination of the roots and of the global extremum of a lipschitz function
• Global minimization of univariate functions by sequential polynomial approximation
• Iterative Methods for the Localization of the Global Maximum
• On the Number of Iterations of Piyavskii's Global Optimization Algorithm
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function
• Estimation of the efficiency of an absolute-minimum-finding algorithm
• Numerical methods for finding global extrema (Case of a non-uniform mesh)

This page was built for publication: Global optimization of univariate Lipschitz functions. I: Survey and properties