An interior-exterior approach for convex quadratic programming (Q436003)
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: An interior-exterior approach for convex quadratic programming |
scientific article; zbMATH DE number 6055247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An interior-exterior approach for convex quadratic programming |
scientific article; zbMATH DE number 6055247 |
Statements
An interior-exterior approach for convex quadratic programming (English)
0 references
13 July 2012
0 references
convex quadratic programming
0 references
interior-exterior approach
0 references
polynomial time algorithm
0 references
numerical result
0 references
The authors consider the following convex quadratic programming problem NEWLINE\[NEWLINE\min\Biggl\{c^tx+{1\over 2} x^tQx: Ax= b,\,x\geq 0\Biggr\}NEWLINE\]NEWLINE and develop a polynomial time algorithm based on the use of mixed penalties methods. -- Some numerical results are given.
0 references
0.831356942653656
0 references
0.8299698829650879
0 references
0.829573392868042
0 references
0.825691819190979
0 references
