A dynamical approach to convex minimization coupling approximation with the steepest descent method
type: Item
instance of: scholarly article
title: A dynamical approach to convex minimization coupling approximation with the steepest descent method
zbMATH Open document ID: 0886.49024
published in: Journal of Differential Equations
publication date: 1996-07-28T00:00:00Z
Mathematics Subject Classification ID: 49L20
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 90C99
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 910001
zbMATH Keywords: evolution equations
zbMATH Keywords: optimal trajectory
zbMATH Keywords: parametrization
zbMATH Keywords: penalty and viscosity-approximation methods
zbMATH Keywords: convex minimization
author: Hédy Attouch
author: Roberto Cominetti
MaRDI profile type: Publication
full work available at URL: jdeq.1996.0104
OpenAlex ID: W1967598881
DOI: 10.1006/JDEQ.1996.0104
Recommended article: A convergent dynamic method for large minimization problems
Recommended article: A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
Recommended article: A Revision of Relaxed Steepest Descent Method from the Dynamics on an Invariant Manifold
Recommended article: A hybrid steepest descent method for constrained convex optimization
Recommended article: Convergence of the steepest descent method for minimizing quasiconvex functions
Recommended article: Q4074312
Recommended article: A Hybrid Steepest-Descent Algorithm for Convex Minimization Over the Fixed Point Set of Multivalued Mappings
Recommended article: A dynamical systems approach to constrained minimization
Recommended article: Steepest descent methods with generalized distances for constrained optimization
Recommended article: Q5435794
description: scientific article; zbMATH DE number 910001