Journal of Systems Engineering and Electronics ›› 2010, Vol. 21 ›› Issue (3): 527-530.doi: 10.3969/j.issn.1004-4132.2010.03.027
• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles
Li Li and Yan Gao*
Online:
Published:
Abstract:
An ε-subgradient projection algorithm for solving a convex feasibility problem is presented. Based on the iterative projection methods and the notion of ε-subgradient, a series of special projection hyperplanes is established. Moreover, compared with the existing projection hyperplanes methods with subgradient, the proposed hyperplanes are interactive with ε, and their ranges are more larger. The convergence of the proposed algorithm is given under some mild conditions, and the validity of the algorithm is proved by the numerical test.
Li Li and Yan Gao*. Approximate subgradient projection algorithm for convex feasibility problem[J]. Journal of Systems Engineering and Electronics, 2010, 21(3): 527-530.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jseepub.com/EN/10.3969/j.issn.1004-4132.2010.03.027
https://www.jseepub.com/EN/Y2010/V21/I3/527