Convergence Analysis on an Accelerated Proximal Point Algorithm for Linearly Constrained Optimization Problems

Lu Sha; Wei Zengxin

首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Convergence Analysis on an Accelerated Proximal Point Algorithm for Linearly Constrained Optimization Problems

【24h】

Convergence Analysis on an Accelerated Proximal Point Algorithm for Linearly Constrained Optimization Problems

机译：Convergence Analysis on an Accelerated Proximal Point Algorithm for Linearly Constrained Optimization Problems

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相关主题

摘要

Proximal point algorithm is a type of method widely used in solving optimization problems and some practical problems such as machine learning in recent years. In this paper, a framework of accelerated proximal point algorithm is presented for convex minimization with linear constraints. The algorithm can be seen as an extension to Gu center dot ler's methods for unconstrained optimization and linear programming problems. We prove that the sequence generated by the algorithm converges to a KKT solution of the original problem under appropriate conditions with the convergence rate of O(1/k(2)).

著录项

来源
《Mathematical Problems in Engineering: Theory, Methods and Applications》 |2020年第40期|8873507.1-8873507.13|共13页
作者
Lu Sha; Wei Zengxin;
展开▼
作者单位

East China Univ Sci & Technol, Sch Sci, Shanghai 200237, Peoples R China|Nanning Normal Univ, Sch Math & Stat, Nanning 530001, Peoples R China;

Guangxi Univ, Sch Math & Informat Sci, Nanning 530004, Peoples R China;

展开▼
收录信息
原文格式 PDF
正文语种英语
中图分类
关键词

Convergence Analysis on an Accelerated Proximal Point Algorithm for Linearly Constrained Optimization Problems

摘要

著录项

相关主题

期刊订阅