Reformulations of Quadratic Programs for Lipschitz Continuity
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915463147028480 |
|---|---|
| author | Agrawal, Devansh R. Lee, Haejoon Panagou, Dimitra |
| author_facet | Agrawal, Devansh R. Lee, Haejoon Panagou, Dimitra |
| contents | Optimization-based controllers often lack regularity guarantees, such as Lipschitz continuity, when multiple constraints are present. When used to control a dynamical system, these conditions are essential to ensure the existence and uniqueness of the system's trajectory. Here we propose a general method to convert a Quadratic Program (QP) into a Second-Order Cone Problem (SOCP), which is shown to be Lipschitz continuous. Key features of our approach are that (i) the regularity of the resulting formulation does not depend on the structural properties of the constraints, such as the linear independence of their gradients; and (ii) it admits a closed-form solution, which is not available for general QPs with multiple constraints, enabling faster computation. We support our method with rigorous analysis and examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_18530 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Reformulations of Quadratic Programs for Lipschitz Continuity Agrawal, Devansh R. Lee, Haejoon Panagou, Dimitra Optimization and Control Systems and Control Optimization-based controllers often lack regularity guarantees, such as Lipschitz continuity, when multiple constraints are present. When used to control a dynamical system, these conditions are essential to ensure the existence and uniqueness of the system's trajectory. Here we propose a general method to convert a Quadratic Program (QP) into a Second-Order Cone Problem (SOCP), which is shown to be Lipschitz continuous. Key features of our approach are that (i) the regularity of the resulting formulation does not depend on the structural properties of the constraints, such as the linear independence of their gradients; and (ii) it admits a closed-form solution, which is not available for general QPs with multiple constraints, enabling faster computation. We support our method with rigorous analysis and examples. |
| title | Reformulations of Quadratic Programs for Lipschitz Continuity |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2508.18530 |