Answers are grounded in this paper and cite their sources.
An important method to solve constrained optimization problem is to approach the optimal solution of constrained optimization problem gradually by sequential unconstrained optimization method, namely penalty function method. And the filling function method is one of the effective methods to solve the global optimal problem. In this paper, a class of augmented Lagrangian objective filled penalty functions are defined to solve non-convex constraint optimization problems, the authors call it filled penalty function method. The theoretical properties of these functions, such as exactness, smoothness, global convergence, are discussed. On this basis, a local optimization algorithm and an approximate global optimization algorithm with corresponding examples are given for solving constrained optimization problems.
No takes yet. Share an insight, caveat, or question.
Tang et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: