Soft inequality constraints in gradient method and fast gradient method for quadratic programming (Q2331372)
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: Soft inequality constraints in gradient method and fast gradient method for quadratic programming |
scientific article; zbMATH DE number 7123818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Soft inequality constraints in gradient method and fast gradient method for quadratic programming |
scientific article; zbMATH DE number 7123818 |
Statements
Soft inequality constraints in gradient method and fast gradient method for quadratic programming (English)
0 references
29 October 2019
0 references
model predictive control
0 references
quadratic programming
0 references
first-order methods
0 references
soft constraints
0 references
KKT optimality conditions
0 references
0 references
0 references
0 references
0.7861641049385071
0 references
0.7765632271766663
0 references
0.7596828937530518
0 references
0.7528907656669617
0 references
