A modified CG-DESCENT method for unconstrained optimization
From MaRDI portal
Publication:535462
DOI10.1016/J.CAM.2011.01.046zbMATH Open1231.90343OpenAlexW2059598572MaRDI QIDQ535462FDOQ535462
Publication date: 11 May 2011
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.2011.01.046
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- CUTE
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Two-Term PRP-Based Descent Method
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
Cited In (8)
- Another modified version of RMIL conjugate gradient method
- A note on generalized convex functions
- Hermite-Hadamard type inequalities for co-ordinated convex and qausi-convex functions and their applications
- A modified Perry conjugate gradient method and its global convergence
- Some new fractional integral inequalities for exponentially \(m\)-convex functions via extended generalized Mittag-Leffler function
- Experiments with search directions for a generalized CG method
- Optimal two-parameter geometric and arithmetic mean bounds for the Sándor-Yang mean
- A limited memory descent Perry conjugate gradient method
Uses Software
This page was built for publication: A modified CG-DESCENT method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535462)
