A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints
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 tha...
Main Author: | Xiaoling Fu |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2013/492305 |
Similar Items
-
An Asymmetric Proximal Decomposition Method for Convex Programming with Linearly Coupling Constraints
by: Xiaoling Fu, et al.
Published: (2012-01-01) -
Global Optimization for Generalized Linear Multiplicative Programming Using Convex Relaxation
by: Yingfeng Zhao, et al.
Published: (2018-01-01) -
The Generalized Trust-Region Sub-Problem with Additional Linear Inequality Constraints—Two Convex Quadratic Relaxations and Strong Duality
by: Temadher A. Almaadeed, et al.
Published: (2020-08-01) -
Remediation of Anomia in lvPPA and svPPA
by: Aaron Meyer, et al.
Published: (2015-04-01) -
On nonsmooth mathematical programs with equilibrium constraints using generalized convexity
by: Joshi Bhuwan Chandra, et al.
Published: (2019-01-01)