Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On stopping criteria in verified nonlinear systems or optimization algorithms
Kearfott R., Walster G. ACM Transactions on Mathematical Software26 (3):373-389,2000.Type:Article
Date Reviewed: Dec 1 2000

The basic tool in the verified solution of constrained or unconstrained optimization or root-finding problems is the interval Newton method. Analogues of conventional termination criteria can be problematic, potentially leading to inadequate answers or major inefficiencies. The authors illustrate some of the pitfalls and propose a new “thickness stopping criterion.” They sketch the logic of a parameterized family of criteria, which can be adapted to varying user needs in particular problem contexts, and discuss a nontrivial example. Evaluation must await extensive experimentation.

Overall, the paper is well written, but appreciation of some details requires familiarity with existing codes and prior literature cited therein.

Reviewer:  Donald G. M. Anderson Review #: CR124083
Bookmark and Share
 
Unconstrained Optimization (G.1.6 ... )
 
 
Constrained Optimization (G.1.6 ... )
 
 
Global Optimization (G.1.6 ... )
 
 
Interval Arithmetic (G.1.0 ... )
 
 
Systems Of Equations (G.1.5 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Unconstrained Optimization": Date
A modular system of algorithms for unconstrained minimization
Schnabel R. (ed), Koonatz J., Weiss B. ACM Transactions on Mathematical Software 11(4): 419-440, 1985. Type: Article
Feb 1 1987
Algorithm 765: STENMIN--a software package for large, sparse unconstrained optimization using tensor methods
Bouaricha A. ACM Transactions on Mathematical Software 23(1): 81-90, 1997. Type: Article
Nov 1 1997
Algorithm 897: VTDIRECT95: serial and parallel codes for the global optimization algorithm direct
He J., Watson L., Sosonkina M. ACM Transactions on Mathematical Software 36(3): 1-24, 2009. Type: Article
Sep 17 2009

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy