A penalty scheme to solve constrained non-convex optimization problems in BV(Ω)

2021/10/05 by Natemeyer, Carolin, Wachsmuth, Daniel
#FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.2110.01849

Abstract

We investigate non-convex optimization problems in BV(Ω) with two-sided pointwise inequality constraints. We propose a regularization and penalization method to numerically solve the problem. Under certain conditions, weak limit points of iterates are stationary for the original problem. In addition, we prove optimality conditions for the original problem that contain Lagrange multipliers to the inequality constraints. Numerical experiments confirm the theoretical findings.

Related

• Nonsmooth method for constrained optimization
• Penalty methods for a class of non-Lipschitz optimization problems
• Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization
• Penalty methods to compute stationary solutions in constrained optimization problems
• The Exact Projective Penalty Method for Constrained Optimization