Download PDF - Projection method with residual selection for linear feasibility problemsAll rights reserved. Copyright exceptions and limitations apply

ArticleOriginal scientific text

Title

Projection method with residual selection for linear feasibility problems

Authors 1

Affiliations

  1. Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Poland, Szafrana 4a, 65-516 Zielona Góra, Poland

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.

Keywords

ENG
projection method, linear feasibility, residual selection

Bibliography

  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.
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
2007/27/1
Export to PBN, Opens in new tab
Pages:
43-50
Main language of publication
English
Received
2006-03-15
Published
2007

DOI: 10.7151/dmdico1075

Exact and natural sciences