A Regularized Hybrid Steepest Descent Method for Variational Inclusions - Université des Antilles Access content directly
Journal Articles Numerical Functional Analysis and Optimization Year : 2012

A Regularized Hybrid Steepest Descent Method for Variational Inclusions

Abstract

This article is concerned with a generalization of the hybrid steepest descent method from variational inequalities to the multivalued case. This will be reached by replacing the multivalued operator by its Yosida approximate, which is always Lipschitz continuous. It is worth mentioning that the hybrid steepest descent method is an algorithmic solution to variational inequality problems over the fixed point set of certain nonexpansive mappings and has remarkable applicability to the constrained nonlinear inverse problems like image recovery and MIMO communication systems
No file

Dates and versions

hal-00776641 , version 1 (15-01-2013)

Identifiers

Cite

Abdellatif Moudafi. A Regularized Hybrid Steepest Descent Method for Variational Inclusions. Numerical Functional Analysis and Optimization, 2012, 33 (1), pp.39-47. ⟨10.1080/01630563.2011.619676⟩. ⟨hal-00776641⟩

Collections

UNIV-AG TDS-MACS
88 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More