Proximal algorithm meets a conjugate descent

zbMATH Open1349.90680MaRDI QIDQ2826257FDOQ2826257

Authors: Matthieu Kowalski 

Publication date: 14 October 2016

Published in: Pacific Journal of Optimization (Search for Journal in Brave)

Recommendations

• A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
• On the convergence of conjugate gradient algorithms

zbMATH Keywords

convex optimizationconjugate gradientproximal algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Cited In (1)

• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function

This page was built for publication: Proximal algorithm meets a conjugate descent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826257)