Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

Author： Dang Yazheng   Gao Yan  

Publisher： Taylor & Francis Ltd

ISSN： 0233-1934

Source： Optimization, Vol.63, Iss.4, 2014-04, pp. : 571-584

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A proximal subgradient projection algorithm for linearly constrained strictly convex problems

By Ouorou Adam  

Optimization Methods and Software, Vol. 22, Iss. 4, 2007-08 ,pp. : 617-636

Taylor & Francis Ltd

Access to resources Recommend Favorite

Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization

By Sundhar Ram S.   Nedić A.   Veeravalli V.  

Journal of Optimization Theory and Applications, Vol. 147, Iss. 3, 2010-12 ,pp. : 516-545

Springer Publishing Company

Access to resources Recommend Favorite

A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem

By Liu Binghua   Qu Biao   Zheng Na  

Numerical Functional Analysis and Optimization, Vol. 35, Iss. 11, 2014-11 ,pp. : 1459-1466

Taylor & Francis Ltd

Access to resources Recommend Favorite

Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem

By Yang Yuning   Yang Qingzhi  

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 509-525

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exact Algorithm for the Surrogate Dual of an Integer Programming Problem: Subgradient Method Approach

By   Kim S.  

Journal of Optimization Theory and Applications, Vol. 96, Iss. 2, 1998-02 ,pp. : 363-375

Springer Publishing Company

Access to resources Recommend Favorite