Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
type: Item
instance of: scholarly article
title: Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
zbMATH Open document ID: 0644.90080
DOI: 10.1007/BF00962799
author: C. C. Meewella
author: D. Q. Mayne
published in: Journal of Optimization Theory and Applications
publication date: 1989-01-01T00:00:00Z
review text: A domain partitioning algorithm for minimizing or maximizing a Lipschitz continuous function is enhanced to yield two new, more efficient algorithms. The use of interval arithmetic in the case of rational functions and the estimates of Lipschitz constants valid in subsets of the domain in the case of others, and the addition of local optimization has resulted in an algorithm which, in tests on standard functions, performs well.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4051366
zbMATH Keywords: domain partitioning algorithm
zbMATH Keywords: Lipschitz continuous function
zbMATH Keywords: global optimization
zbMATH Keywords: nondifferentiable optimization
zbMATH Keywords: rational functions
MaRDI profile type: Publication
cites work: The Logic of Inductive Inference
cites work: Q5526189
cites work: Numerical methods for finding global extrema (Case of a non-uniform mesh)
cites work: A Sequential Method Seeking the Global Maximum of a Function
cites work: An algorithm for finding the absolute extremum of a function
cites work: Outer approximation algorithm for nondifferentiable optimization problems
cites work: An algorithm for global optimization of Lipschitz continuous functions
cites work: Extended univariate algorithms for \(n\)-dimensional global optimization
cites work: Global optimization using interval analysis - the multi-dimensional case
cites work: A method of unconstrained global optimization
cites work: Global optimization by controlled random search
cites work: Q5600158
cites work: On Descent from Local Minima
cites work: Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
cites work: Some experiments in global optimization
cites work: Q3214304
cites work: Q4177355
cites work: Q3897937
full work available at URL: https://doi.org/10.1007/bf00962799
OpenAlex ID: W2086636094
description: scientific article; zbMATH DE number 4051366