Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the convergence of multiplicative iterative algorithms with inexact line search

On the convergence of multiplicative iterative algorithms with inexact line search This paper studies the convergence properties of multiplicative iterative algorithms with inexact line search. We prove that the convergence can be guaranteed for a general form of line search rule, under the assumption of convexity of objective function or the assumption of convergence of the sequence generated by the algorithm. This answers an open problem put forward by Iusem. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

On the convergence of multiplicative iterative algorithms with inexact line search

Acta Mathematicae Applicatae Sinica , Volume 13 (4) – Jul 13, 2005

Loading next page...
 
/lp/springer-journals/on-the-convergence-of-multiplicative-iterative-algorithms-with-inexact-HRmpn94xu5
Publisher
Springer Journals
Copyright
Copyright © 1997 by Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02009541
Publisher site
See Article on Publisher Site

Abstract

This paper studies the convergence properties of multiplicative iterative algorithms with inexact line search. We prove that the convergence can be guaranteed for a general form of line search rule, under the assumption of convexity of objective function or the assumption of convergence of the sequence generated by the algorithm. This answers an open problem put forward by Iusem.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 13, 2005

References