Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions

DOI10.1007/BF00962799zbMath0644.90080OpenAlexW2086636094MaRDI QIDQ1102868

C. C. Meewella, David Q. Mayne

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationrational functionsnondifferentiable optimizationLipschitz continuous functiondomain partitioning algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Convergence qualification of adaptive partition algorithms in global optimization, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms, A global optimization approach for solving non-monotone variational inequality problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extended univariate algorithms for \(n\)-dimensional global optimization
• An algorithm for global optimization of Lipschitz continuous functions
• Global optimization using interval analysis - the multi-dimensional case
• Global optimization by controlled random search
• Outer approximation algorithm for nondifferentiable optimization problems
• A method of unconstrained global optimization
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• The Logic of Inductive Inference
• An algorithm for finding the absolute extremum of a function
• On Descent from Local Minima
• A Sequential Method Seeking the Global Maximum of a Function
• Numerical methods for finding global extrema (Case of a non-uniform mesh)
• Some experiments in global optimization