On the convergence of multiplicative iterative algorithms with inexact line search

DOI10.1007/BF02009541MaRDI QIDQ1375334zbMATH OpenOpenAlexFDO

Authors Xiaoguang Yang

Publication date 14 January 1998

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02009541

zbMATH Keywords

convergenceinexact line searchmultiplicative iterative algorithmsnon-negativity constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Review text

This paper considers an inexact line search for a class of methods, multiplicative iterative algorithms, applicable to problems with non-negativity constraints. Convergence is proven.

Cites work

• A Statistical Model for Positron Emission Tomography
• An interior point multiplicative method for optimization under positivity constraints
• Multiplicative iterative algorithms for convex programming

Cited in

(3)

• Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
• scientific article; zbMATH DE number 3898619 (Why is no real title available?)
• An inexact linear search and its convergence

This page was built for publication: On the convergence of multiplicative iterative algorithms with inexact line search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375334)