An efficient conjugate gradient method with strong convergence properties for non-smooth optimization
From MaRDI portal
Recommendations
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- A three-term conjugate gradient algorithm for large-scale nonsmooth minimizations
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- A descent algorithm for nonsmooth convex optimization
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- A new efficient conjugate gradient method for unconstrained optimization
- A new trust region algorithm for nonsmooth convex minimization
- A survey of nonlinear conjugate gradient methods
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- A trust region method for nonsmooth convex optimization
- Comparing different nonsmooth minimization methods and software
- Conjugate gradient type methods for the nondifferentiable convex minimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convergence analysis of a proximal newton method1
- Convergence of some algorithms for convex minimization
- Deblurring Images
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Globally convergent BFGS method for nonsmooth convex optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Methods of conjugate gradients for solving linear systems
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New limited memory bundle method for large-scale nonsmooth optimization
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems
- The conjugate gradient method in extremal problems
- Trust Region Methods
Cited in
(4)
This page was built for publication: An efficient conjugate gradient method with strong convergence properties for non-smooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025110)
