Steepest descent methods with generalized distances for constrained optimization

DOI10.1023/A:1005721827841zbMATH Open0873.90089MaRDI QIDQ1355865FDOQ1355865

Authors: Alfredo Iusem 

Publication date: 28 May 1997

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

Recommendations

• Generalization of distance algorithm for constrainded optimization
• A hybrid steepest descent method for constrained convex optimization
• scientific article; zbMATH DE number 1092213
• Newton-type Methods with Generalized Distances For Constrained Optimization
• A generalized hybrid steepest descent method and applications
• scientific article; zbMATH DE number 3492092
• scientific article; zbMATH DE number 3917588
• scientific article; zbMATH DE number 3956829
• 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

zbMATH Keywords

interior point methodssteepest descent methodgeneralized proximal point methods

Mathematics Subject Classification ID

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

Cited In (6)

• A Strongly Convergent Direct Method for Monotone Variational Inequalities in Hilbert Spaces
• An entropic Landweber method for linear ill-posed problems
• Generalization of distance algorithm for constrainded optimization
• Constrained steepest descent in the 2-Wasserstein metric
• A dynamical approach to convex minimization coupling approximation with the steepest descent method
• Title not available (Why is that?)

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)