A Note on the McCormick Second-Order Constraint Qualification
DOI:
https://doi.org/10.5540/tcam.2022.023.04.00769Keywords:
Nonlinear programming, second-order optimality conditions, constraint qualification.Abstract
The study of optimality conditions and constraint qualification is a key topic in nonlinear optimization. In this work, we present a reformulation of the well-known second-order constraint qualification described by McCormick in [17]. This reformulation is based on the use of feasible arcs, but is independent of Lagrange multipliers. Using such a reformulation, we can show that a local minimizer verifies the strong second-order necessary optimality condition. We can also prove that the reformulation is weaker than the known relaxed constant rank constraint qualification in [19]. Furthermore, we demonstrate that the condition is neither related to the MFCQ+WCR in [8] nor to the CCP2 condition, the companion constraint qualification associated with the second-order sequential optimality condition AKKT2 in [5].
Downloads
Published
How to Cite
Issue
Section
License
Copyright
Authors of articles published in the journal Trends in Computational and Applied Mathematics retain the copyright of their work. The journal uses Creative Commons Attribution (CC-BY) in published articles. The authors grant the TCAM journal the right to first publish the article.
Intellectual Property and Terms of Use
The content of the articles is the exclusive responsibility of the authors. The journal uses Creative Commons Attribution (CC-BY) in published articles. This license allows published articles to be reused without permission for any purpose as long as the original work is correctly cited.
The journal encourages Authors to self-archive their accepted manuscripts, publishing them on personal blogs, institutional repositories, and social media, as long as the full citation is included in the journal's website version.
