Solving convex quadratic programming by potential reduction interior-point algorithm (Q2748686)
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 1663345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving convex quadratic programming by potential reduction interior-point algorithm |
scientific article; zbMATH DE number 1663345 |
Statements
12 February 2002
0 references
global convergence
0 references
numerical experiments
0 references
convex quadratic programming
0 references
potential-reduction interior
0 references
point algorithm
0 references
Solving convex quadratic programming by potential reduction interior-point algorithm (English)
0 references
We solve convex quadratic programming by a potential-reduction interior-point algorithm. It is proved that the potential-reduction interior-point algorithm is globally convergent. Some numerical experiments were made.
0 references
