首页> 外文会议>International Conference on Numerical Optimization and Numerical Linear Algebra; 20031007-10; Guilin(CN) >Study on Approximate Proximal Point Algorithms for Monotone Variational Inequalities
【24h】

Study on Approximate Proximal Point Algorithms for Monotone Variational Inequalities

机译:单调变分不等式的近似近点算法研究

获取原文
获取原文并翻译 | 示例

摘要

Proximal point algorithms (PPA) are attractive methods for solving monotone variational inequality problems. Since solving the sub-problem in each iteration exactly is costly or sometimes impossible, various approximate versions of PPA (APPA) are developed for practical applications. In this paper, different versions of APPA in the literature are studied in parallel classes which share some common properties. The global convergence results for all discussed algorithms are proved under a uniform framework. The study clarifies the relationships and the related inexactness restrictions of various APPAs, hence provides a helpful guidance in choosing suitable APPAs in different application purposes. Finally, we report some numerical experiments of APPAs in applications.
机译:最近点算法(PPA)是解决单调变分不等式问题的有吸引力的方法。由于精确地解决每次迭代中的子问题是昂贵的,有时甚至是不可能的,因此针对实际应用开发了各种近似版本的PPA(APPA)。在本文中,在并行的类中研究了不同版本的APPA,它们具有一些共同的特性。在一个统一的框架下证明了所有讨论算法的全局收敛结果。该研究阐明了各种APPA之间的关系和相关的不精确性限制,从而为在不同应用目的下选择合适的APPA提供了有用的指导。最后,我们报告了应用中APPA的一些数值实验。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号