An interior-exterior approach for convex quadratic programming (Q436003): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans Benker / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C51 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6055247 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
convex quadratic programming | |||
| Property / zbMATH Keywords: convex quadratic programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
interior-exterior approach | |||
| Property / zbMATH Keywords: interior-exterior approach / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polynomial time algorithm | |||
| Property / zbMATH Keywords: polynomial time algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
numerical result | |||
| Property / zbMATH Keywords: numerical result / rank | |||
Normal rank | |||
Revision as of 23:59, 29 June 2023
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
