Box-Splitting strategies for the interval Gauss-Seidel step in a global optimization method | Zendy

D. Ratz | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Box-Splitting strategies for the interval Gauss-Seidel step in a global optimization method

Author(s) -

D. Ratz

Publication year - 1994

Publication title -

computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.409

H-Index - 60

eISSN - 1436-5057

pISSN - 0010-485X

DOI - 10.1007/bf02307384

Subject(s) - gauss–seidel method , interval (graph theory) , gauss , mathematics , algorithm , global optimization , interval arithmetic , simulated annealing , pascal (unit) , mathematical optimization , computer science , iterative method , combinatorics , mathematical analysis , bounded function , physics , quantum mechanics , programming language

ZusammenfassungBox-Splitting Strategies for the Interval Gauss-Seidel Step in a Global OptimizationMethod. We consider an algorithm for computing verified enclosures for all global minimizers xand forthe global minimum value f= f(x) of a twice continuously differentiable function f : IRn! IR withina box [x] 2 IIRn. Our algorithm incorporates the interval Gauss-Seidel step applied to the problem offinding the zeros of the gradient of f . Here, we have to deal with the...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research