An interior point multiplicative method for optimization under positivity constraints

DOI10.1007/BF00992845zbMath0831.90094OpenAlexW2083893928MaRDI QIDQ1897269

Alfredo Noel Iusem

Publication date: 25 February 1996

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

unconstrained optimizationmaximum likelihood estimationsteepest descentinterior point methods

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (2)

On the convergence of multiplicative iterative algorithms with inexact line search ⋮ A class of primal affine scaling algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicative iterative algorithms for convex programming
• A new polynomial-time algorithm for linear programming
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• On the convergence of iterative methods for symmetric linear complementarity problems
• An algorithm for maximizing expected log investment return
• Convergence analysis for a multiplicatively relaxed EM algorithm
• A regularized dual-based iterative method for a class of image reconstruction problems
• A Statistical Model for Positron Emission Tomography

This page was built for publication: An interior point multiplicative method for optimization under positivity constraints