Hybrid Forward-Backward Algorithms Using Linesearch Rule for Minimization Problem

Kunrada Kankam, Nattawut Pholasa, Prasit Cholamjiak


In this work, we investigate strong convergence of the sequences generated by the forward-backward algorithms using hybrid projection method and shrinking projection method for solving the minimization problem. The main advantage of our algorithms is that the Lipschitz constants of the gradient of functions do not require in computation. Finally, we present numerical experiments of our algorithms which are defined by two kinds of projection methods to show the efficiency and the implementation for LASSO problem in signal recovery.

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|