Skip to Main content Skip to Navigation
Journal articles

Proximal Algorithm Meets a Conjugate descent

Abstract : This paper proposes an enhancement of the non linear conjugate gradient algorithm for some non-smooth problems. We first extend some results of descent algorithms in the smooth case for convex non-smooth functions. We then construct a conjugate descent algorithm based on the proximity operator to obtain a descent direction. We finally provide a convergence analysis of this algorithm, even when the proximity operator must be computed by an iterative process. Numerical experiments show that this kind of method has some potential, even if proposed algorithms do not outperform accelerated first order algorithm yet.
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00505733
Contributor : Matthieu Kowalski <>
Submitted on : Monday, September 26, 2011 - 11:36:27 AM
Last modification on : Wednesday, September 16, 2020 - 4:42:27 PM
Long-term archiving on: : Thursday, March 30, 2017 - 3:53:46 PM

File

proxConjTechRep.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00505733, version 3

Citation

Matthieu Kowalski. Proximal Algorithm Meets a Conjugate descent. Pacific journal of optimization, Yokohama Publishers, 2016, 12 (3), pp.669-695. ⟨hal-00505733v3⟩

Share

Metrics

Record views

657

Files downloads

372