Projection method with residual selection for linear feasibility problems
Discussiones Mathematicae, Differential Inclusions, Control and Optimization (2007)
- Volume: 27, Issue: 1, page 43-50
- ISSN: 1509-9407
Access Full Article
top
Abstract
topHow to cite
topRobert Dylewski. "Projection method with residual selection for linear feasibility problems." Discussiones Mathematicae, Differential Inclusions, Control and Optimization 27.1 (2007): 43-50. <http://eudml.org/doc/271133>.
@article{RobertDylewski2007,
abstract = {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.},
author = {Robert Dylewski},
journal = {Discussiones Mathematicae, Differential Inclusions, Control and Optimization},
keywords = {projection method; linear feasibility; residual selection},
language = {eng},
number = {1},
pages = {43-50},
title = {Projection method with residual selection for linear feasibility problems},
url = {http://eudml.org/doc/271133},
volume = {27},
year = {2007},
}
TY - JOUR
AU - Robert Dylewski
TI - Projection method with residual selection for linear feasibility problems
JO - Discussiones Mathematicae, Differential Inclusions, Control and Optimization
PY - 2007
VL - 27
IS - 1
SP - 43
EP - 50
AB - 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.
LA - eng
KW - projection method; linear feasibility; residual selection
UR - http://eudml.org/doc/271133
ER -
References
top- [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. Zbl0816.90108
- [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. Zbl0870.65046
- [4] A. Cegielski, A method of projection onto an acute cone with level control in convex minimization, Mathematical Programming 85 (1999), 469-490. Zbl0973.90057
- [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. Zbl1175.90310
- [6] A. Cegielski and R. Dylewski, Residual selection in a projection method for covex minimization problems, Optimization 52 (2003), 211-220. Zbl1057.49021
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.