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
topAbstract
topHow to cite
topReferences
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