An Approximate Proximal Point Algorithm for Maximal Monotone Inclusion Problems
Joint Authors
Huang, Lingling
Gao, Weifeng
Liu, San-Yang
Source
Mathematical Problems in Engineering
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-15, 15 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-12-29
Country of Publication
Egypt
No. of Pages
15
Main Subjects
Abstract EN
This paper presents and analyzes a strongly convergent approximate proximal point algorithm for finding zeros of maximal monotone operators in Hilbert spaces.
The proposed method combines the proximal subproblem with a more general correction step which takes advantage of more information on the existing iterations.
As applications, convex programming problems and generalized variational inequalities are considered.
Some preliminary computational results are reported.
American Psychological Association (APA)
Huang, Lingling& Liu, San-Yang& Gao, Weifeng. 2011. An Approximate Proximal Point Algorithm for Maximal Monotone Inclusion Problems. Mathematical Problems in Engineering،Vol. 2011, no. 2011, pp.1-15.
https://search.emarefa.net/detail/BIM-458431
Modern Language Association (MLA)
Huang, Lingling…[et al.]. An Approximate Proximal Point Algorithm for Maximal Monotone Inclusion Problems. Mathematical Problems in Engineering No. 2011 (2011), pp.1-15.
https://search.emarefa.net/detail/BIM-458431
American Medical Association (AMA)
Huang, Lingling& Liu, San-Yang& Gao, Weifeng. An Approximate Proximal Point Algorithm for Maximal Monotone Inclusion Problems. Mathematical Problems in Engineering. 2011. Vol. 2011, no. 2011, pp.1-15.
https://search.emarefa.net/detail/BIM-458431
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-458431
