.png){kind=icon}
返回
Log-sigmoid multipliers method in constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1010938423538.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we introduced and analyzed the Log-Sigmoid (LS) multipliers method for constrained optimization. The LS method is to the recently developed smoothing technique as augmented Lagrangian to the penalty method or modified barrier to classical barrier methods. At the same time the LS method has some specific properties, which make it substantially different from other nonquadratic augmented Lagrangian techniques. We established convergence of the LS type penalty method under very mild assumptions on the input data and estimated the rate of convergence of the LS multipliers method under the standard second order optimality condition for both exact and nonexact minimization. Some important properties of the dual function and the dual problem, which are based on the LS Lagrangian, were discovered and the primal-dual LS method was introduced.
Keyword:
log-sigmoid
multipliers method
duality
smoothing technique
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
