Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Global convergence of a class of collinear scaling algorithms with inexact line searches on convex functions
Ariyawansa K., Begashaw N. Computing63 (2):145-169,1999.Type:Article
Date Reviewed: Mar 1 2000

In this interesting paper, the authors discuss the important problem of determining the minimum value of a convex function. In the introduction, they give an overview of standard algorithms for this task and describe their salient properties. Next, they present the class of algorithms to be analyzed and prove several theorems, including a global convergence result. No numerical illustrations are given.

This is a technical paper for specialists. The presentation is clear and well organized. The list of references is adequate and contains 20 items.

Reviewer:  S.-Å. Gustafson Review #: CR122714 (0003-0198)
Bookmark and Share
 
Global Optimization (G.1.6 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Global Optimization": Date
Advances in genetic programming
Angeline P. (ed), Kenneth E. J., MIT Press, Cambridge, MA, 1996. Type: Book (9780262011587)
Jul 1 1998
Global optimal image reconstruction from blurred noisy data by a Bayesian approach
Bruni C., Bruni R., De Santis A., Iacoviello D., Koch G. Journal of Optimization Theory and Applications 115(1): 67-96, 2002. Type: Article
Feb 25 2003
A greedy EM algorithm for Gaussian mixture learning
Vlassis N., Likas A. Neural Processing Letters 15(1): 77-87, 2002. Type: Article
Jun 17 2003
more...

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