Next Article in Journal
Automatic Defect Inspection for Coated Eyeglass Based on Symmetrized Energy Analysis of Color Channels
Next Article in Special Issue
CQ-Type Algorithm for Reckoning Best Proximity Points of EP-Operators
Previous Article in Journal
Study on Adaptive Cruise Control Strategy for Battery Electric Vehicle Considering Weight Adjustment
Previous Article in Special Issue
Convergence Analysis for a Three-Step Thakur Iteration for Suzuki-Type Nonexpansive Mappings with Visualization
Open AccessArticle

S-Subgradient Projection Methods with S-Subdifferential Functions for Nonconvex Split Feasibility Problems

by 1, 2,3,4,* and 5,6
1
School of Mathematics and Statistics, Lingnan Normal University, Zhanjiang 524048, China
2
Center for General Education, China Medical University, Taichung 40402, Taiwan
3
Department of Mathematics and Informatics, University “Politehnica” of Bucharest, 060042 Bucharest, Romania
4
Romanian Academy, Gh. Mihoc-C. Iacob Institute of Mathematical Statistics and Applied Mathematics, 050711 Bucharest, Romania
5
School of Mathematical Sciences, Tianjin Polytechnic University, Tianjin 300387, China
6
The Key Laboratory of Intelligent Information and Big Data Processing of NingXia Province, North Minzu University, Yinchuan 750021, China
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(12), 1517; https://doi.org/10.3390/sym11121517
Received: 24 November 2019 / Revised: 11 December 2019 / Accepted: 11 December 2019 / Published: 14 December 2019
(This article belongs to the Special Issue Advance in Nonlinear Analysis and Optimization)
In this paper, the original C Q algorithm, the relaxed C Q algorithm, the gradient projection method ( G P M ) algorithm, and the subgradient projection method ( S P M ) algorithm for the convex split feasibility problem are reviewed, and a renewed S P M algorithm with S-subdifferential functions to solve nonconvex split feasibility problems in finite dimensional spaces is suggested. The weak convergence theorem is established. View Full-Text
Keywords: S-subgradient projection method; nonconvex; S-subdifferentiable; split feasibility problem S-subgradient projection method; nonconvex; S-subdifferentiable; split feasibility problem
MDPI and ACS Style

Chen, J.; Postolache, M.; Yao, Y. S-Subgradient Projection Methods with S-Subdifferential Functions for Nonconvex Split Feasibility Problems. Symmetry 2019, 11, 1517. https://doi.org/10.3390/sym11121517

AMA Style

Chen J, Postolache M, Yao Y. S-Subgradient Projection Methods with S-Subdifferential Functions for Nonconvex Split Feasibility Problems. Symmetry. 2019; 11(12):1517. https://doi.org/10.3390/sym11121517

Chicago/Turabian Style

Chen, Jinzuo; Postolache, Mihai; Yao, Yonghong. 2019. "S-Subgradient Projection Methods with S-Subdifferential Functions for Nonconvex Split Feasibility Problems" Symmetry 11, no. 12: 1517. https://doi.org/10.3390/sym11121517

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop