.png){kind=icon}
Return
Enhancing Sharp Augmented Lagrangian Methods with Smoothing Techniques for Nonlinear Programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s10957-025-02847-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a novel approach to solving nonlinear programming problems using a sharp augmented Lagrangian method with a smoothing technique. Traditional sharp augmented Lagrangian methods are known for their effectiveness but are often hindered by the need for global minimization of nonconvex, nondifferentiable functions at each iteration. To address this challenge, we introduce a smoothing function that approximates the sharp augmented Lagrangian, enabling the use of primal minimization strategies similar to those in Powell-Hestenes-Rockafellar (PHR) methods. Our approach retains the theoretical rigor of classical duality schemes while allowing for the use of stationary points in the primal optimization process. We present two algorithms based on this method-one utilizing standard descent and the other employing coordinate descent. Numerical experiments demonstrate that our smoothing-based method compares favorably with the PHR augmented Lagrangian approach, offering both robustness and practical efficiency. The proposed method is particularly advantageous in scenarios where exact minimization is computationally infeasible, providing a balance between theoretical precision and computational tractability.
Keywords:
Augmented sharp lagrangian
Continuous optimization
Nonlinear programming
Journal
J
IF:
1.5
Papers:
184
Citations:
8.2K
Organization
Cited Papers
Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization.png)
Optimization
OptimizationIF0
PREAI
ShareSaveAugmented Lagrangians quadratic growth and second-order sufficient optimality conditionsOptimization
OptimizationIF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more