Multiplicative Interior Gradient Methods for Minimization over the Nonnegative Orthant

DOI10.1137/S0363012994262944zbMATH Open0841.49012OpenAlexW2059251353MaRDI QIDQ4874956FDOQ4874956

Authors: Marc Teboulle, Alfredo Iusem, B. F. Svaiter 

Publication date: 16 July 1996

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0363012994262944

Recommendations

• scientific article; zbMATH DE number 4053362
• An interior point multiplicative method for optimization under positivity constraints
• scientific article; zbMATH DE number 3879605
• scientific article; zbMATH DE number 799617
• Interior Gradient and Proximal Methods for Convex and Conic Optimization

zbMATH Keywords

gradient methodsproximal methodsmultiplicative iterative algorithmsunconstrained minimization problems\(\varphi\)-divergences

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cited In (6)

• New class of multiplicative algorithms for solving of entropy-linear programs
• Title not available (Why is that?)
• Multiplicative Updates for Nonnegative Quadratic Programming
• A new duality theory for mathematical programming
• An interior point multiplicative method for optimization under positivity constraints
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming

This page was built for publication: Multiplicative Interior Gradient Methods for Minimization over the Nonnegative Orthant

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