A new exclusion test for finding the global minimum
DOI10.1016/J.CAM.2006.01.028zbMATH Open1113.65060OpenAlexW2041683348MaRDI QIDQ869487FDOQ869487
Authors: 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
Recommendations
computational complexitynumerical examplesexclusion algorithmLipschitz condition functionLipschitz function of order \(\alpha\)minimization condition
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30)
Cites Work
- Rigorous global search: continuous problems
- Title not available (Why is that?)
- Cell-to-cell mapping. A method of global analysis for nonlinear systems
- Title not available (Why is that?)
- Extension of Piyavskii's algorithm to continuous global optimization
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Introduction to global optimization.
- A new exclusion test.
- Improving the efficiency of exclusion algorithms
- NP-Hardness of Some Linear Control Design Problems
- Global optimization
- Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
- Global optimization using interval analysis: The one-dimensional case
- A global optimization technique for checking parametric robustness
- Estimation of the Lipschitz constant of a function
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- 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
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
- On the complexity of exclusion algorithms for optimization
- A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
- On using estimates of Lipschitz constants in global optimization
- Evaluating Lipschitz constants for functions given by algorithms
- Title not available (Why is that?)
Cited In (5)
- Lipschitz condition for finding real roots of a vector function
- Algorithms for optimization problems with exclusion constraints
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
- On the complexity of exclusion algorithms for optimization
Uses Software
This page was built for publication: A new exclusion test for finding the global minimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869487)
