Steepest descent methods with generalized distances for constrained optimization

DOI10.1023/A:1005721827841zbMath0873.90089MaRDI QIDQ1355865

Alfredo Noel Iusem

Publication date: 28 May 1997

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

zbMATH Keywords

interior point methodssteepest descent methodgeneralized proximal point methods

Mathematics Subject Classification ID

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

Related Items (2)

A Strongly Convergent Direct Method for Monotone Variational Inequalities in Hilbert Spaces ⋮ An entropic Landweber method for linear ill-posed problems

This page was built for publication: Steepest descent methods with generalized distances for constrained optimization