-

 

 

 




Optimization Online





 

A new customized proximal point algorithm for linearly constrained convex optimization

Jiang Binqian (283736184***at***qq.com)
Peng Zheng (pzheng***at***fzu.edu.cn)
Zhu Wenxing (wxzhu***at***fzu.edu.cn)

Abstract: In this paper, we propose a new customized proximal point algorithm for linearly constrained convex optimization problem, and further use it to solve the separable convex optimization problem with linear constraints. Which is different to the existing customized proximal point algorithms, the proposed algorithm does not involve any relaxation step but still ensure the convergence. We obtain the particular iteration schemes and the unified variational inequality where the parameter matrix is symmetric and positive semi-definite, then the global convergence and a worst-case convergence rate of the proposed method are proven under some mild assumptions. Finally some numerical experiments show that, the proposed method is valid and high efficient comparing with some existing state-of-the-art methods.

Keywords: Convex optimization; separable convex optimization; customized proximal point algorithm; global convergence; $O(1/k)$ convergence rate

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Citation:

Download: [PDF]

Entry Submitted: 04/30/2016
Entry Accepted: 04/30/2016
Entry Last Modified: 04/17/2017

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society