A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
From MaRDI portal
Publication:2252688
DOI10.1016/j.cam.2013.04.032zbMath1291.90315OpenAlexW2013207196WikidataQ59241475 ScholiaQ59241475MaRDI QIDQ2252688
Guoyin Li, Zeng-xin Wei, Gong Lin Yuan
Publication date: 23 July 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.04.032
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items
An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization ⋮ A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ A new adaptive trust region algorithm for optimization problems ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ New hybrid conjugate gradient method as a convex combination of LS and FR methods ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization ⋮ Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ Multivariate spectral gradient algorithm for nonsmooth convex optimization problems ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions ⋮ Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization ⋮ The projection technique for two open problems of unconstrained optimization problems ⋮ A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems ⋮ Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration ⋮ A modified conjugate gradient method for general convex functions ⋮ An adaptive trust region algorithm for large-residual nonsmooth least squares problems ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence ⋮ A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems ⋮ A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations ⋮ A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ A modified three-term conjugate gradient method with sufficient descent property ⋮ A modified nonlinear conjugate gradient method with the Armijo line search and its application ⋮ A new family of conjugate gradient methods for unconstrained optimization ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search ⋮ Wei–Yao–Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints ⋮ Some three-term conjugate gradient methods with the new direction structure ⋮ A conjugate gradient algorithm and its applications in image restoration ⋮ The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization ⋮ A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint ⋮ A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions ⋮ Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems ⋮ A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations ⋮ A memory gradient method for non-smooth convex optimization ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization
- Convergence analysis of a modified BFGS method on convex minimizations
- A conjugate gradient method with descent direction for unconstrained optimization
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A limited memory BFGS-type method for large-scale unconstrained optimization
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- A modified PRP conjugate gradient method
- Efficient hybrid conjugate gradient techniques
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- A general approach to convergence properties of some methods for nonsmooth convex optimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- Global convergence result for conjugate gradient methods
- Convergence of some algorithms for convex minimization
- A new method for nonsmooth convex optimization
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
- A family of variable metric proximal methods
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Conjugate gradient type methods for the nondifferentiable convex minimization
- Methods of descent for nondifferentiable optimization
- New quasi-Newton methods for unconstrained optimization problems
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Algorithm 851
- MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- Trust Region Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Convergence analysis of a proximal newton method1
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- New limited memory bundle method for large-scale nonsmooth optimization
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
