Abstract
ABSTRACTStrict feasibility is an important issue in studies on the theory and algorithms of complementarity problems. For the tensor complementarity problem, strict feasibility can be characterized by the S-tensor. In this paper, we discuss properties of S-tensors. We illustrate that principal sub-tensors of an S-tensor are not always an S-tensor. In particular, we propose several necessary and/or sufficient conditions to judge whether a tensor is an S-tensor or not. Moreover, we also discuss relationship among S-tensors and several related tensors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
