A New Constraint Qualification for Continuous-Time Nonlinear Programming Based on Asymptotic KKT Conditions
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916061174038528 |
|---|---|
| author | Moreira, Rodrigo B. Monte, Moisés R. C. do de Oliveira, Valeriano A. |
| author_facet | Moreira, Rodrigo B. Monte, Moisés R. C. do de Oliveira, Valeriano A. |
| contents | The asymptotic Karush-Kuhn-Tucker (AKKT) optimality conditions are distinguished from other approaches in the literature by virtue of their capacity to be effectively derived through numerical methods, such as the utilization of an appropriate version of the augmented Lagrange method. These tools are of a theoretical nature, yet they possess practical utility in the identification of candidate solutions to continuous-time programming problems. While this type of optimality condition is valid without imposing any constraint qualification, it is not sufficiently robust to generate good candidate solutions. In some cases, solutions satisfying AKKT conditions are not even stationary. In this study, we investigate conditions that effectively refine this set of candidate solutions with the same precision as the classical Karush-Kuhn-Tucker (KKT) conditions. This is achieved by introducing a novel constraint qualification, designated AKKT-regularity. It has been demonstrated that, under AKKT-regularity, each local optimal solution is shown to satisfy the KKT conditions. In addition, it is demonstrated that this constraint qualification is the weakest possible to ensure such a property. Furthermore, sufficient conditions are provided for its applicability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_29898 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A New Constraint Qualification for Continuous-Time Nonlinear Programming Based on Asymptotic KKT Conditions Moreira, Rodrigo B. Monte, Moisés R. C. do de Oliveira, Valeriano A. Optimization and Control The asymptotic Karush-Kuhn-Tucker (AKKT) optimality conditions are distinguished from other approaches in the literature by virtue of their capacity to be effectively derived through numerical methods, such as the utilization of an appropriate version of the augmented Lagrange method. These tools are of a theoretical nature, yet they possess practical utility in the identification of candidate solutions to continuous-time programming problems. While this type of optimality condition is valid without imposing any constraint qualification, it is not sufficiently robust to generate good candidate solutions. In some cases, solutions satisfying AKKT conditions are not even stationary. In this study, we investigate conditions that effectively refine this set of candidate solutions with the same precision as the classical Karush-Kuhn-Tucker (KKT) conditions. This is achieved by introducing a novel constraint qualification, designated AKKT-regularity. It has been demonstrated that, under AKKT-regularity, each local optimal solution is shown to satisfy the KKT conditions. In addition, it is demonstrated that this constraint qualification is the weakest possible to ensure such a property. Furthermore, sufficient conditions are provided for its applicability. |
| title | A New Constraint Qualification for Continuous-Time Nonlinear Programming Based on Asymptotic KKT Conditions |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2605.29898 |