Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC (Q2989596)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC |
scientific article; zbMATH DE number 6728006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC |
scientific article; zbMATH DE number 6728006 |
Statements
Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC (English)
0 references
8 June 2017
0 references
0.8936743
0 references
0.88713634
0 references
0.88172656
0 references
0.8765334
0 references
0.87078786
0 references
0.86859447
0 references
0 references
