LCQPow -- A Solver for Linear Complementarity Quadratic Programs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913691542224896 |
|---|---|
| author | Hall, Jonas Nurkanovic, Armin Messerer, Florian Diehl, Moritz |
| author_facet | Hall, Jonas Nurkanovic, Armin Messerer, Florian Diehl, Moritz |
| contents | In this paper we introduce an open-source software package written in C++ for efficiently finding solutions to quadratic programming problems with linear complementarity constraints. These problems arise in a wide range of applications in engineering and economics, and they are challenging to solve due to their structural violation of standard constraint qualifications, and highly nonconvex, nonsmooth feasible sets. This work extends a previously presented algorithm based on a sequential convex programming approach applied to a standard penalty reformulation. We examine the behavior of local convergence and introduce new algorithmic features. Competitive performance profiles are presented in comparison to state-of-the-art solvers and solution variants in both existing and new benchmarks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_16341 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | LCQPow -- A Solver for Linear Complementarity Quadratic Programs Hall, Jonas Nurkanovic, Armin Messerer, Florian Diehl, Moritz Optimization and Control In this paper we introduce an open-source software package written in C++ for efficiently finding solutions to quadratic programming problems with linear complementarity constraints. These problems arise in a wide range of applications in engineering and economics, and they are challenging to solve due to their structural violation of standard constraint qualifications, and highly nonconvex, nonsmooth feasible sets. This work extends a previously presented algorithm based on a sequential convex programming approach applied to a standard penalty reformulation. We examine the behavior of local convergence and introduce new algorithmic features. Competitive performance profiles are presented in comparison to state-of-the-art solvers and solution variants in both existing and new benchmarks. |
| title | LCQPow -- A Solver for Linear Complementarity Quadratic Programs |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2211.16341 |