A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311)
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: A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application |
scientific article; zbMATH DE number 7309638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application |
scientific article; zbMATH DE number 7309638 |
Statements
A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (English)
0 references
12 February 2021
0 references
two-block nonconvex constrained optimization
0 references
quadratically constrained quadratic programming
0 references
sequential quadratic programming
0 references
splitting method
0 references
convergence analysis
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8351449370384216
0 references
0.810686469078064
0 references
0.7930752038955688
0 references
