In this note, we are interested in solving the minimization problem with equality constraints, with non-convexity assumptions. To solve this problem, we consider the primal-dual algorithm that was studied by Armand and Omheni. But in our approach, we consider the Pseudo-Huber function for the case of equality constraints, and not the quadratic penalty function.
Keywords: Non-convex optimization, Augmented Lagrangian methods, Equality-constrained minimization
.png)
.png)
