On some interior-point algorithms for nonconvex quadratic optimization (Q1396211)
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 1942737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some interior-point algorithms for nonconvex quadratic optimization |
scientific article; zbMATH DE number 1942737 |
Statements
On some interior-point algorithms for nonconvex quadratic optimization (English)
0 references
2002
0 references
The paper is concerned with the quadratic optimization problem \(\min f(x)=x^T Q x\) subject to \(x \geq 0\), where \(Q\) is a symmetric possibly indefinite matrix. The authors give several examples showing that in the case where \(\inf_{x \geq 0} f(x)=-\infty\), the central-path following method and the affine-scaling method may converge to the origin, which is not even a local minimum.
0 references
nonconvex optimization
0 references
quadratic optimization
0 references
0.8287678360939026
0 references
0.8287291526794434
0 references
0.823802649974823
0 references
0.7854657769203186
0 references
0.7799779772758484
0 references
