A new exclusion test for finding the global minimum

Authors:
Ibraheem Alolyan
Affiliations:
Mathematics Department, College of Science, King Saud University P.O. Box 2455, Riyadh 11451, Saudi Arabia
Venue:
Journal of Computational and Applied Mathematics
Year:
2007

Citing 18
Cited 2

New computer methods for global optimization

New computer methods for global optimization
Global optimization

Global optimization
On using estimates of Lipschitz constants in global optimization

Journal of Optimization Theory and Applications
A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations

Applied Mathematics and Computation
Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems

SIAM Journal on Scientific Computing
Subdivision Direction Selection in Interval Methods for Global Optimization

SIAM Journal on Numerical Analysis
NP-Hardness of Some Linear Control Design Problems

SIAM Journal on Control and Optimization
A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions

Applied Mathematics and Computation
Evaluating Lipschitz Constants for Functions Given by Algorithms

Computational Optimization and Applications
Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering

SIAM Journal on Optimization
Extension of Piyavskii‘s Algorithm to Continuous Global Optimization

Journal of Global Optimization
On the complexity of exclusion algorithms for optimization

Journal of Complexity
A new exclusion test

Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)

Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions

Journal of Complexity
Optimal algorithms for global optimization in case of unknown Lipschitz constant

Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Technical Communique: A global optimization technique for checking parametric robustness

Automatica (Journal of IFAC)

Lipschitz condition for finding real roots of a vector function

Journal of Computational Methods in Sciences and Engineering
A modification of the DIRECT method for Lipschitz global optimization for a symmetric function

Journal of Global Optimization

Quantified Score

Hi-index	7.29

Visualization

Abstract

Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider Lipschitz functions of order @a and give a new minimization condition for the exclusion algorithm. Furthermore, convergence and complexity results are presented for such algorithm.