.png){kind=icon}
Return
Log-sigmoid multipliers method in constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1010938423538.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
log-sigmoid
multipliers method
duality
smoothing technique
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
No organization information available
Cited Papers
No cited papers available