Constrained consensus-based optimization
From MaRDI portal
Existence problems for PDEs: global existence, local existence, non-existence (35A01) Uniqueness problems for PDEs: global uniqueness, local uniqueness, non-uniqueness (35A02) Weak solutions to PDEs (35D30) Fokker-Planck equations (35Q84) PDEs in connection with control and optimization (35Q93) PDEs with randomness, stochastic partial differential equations (35R60) PDE constrained optimization (numerical aspects) (49M41) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Abstract: In this work we are interested in the construction of numerical methods for high dimensional constrained nonlinear optimization problems by particle-based gradient-free techniques. A consensus-based optimization (CBO) approach combined with suitable penalization techniques is introduced for this purpose. The method relies on a reformulation of the constrained minimization problem in an unconstrained problem for a penalty function and extends to the constrained settings the class of CBO methods. Exact penalization is employed and, since the optimal penalty parameter is unknown, an iterative strategy is proposed that successively updates the parameter based on the constrained violation. Using a mean-field description of the the many particle limit of the arising CBO dynamics, we are able to show convergence of the proposed method to the minimum for general nonlinear constrained problems. Properties of the new algorithm are analyzed. Several numerical examples, also in high dimensions, illustrate the theoretical findings and the good performance of the new numerical method.
This page was built for publication: Constrained consensus-based optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6383518)
