An interior-exterior approach for convex quadratic programming (Q436003): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.apnum.2011.03.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090094417 / rank | |||
Normal rank | |||
Revision as of 19:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An interior-exterior approach for convex quadratic programming |
scientific article |
Statements
An interior-exterior approach for convex quadratic programming (English)
0 references
13 July 2012
0 references
The authors consider the following convex quadratic programming problem \[ \min\Biggl\{c^tx+{1\over 2} x^tQx: Ax= b,\,x\geq 0\Biggr\} \] and develop a polynomial time algorithm based on the use of mixed penalties methods. -- Some numerical results are given.
0 references
convex quadratic programming
0 references
interior-exterior approach
0 references
polynomial time algorithm
0 references
numerical result
0 references
