Volume 1, Issue 1
Some Remarks on the Convex Feasibility Problem and Best Approximation Problem

Qingzhi Yang & Jinling Zhao

Numer. Math. Theor. Meth. Appl., 1 (2008), pp. 78-91.

Published online: 2008-01

Preview Full PDF 567 3261
Export citation
  • Abstract

In this paper we investigate several solution algorithms for the convex feasibility problem (CFP) and the best approximation problem (BAP) respectively. The algorithms analyzed are already known before, but by adequately reformulating the CFP or the BAP we naturally deduce the general projection method for the CFP from well-known steepest decent method for unconstrained optimization and we also give a natural strategy of updating weight parameters. In the linear case we show the connection of the two projection algorithms for the CFP and the BAP respectively. In addition, we establish the convergence of a method for the BAP under milder assumptions in the linear case. We also show by examples a Bauschke's conjecture is only partially correct.

  • Keywords

Convex feasibility problem, best approximation problem, projection method, convergence.

  • AMS Subject Headings

49M37, 90C25, 90C90

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{NMTMA-1-78, author = {}, title = {Some Remarks on the Convex Feasibility Problem and Best Approximation Problem}, journal = {Numerical Mathematics: Theory, Methods and Applications}, year = {2008}, volume = {1}, number = {1}, pages = {78--91}, abstract = {

In this paper we investigate several solution algorithms for the convex feasibility problem (CFP) and the best approximation problem (BAP) respectively. The algorithms analyzed are already known before, but by adequately reformulating the CFP or the BAP we naturally deduce the general projection method for the CFP from well-known steepest decent method for unconstrained optimization and we also give a natural strategy of updating weight parameters. In the linear case we show the connection of the two projection algorithms for the CFP and the BAP respectively. In addition, we establish the convergence of a method for the BAP under milder assumptions in the linear case. We also show by examples a Bauschke's conjecture is only partially correct.

}, issn = {2079-7338}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/nmtma/6043.html} }
TY - JOUR T1 - Some Remarks on the Convex Feasibility Problem and Best Approximation Problem JO - Numerical Mathematics: Theory, Methods and Applications VL - 1 SP - 78 EP - 91 PY - 2008 DA - 2008/01 SN - 1 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/nmtma/6043.html KW - Convex feasibility problem, best approximation problem, projection method, convergence. AB -

In this paper we investigate several solution algorithms for the convex feasibility problem (CFP) and the best approximation problem (BAP) respectively. The algorithms analyzed are already known before, but by adequately reformulating the CFP or the BAP we naturally deduce the general projection method for the CFP from well-known steepest decent method for unconstrained optimization and we also give a natural strategy of updating weight parameters. In the linear case we show the connection of the two projection algorithms for the CFP and the BAP respectively. In addition, we establish the convergence of a method for the BAP under milder assumptions in the linear case. We also show by examples a Bauschke's conjecture is only partially correct.

Qingzhi Yang & Jinling Zhao. (2020). Some Remarks on the Convex Feasibility Problem and Best Approximation Problem. Numerical Mathematics: Theory, Methods and Applications. 1 (1). 78-91. doi:
Copy to clipboard
The citation has been copied to your clipboard