First-order sequential convex programming using approximate diagonal QP subproblems (Q381733)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6228073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | First-order sequential convex programming using approximate diagonal QP subproblems |
scientific article; zbMATH DE number 6228073 |
Statements
First-order sequential convex programming using approximate diagonal QP subproblems (English)
0 references
15 November 2013
0 references
diagonal quadratic approximation
0 references
sequential approximate optimization (SAO)
0 references
sequential quadratic programming (SQP)
0 references
sequential convex programming (SCP)
0 references
reciprocal intervening variables
0 references
trust region method
0 references
0 references
0 references
0 references
0 references
0.8090513348579407
0 references
0.803631603717804
0 references
0.789707362651825
0 references
