Geodesic
Applying a reduced gradient in the quadratic programming
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 13 (2010) no. 1, pp. 23-31 
E. A. Kotel'nikov. Applying a reduced gradient in the quadratic programming. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 13 (2010) no. 1, pp. 23-31. http://geodesic.mathdoc.fr/item/SJVM_2010_13_1_a2/
@article{SJVM_2010_13_1_a2,
     author = {E. A. Kotel'nikov},
     title = {Applying a~reduced gradient in the quadratic programming},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {23--31},
     year = {2010},
     volume = {13},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2010_13_1_a2/}
}
TY  - JOUR
AU  - E. A. Kotel'nikov
TI  - Applying a reduced gradient in the quadratic programming
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2010
SP  - 23
EP  - 31
VL  - 13
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/SJVM_2010_13_1_a2/
LA  - ru
ID  - SJVM_2010_13_1_a2
ER  - 
%0 Journal Article
%A E. A. Kotel'nikov
%T Applying a reduced gradient in the quadratic programming
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2010
%P 23-31
%V 13
%N 1
%U http://geodesic.mathdoc.fr/item/SJVM_2010_13_1_a2/
%G ru
%F SJVM_2010_13_1_a2

Voir la notice de l'article provenant de la source Math-Net.Ru

This paper considers specific aspects of implementing the algorithm for solving problems of the quadratic programming, which is based on the reduced gradient method. In the current subspace of the superbasis variables, minimization is carried out by the conjugate gradient method. Some examples of solution of test problems are given.

[1] Murtagh B. A., Saunders M. A., “Large-scale linearly constrained optimization”, Math. Programming, 14:1 (1978), 41–72 | DOI | MR | Zbl

[2] Murtaf B., Sovremennoe lineinoe programmirovanie. Teoriya i praktika, Mir, M., 1984 | MR

[3] Gill F., Myurrei U., Rait M., Prakticheskaya optimizatsiya, Mir, M., 1985 | MR

[4] Uilkinson Dzh., Rainsh K., Spravochnik na yazyke Algol. Lineinaya algebra, Mashinostroenie, M., 1976

[5] Forrest J. J. H., Tomlin J. A., “Updated triangular factors of the basis to maintain sparsity in the product form simplex method”, Math. Programming, 2:3 (1972), 263–278 | DOI | MR | Zbl

[6] Zabinyako G. I., Kotelnikov E. A., Kobkova T. M., Rozhin V. E., Programmy lineinogo programmirovaniya LP-VTs, Otchet VTs SO RAN; No GR.01.9.30001317; Inv. No 02.9.50003757, VTs SO RAN, Novosibirsk, 1995

[7] Hellerman E., Rarick D. C., “Reinversion with the pressigned pivot procedure”, Math. Programming, 1:2 (1971), 195–216 | DOI | MR | Zbl

[8] Mittelman H. D., Decision Tree for Optimization Software, http://plato.asu.edu/guide.html

[9] Martin A., Achterberg T., Koch T., MIPLIB – Mixed Integer Problem Library, , 2003 http://miplib.zib.de/