A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128296398, #quickstatements; #temporary_batch_1723710233280 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10589-019-00058-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-019-00058-0 / rank | |||
Normal rank | |||
Latest revision as of 12:49, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme |
scientific article |
Statements
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (English)
0 references
13 June 2019
0 references
convex quadratic programming
0 references
constraint reduction
0 references
primal-dual interior-point method
0 references
Mehrotra's predictor-corrector
0 references
regularization
0 references
active constraints identification
0 references
0 references
0 references
0 references
0 references
0 references
