Short-step primal-dual target-following algorithms for the convex quadratic problems (Q2913902)
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 6085198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Short-step primal-dual target-following algorithms for the convex quadratic problems |
scientific article; zbMATH DE number 6085198 |
Statements
21 September 2012
0 references
interior points methods
0 references
convex quadratic programming
0 references
short-step method
0 references
primal-dual target following algorithm
0 references
polynomial complexity
0 references
Newton's method
0 references
numerical example
0 references
Short-step primal-dual target-following algorithms for the convex quadratic problems (English)
0 references
A primal-dual target-following algorithm with polynomial running time for solving convex quadratic problems is developed. The approach is a generalization of linear optimization for linearly constrained convex optimization. A new class of search directions by applying Newton's method is defined. A numerical example is used to show the implementation results of the algorithm.
0 references
0.8271879553794861
0 references
0.824440062046051
0 references
0.8168227672576904
0 references
0.7920641303062439
0 references
0.787826657295227
0 references
