2022
DOI: 10.1109/lcsys.2021.3083467
|View full text |Cite
|
Sign up to set email alerts
|

A Sequential Convex Programming Approach to Solving Quadratic Programs and Optimal Control Problems With Linear Complementarity Constraints

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 26 publications
0
7
0
Order By: Relevance
“…Some of the appealing properties of the constraints (27) are given by the next lemma. In our notation θ n,m,i is the i-th component of the vector θ n,m .…”
Section: Continuity Of λ(•) and µ(•)mentioning
confidence: 99%
See 3 more Smart Citations
“…Some of the appealing properties of the constraints (27) are given by the next lemma. In our notation θ n,m,i is the i-th component of the vector θ n,m .…”
Section: Continuity Of λ(•) and µ(•)mentioning
confidence: 99%
“…. , n s }, k = j, then θ n,m,i λ n,k,i > 0 which violates (27), thus all λ n,m ′ ,i = 0, m ′ ∈ {0, . .…”
Section: Continuity Of λ(•) and µ(•)mentioning
confidence: 99%
See 2 more Smart Citations
“…The resulting discretized OCP are Mathematical Programs with Complementarity Constraints (MPCC). With appropriate reformulations the MPCC can often be solved by only a few NLP solves [15]- [17], i.e., the highly nonsmooth and nonlinear OCP are solved by purely derivative based algorithms. A time optimal control problem of a hybrid system with hysteresis and a nonsmooth objective illustrates theoretical and algorithmic developments.…”
Section: Introductionmentioning
confidence: 99%