A new exclusion test for finding the global minimum

DOI10.1016/j.cam.2006.01.028zbMath1113.65060OpenAlexW2041683348MaRDI QIDQ869487

Ibraheem Alolyan

Publication date: 8 March 2007

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2006.01.028

zbMATH Keywords

computational complexitynumerical examplesexclusion algorithmLipschitz condition functionLipschitz function of order \(\alpha\)minimization condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS

Uses Software

• Matlab
• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of exclusion algorithms for optimization
• Cell-to-cell mapping. A method of global analysis for nonlinear systems
• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• Global optimization using interval analysis: The one-dimensional case
• Extension of Piyavskii's algorithm to continuous global optimization
• A global optimization technique for checking parametric robustness
• On using estimates of Lipschitz constants in global optimization
• Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
• Rigorous global search: continuous problems
• Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
• A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
• Evaluating Lipschitz constants for functions given by algorithms
• A new exclusion test.
• Estimation of the Lipschitz constant of a function
• Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
• Improving the efficiency of exclusion algorithms
• Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
• Subdivision Direction Selection in Interval Methods for Global Optimization
• NP-Hardness of Some Linear Control Design Problems
• Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
• Global optimization
• Introduction to global optimization.

This page was built for publication: A new exclusion test for finding the global minimum