The split feasibility problem with polynomials

DOI10.1360/SCM-2018-0582MaRDI QIDQ5064265zbMATH OpenFDO

Authors Jiawang Nie, Jinling Zhao

Publication date 21 March 2022

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.09429

zbMATH Keywords

polynomialsemidefinite relaxationsplit feasibility problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22)

Abstract: This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations for representing the intersection of the sets. Properties of the semidefinite relaxations are studied. Based on that, a semidefinite relaxation algorithm is given for solving the split feasibility problem. Under a general condition, we prove that: if the split feasibility problem is feasible, we can get a feasible point; if it is infeasible, we can obtain a certificate for the infeasibility. Some numerical examples are given.

Recommendations

• The semi-algebraic split feasibility problem and its semi-definite relaxation
• The relaxed CQ algorithm solving the split feasibility problem
• A new halfspace-relaxation projection method for the split feasibility problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• Semidefinite relaxation algorithm for solving tensor split feasibility problem

Cited in

(2)

• The semi-algebraic split feasibility problem and its semi-definite relaxation
• A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials

This page was built for publication: The split feasibility problem with polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064265)