Inertial Relaxed CQ Algorithm with an Application to Signal Processing

Duangkamon Kitkuan, Kanikar Muangchoo


In this paper, we introduce  inertial relaxed algorithm  involving the self-adaptive technique for solving the split feasibility problem in  Hilbert spaces  which we approximate the original convex subset by a sequence of closed balls instead of half spaces.  Then, the convergence results are established under mild conditions. Finally, we applied our algorithm in signal processing.

Full Text: PDF


  • There are currently no refbacks.

The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|