Cover Image

A double forward-backward algorithm using linesearches for minimization problem

Prasit Cholamjiak, Kunrada Kankam, Phootares Srinet, Nattawut Pholasa


In this paper, we  introduce a novel forward-backward algorithm involving  linesearches  for solving nonsmooth optimization problems in Hilbert spaces. The convergence including the complexity are proved under mild conditions.Further, some numerical experiments are tested to show the efficiency and the implementation of our algorithms. It reveals that the proposed method has a good convergence in terms of CPU time and number of iterations.

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|