Modified Duality Method for Obstacle Problem.

Elina Vikhtenko

Discrete Optimization and Operations Research (DOOR)（2016）

被引用23|浏览52

摘要

In this paper we proposed a modified Lagrangian functional for obstacle problem, investigated its properties. Then we construct Uzawa method for finding a saddle point, proved the convergence theorems. Some numerical examples are provided.

更多

查看译文

关键词

Geometric Optimization,Probabilistic Roadmaps,Penalty Method,Path Planning,Approximation Algorithms

上传PDF

引用

AI Read Science

溯源树

样例

生成溯源树，研究论文发展脉络

AI Read Science

数据免责声明

页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果，我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问，可以通过电子邮件方式联系我们：report@aminer.cn

Chat Paper

正在生成论文摘要

AI Read Science

溯源树

样例

生成溯源树，研究论文发展脉络