Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917392738680832 |
|---|---|
| author | De Marchi, Alberto |
| author_facet | De Marchi, Alberto |
| contents | Necessary optimality conditions in Lagrangian form and the sequential minimization framework are extended to mixed-integer nonlinear optimization, without any convexity assumptions. Building upon a recently developed notion of local optimality for problems with polyhedral and integrality constraints, a characterization of local minimizers and critical points is given for problems including also nonlinear constraints. This approach lays the foundations for developing affordable sequential minimization algorithms with convergence guarantees to critical points from arbitrary initializations. A primal-dual perspective, a local saddle point property, and the dual relationships with the proximal point algorithm are also advanced in the presence of integer variables. Preliminary numerical results are presented for an augmented Lagrangian and an interior point method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_12436 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis De Marchi, Alberto Optimization and Control 65K05, 90C06, 90C11, 90C30 Necessary optimality conditions in Lagrangian form and the sequential minimization framework are extended to mixed-integer nonlinear optimization, without any convexity assumptions. Building upon a recently developed notion of local optimality for problems with polyhedral and integrality constraints, a characterization of local minimizers and critical points is given for problems including also nonlinear constraints. This approach lays the foundations for developing affordable sequential minimization algorithms with convergence guarantees to critical points from arbitrary initializations. A primal-dual perspective, a local saddle point property, and the dual relationships with the proximal point algorithm are also advanced in the presence of integer variables. Preliminary numerical results are presented for an augmented Lagrangian and an interior point method. |
| title | Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis |
| topic | Optimization and Control 65K05, 90C06, 90C11, 90C30 |
| url | https://arxiv.org/abs/2406.12436 |