scientific article; zbMATH DE number 804618
From MaRDI portal
Publication:4851623
zbMath0829.65083MaRDI QIDQ4851623
Mark E. Tuttle, Tibor Csendes, Zelda B. Zabinsky, Birna P. Kristinsdottir
Publication date: 11 October 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global optimizationnumerical resultsconstrained nonlinear optimizationtolerance intervalsinterval subdivision method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items
On the selection of subdivision directions in interval branch-and-bound methods for global optimization, Constructing large feasible suboptimal intervals for constrained nonlinear optimization, Numerical solution for bounding feasible point sets, Finding robust solutions for product design problems, On proving existence of feasible points in equality constrained optimization problems