Inertial accelerated algorithms for solving a split feasibility problem
MetadataShow full item record
Funding and Sponsorship
This is a pre-copy-editing, author-produced PDF of an article accepted for publication in Journal of Industrial and Management Optimization following peer review. The definitive publisher-authenticated version cited above is available online at: http://doi.org/10.3934/jimo.2016078
Inspired by the inertial proximal algorithms for finding a zero of a maximal monotone operator, in this paper, we propose two inertial accel erated algorithms to solve the split feasibility problem. One is an inertial relaxed-CQ algorithm constructed by applying inertial technique to a relaxed- CQ algorithm, the other is a modified inertial relaxed-CQ algorithm which combines the KM method with the inertial relaxed-CQ algorithm. We prove their asymptotical convergence under some suitable conditions. Numerical re sults are reported to show the effectiveness of the proposed algorithms.
Showing items related by title, author, creator and subject.
Cooperative Localisation of a GPS-Denied UAV in 3-Dimensional Space Using Direction of Arrival MeasurementsRussell, J.S.; Ye, Mengbin ; Anderson, B.D.O.; Hmam, H.; Sarunic, P. (2017)This paper presents a novel approach for localising a GPS (Global Positioning System)-denied Unmanned Aerial Vehicle (UAV) with the aid of a GPS-equipped UAV in three-dimensional space. The GPS-equipped UAV makes discrete-time ...
Grigoleit, Mark Ted (2008)The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...
Goyal, M.; Ghosh, Arindam; zare, F. (2013)A microgrid may contain a large number of distributed generators (DGs). These DGs can be either inertial or non-inertial, either dispatchable or non-dispatchable. Moreover, the DGs may operate in plug and play fashion. ...