Steepest descent methods with generalized distances for constrained optimization

DOI10.1023/A:1005721827841MaRDI QIDQ1355865zbMATH OpenFDO

Authors Alfredo 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)

Recommendations

• Generalization of distance algorithm for constrainded optimization
• A hybrid steepest descent method for constrained convex optimization
• Publication:4367505
• Newton-type Methods with Generalized Distances For Constrained Optimization
• A generalized hybrid steepest descent method and applications
• Publication:4074312
• Publication:3692737
• Publication:3725886
• Steepest descent methods for critical points in vector optimization problems
• The rate of convergence of the method of steepest descent in the constrained minimization problem

Cited in

(6)

• Generalization of distance algorithm for constrainded optimization
• A dynamical approach to convex minimization coupling approximation with the steepest descent method
• Constrained steepest descent in the 2-Wasserstein metric
• scientific article; zbMATH DE number 1374516 (Why is no real title available?)
• An entropic Landweber method for linear ill-posed problems
• A Strongly Convergent Direct Method for Monotone Variational Inequalities in Hilbert Spaces

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

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