arrow
Volume 12, Issue 2
The Semi-Algebraic Split Feasibility Problem and Its Semidefinite Relaxation

Jinling Zhao & Wei Chen

Numer. Math. Theor. Meth. Appl., 12 (2019), pp. 438-452.

Published online: 2018-12

Export citation
  • Abstract

This paper considers the semi-algebraic split feasibility problem (SASFP), i.e., the split feasibility problem defined by polynomials. It is more than a special case of the split feasibility problem (SFP) or the multiple-sets split feasibility problem (MSFP), since the solution set could be nonconvex or empty. We first establish the semi-definite relaxation for the SASFP, then discuss on the relationship of feasibility between the SASFP and its SDP relaxation, especially focus on infeasibility. Finally, some numerical experiments for different cases are implemented, and the corresponding results are reported.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{NMTMA-12-438, author = {}, title = {The Semi-Algebraic Split Feasibility Problem and Its Semidefinite Relaxation}, journal = {Numerical Mathematics: Theory, Methods and Applications}, year = {2018}, volume = {12}, number = {2}, pages = {438--452}, abstract = {

This paper considers the semi-algebraic split feasibility problem (SASFP), i.e., the split feasibility problem defined by polynomials. It is more than a special case of the split feasibility problem (SFP) or the multiple-sets split feasibility problem (MSFP), since the solution set could be nonconvex or empty. We first establish the semi-definite relaxation for the SASFP, then discuss on the relationship of feasibility between the SASFP and its SDP relaxation, especially focus on infeasibility. Finally, some numerical experiments for different cases are implemented, and the corresponding results are reported.

}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.OA-2017-0146}, url = {http://global-sci.org/intro/article_detail/nmtma/12903.html} }
TY - JOUR T1 - The Semi-Algebraic Split Feasibility Problem and Its Semidefinite Relaxation JO - Numerical Mathematics: Theory, Methods and Applications VL - 2 SP - 438 EP - 452 PY - 2018 DA - 2018/12 SN - 12 DO - http://doi.org/10.4208/nmtma.OA-2017-0146 UR - https://global-sci.org/intro/article_detail/nmtma/12903.html KW - AB -

This paper considers the semi-algebraic split feasibility problem (SASFP), i.e., the split feasibility problem defined by polynomials. It is more than a special case of the split feasibility problem (SFP) or the multiple-sets split feasibility problem (MSFP), since the solution set could be nonconvex or empty. We first establish the semi-definite relaxation for the SASFP, then discuss on the relationship of feasibility between the SASFP and its SDP relaxation, especially focus on infeasibility. Finally, some numerical experiments for different cases are implemented, and the corresponding results are reported.

Jinling Zhao & Wei Chen. (2020). The Semi-Algebraic Split Feasibility Problem and Its Semidefinite Relaxation. Numerical Mathematics: Theory, Methods and Applications. 12 (2). 438-452. doi:10.4208/nmtma.OA-2017-0146
Copy to clipboard
The citation has been copied to your clipboard