Geodesic
On the Step Choice in Projection Algorithms for Large-Scale Linear Programming Problems
Dalʹnevostočnyj matematičeskij žurnal, Tome 12 (2012) no. 2, pp. 160-170

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

In order to solve large-scale linear programming problems the group of algorithms with projection of a point onto the set is considered. Special method for selecting the initial approximation and the step-size parameters is given to reduce computational time. Comparative analysis of the rates of convergence and running time of the algorithm with various step parameters is done for the special large-scale test problem with randomly generated data. 
@article{DVMG_2012_12_2_a3,
     author = {A. S. Velichko},
     title = {On the {Step} {Choice} in {Projection} {Algorithms} for {Large-Scale} {Linear} {Programming} {Problems}},
     journal = {Dalʹnevosto\v{c}nyj matemati\v{c}eskij \v{z}urnal},
     pages = {160--170},
     publisher = {mathdoc},
     volume = {12},
     number = {2},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DVMG_2012_12_2_a3/}
}
TY  - JOUR
AU  - A. S. Velichko
TI  - On the Step Choice in Projection Algorithms for Large-Scale Linear Programming Problems
JO  - Dalʹnevostočnyj matematičeskij žurnal
PY  - 2012
SP  - 160
EP  - 170
VL  - 12
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DVMG_2012_12_2_a3/
LA  - ru
ID  - DVMG_2012_12_2_a3
ER  - 
%0 Journal Article
%A A. S. Velichko
%T On the Step Choice in Projection Algorithms for Large-Scale Linear Programming Problems
%J Dalʹnevostočnyj matematičeskij žurnal
%D 2012
%P 160-170
%V 12
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DVMG_2012_12_2_a3/
%G ru
%F DVMG_2012_12_2_a3
A. S. Velichko. On the Step Choice in Projection Algorithms for Large-Scale Linear Programming Problems. Dalʹnevostočnyj matematičeskij žurnal, Tome 12 (2012) no. 2, pp. 160-170. http://geodesic.mathdoc.fr/item/DVMG_2012_12_2_a3/