Geodesic
Projection method with residual selection for linear feasibility problems
Discussiones Mathematicae. Differential Inclusions, Control and Optimization, Tome 27 (2007) no. 1, pp. 43-50

Voir la notice de l'article provenant de la source Library of Science

We propose a new projection method for linear feasibility problems. The method is based on the so called residual selection model. We present numerical results for some test problems.
Keywords: projection method, linear feasibility, residual selection 
Dylewski, Robert. Projection method with residual selection for linear feasibility problems. Discussiones Mathematicae. Differential Inclusions, Control and Optimization, Tome 27 (2007) no. 1, pp. 43-50. http://geodesic.mathdoc.fr/item/DMDICO_2007_27_1_a2/
@article{DMDICO_2007_27_1_a2,
     author = {Dylewski, Robert},
     title = {Projection method with residual selection for linear feasibility problems},
     journal = {Discussiones Mathematicae. Differential Inclusions, Control and Optimization},
     pages = {43--50},
     year = {2007},
     volume = {27},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMDICO_2007_27_1_a2/}
}
TY  - JOUR
AU  - Dylewski, Robert
TI  - Projection method with residual selection for linear feasibility problems
JO  - Discussiones Mathematicae. Differential Inclusions, Control and Optimization
PY  - 2007
SP  - 43
EP  - 50
VL  - 27
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DMDICO_2007_27_1_a2/
LA  - en
ID  - DMDICO_2007_27_1_a2
ER  - 
%0 Journal Article
%A Dylewski, Robert
%T Projection method with residual selection for linear feasibility problems
%J Discussiones Mathematicae. Differential Inclusions, Control and Optimization
%D 2007
%P 43-50
%V 27
%N 1
%U http://geodesic.mathdoc.fr/item/DMDICO_2007_27_1_a2/
%G en
%F DMDICO_2007_27_1_a2

[1] A. Cegielski, Relaxation Methods in Convex Optimization Problems, Higher College of Engineering, Series Monographs, No. 67, Zielona Góra, 1993 (Polish).

[2] A. Cegielski, Projection onto an acute cone and convex feasibility problems, J. Henry and J.-P. Yvon (eds.), Lecture Notes in Control and Information Science 197 (1994), 187-194.

[3] K.C. Kiwiel, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Linear Algebra and Its Applications 252 (1997), 27-33.

[4] A. Cegielski, A method of projection onto an acute cone with level control in convex minimization, Mathematical Programming 85 (1999), 469-490.

[5] A. Cegielski and R. Dylewski, Selection strategies in projection methods for convex minimization problems, Discuss. Math. Differential Inclusions, Control and Optimization 22 (2002), 97-123.

[6] A. Cegielski and R. Dylewski, Residual selection in a projection method for covex minimization problems, Optimization 52 (2003), 211-220.