![](/images/graphics-bg.png)
A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints
Author
Source
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-13, 13 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-09-19
Country of Publication
Egypt
No. of Pages
13
Main Subjects
Abstract EN
We present an efficient method for solving linearly constrained convex programming.
Our algorithmic framework employs an implementable proximal step by a slight relaxation to the subproblem of proximal point algorithm (PPA).
In particular, the stepsize choice condition of our algorithm is weaker than some elegant PPA-type methods.
This condition is flexible and effective.
Self-adaptive strategies are proposed to improve the convergence in practice.
We theoretically show under mild conditions that our method converges in a global sense.
Finally, we discuss applications and perform numerical experiments which confirm the efficiency of the proposed method.
Comparisons of our method with some state-of-the-art algorithms are also provided.
American Psychological Association (APA)
Fu, Xiaoling. 2013. A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints. Abstract and Applied Analysis،Vol. 2013, no. 2013, pp.1-13.
https://search.emarefa.net/detail/BIM-475940
Modern Language Association (MLA)
Fu, Xiaoling. A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints. Abstract and Applied Analysis No. 2013 (2013), pp.1-13.
https://search.emarefa.net/detail/BIM-475940
American Medical Association (AMA)
Fu, Xiaoling. A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints. Abstract and Applied Analysis. 2013. Vol. 2013, no. 2013, pp.1-13.
https://search.emarefa.net/detail/BIM-475940
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-475940