Volume 2, Issue 3
Optimization with Least Constraint Violation

Yu-Hong Dai & Liwei Zhang

CSIAM Trans. Appl. Math., 2 (2021), pp. 551-584.

Published online: 2021-08

Preview Full PDF 142 3823
Export citation
  • Abstract

Study about theory and algorithms for nonlinear programming usually assumes that the feasible region of the problem is nonempty. However, there are many important practical nonlinear programming problems whose feasible regions are not known to be nonempty or not, and optimizers of the objective function with the least constraint violation prefer to be found. A natural way for dealing with these problems is to extend the nonlinear programming problem as the one optimizing the objective function over the set of points with the least constraint violation. Firstly, the minimization problem with least constraint violation is proved to be a Lipschitz equality constrained optimization problem when the original problem is a convex nonlinear programming problem with possible inconsistent constraints, and it can be reformulated as an MPCC problem; And the minimization problem with least constraint violation is relaxed to an MPCC problem when the original problem is a nonlinear programming problem with possible inconsistent non-convex constraints. Secondly, for nonlinear programming problems with possible inconsistent constraints, it is proved that a local minimizer of the MPCC problem is an M-stationary point and an elegant necessary optimality condition, named as L-stationary condition, is established from the classical optimality theory of Lipschitz continuous optimization. Thirdly, properties of the penalty method for the minimization problem with the least constraint violation are developed and the proximal gradient method for the penalized problem is studied. Finally, the smoothing Fischer-Burmeister function method is constructed for solving the MPCC problem related to minimizing the objective function with the least constraint violation. It is demonstrated that, when the positive smoothing parameter approaches to zero, any point in the outer limit of the KKT-point mapping is an L-stationary point of the equivalent MPCC problem.

  • Keywords

Nonlinear programming, least constraint violation, L-stationary point, MPCC, smoothing function.

  • AMS Subject Headings

90C30

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{CSIAM-AM-2-551, author = {Dai , Yu-Hong and Zhang , Liwei}, title = {Optimization with Least Constraint Violation}, journal = {CSIAM Transactions on Applied Mathematics}, year = {2021}, volume = {2}, number = {3}, pages = {551--584}, abstract = {

Study about theory and algorithms for nonlinear programming usually assumes that the feasible region of the problem is nonempty. However, there are many important practical nonlinear programming problems whose feasible regions are not known to be nonempty or not, and optimizers of the objective function with the least constraint violation prefer to be found. A natural way for dealing with these problems is to extend the nonlinear programming problem as the one optimizing the objective function over the set of points with the least constraint violation. Firstly, the minimization problem with least constraint violation is proved to be a Lipschitz equality constrained optimization problem when the original problem is a convex nonlinear programming problem with possible inconsistent constraints, and it can be reformulated as an MPCC problem; And the minimization problem with least constraint violation is relaxed to an MPCC problem when the original problem is a nonlinear programming problem with possible inconsistent non-convex constraints. Secondly, for nonlinear programming problems with possible inconsistent constraints, it is proved that a local minimizer of the MPCC problem is an M-stationary point and an elegant necessary optimality condition, named as L-stationary condition, is established from the classical optimality theory of Lipschitz continuous optimization. Thirdly, properties of the penalty method for the minimization problem with the least constraint violation are developed and the proximal gradient method for the penalized problem is studied. Finally, the smoothing Fischer-Burmeister function method is constructed for solving the MPCC problem related to minimizing the objective function with the least constraint violation. It is demonstrated that, when the positive smoothing parameter approaches to zero, any point in the outer limit of the KKT-point mapping is an L-stationary point of the equivalent MPCC problem.

}, issn = {2708-0579}, doi = {https://doi.org/10.4208/csiam-am.2020-0043}, url = {http://global-sci.org/intro/article_detail/csiam-am/19450.html} }
TY - JOUR T1 - Optimization with Least Constraint Violation AU - Dai , Yu-Hong AU - Zhang , Liwei JO - CSIAM Transactions on Applied Mathematics VL - 3 SP - 551 EP - 584 PY - 2021 DA - 2021/08 SN - 2 DO - http://doi.org/10.4208/csiam-am.2020-0043 UR - https://global-sci.org/intro/article_detail/csiam-am/19450.html KW - Nonlinear programming, least constraint violation, L-stationary point, MPCC, smoothing function. AB -

Study about theory and algorithms for nonlinear programming usually assumes that the feasible region of the problem is nonempty. However, there are many important practical nonlinear programming problems whose feasible regions are not known to be nonempty or not, and optimizers of the objective function with the least constraint violation prefer to be found. A natural way for dealing with these problems is to extend the nonlinear programming problem as the one optimizing the objective function over the set of points with the least constraint violation. Firstly, the minimization problem with least constraint violation is proved to be a Lipschitz equality constrained optimization problem when the original problem is a convex nonlinear programming problem with possible inconsistent constraints, and it can be reformulated as an MPCC problem; And the minimization problem with least constraint violation is relaxed to an MPCC problem when the original problem is a nonlinear programming problem with possible inconsistent non-convex constraints. Secondly, for nonlinear programming problems with possible inconsistent constraints, it is proved that a local minimizer of the MPCC problem is an M-stationary point and an elegant necessary optimality condition, named as L-stationary condition, is established from the classical optimality theory of Lipschitz continuous optimization. Thirdly, properties of the penalty method for the minimization problem with the least constraint violation are developed and the proximal gradient method for the penalized problem is studied. Finally, the smoothing Fischer-Burmeister function method is constructed for solving the MPCC problem related to minimizing the objective function with the least constraint violation. It is demonstrated that, when the positive smoothing parameter approaches to zero, any point in the outer limit of the KKT-point mapping is an L-stationary point of the equivalent MPCC problem.

Yu-Hong Dai & LiweiZhang. (2021). Optimization with Least Constraint Violation. CSIAM Transactions on Applied Mathematics. 2 (3). 551-584. doi:10.4208/csiam-am.2020-0043
Copy to clipboard
The citation has been copied to your clipboard