Some modified conjugate gradient methods for unconstrained optimization
From MaRDI portal
Publication:277201
DOI10.1016/J.CAM.2016.04.004zbMATH Open1335.90095OpenAlexW2316213429MaRDI QIDQ277201FDOQ277201
Peng Zhang, Wenya Ma, Xuewu Du
Publication date: 4 May 2016
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.2016.04.004
Recommendations
- A modified conjugate gradient method for unconstrained optimization
- A modified form of conjugate gradient method for unconstrained optimization problems
- Two modified conjugate gradient methods for solving unconstrained optimization and application
- A modified hybrid conjugate gradient method for unconstrained optimization
- A conjugate gradient method for unconstrained optimization problems
- A new conjugate gradient method for unconstrained optimization
- A new conjugate gradient method for unconstrained optimization
- A new conjugate gradient method for solving unconstrained optimization
- scientific article; zbMATH DE number 1376891
- A modified projected conjugate gradient algorithm for unconstrained optimization problems
global convergenceunconstrained optimizationconjugate gradient methodline searchsufficient descent property
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Cites Work
- Algorithm 851
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Function minimization by conjugate gradients
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restart procedures for the conjugate gradient method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- 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
- Title not available (Why is that?)
- The convergence properties of some new conjugate gradient methods
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method
- Global convergence properties of two classes of optimal algorithms constrained by the FR conjugate gradient method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence Properties of Algorithms for Nonlinear Optimization
- Convergence properties of the Fletcher-Reeves method
- A note about WYL's conjugate gradient method and its applications
Cited In (15)
- A novel multi-grid based reanalysis approach for efficient prediction of fatigue crack propagation
- Estimation of boundary condition of two-dimensional nonlinear PDE with application to continuous casting
- Title not available (Why is that?)
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Hybrid random batch idea and nonlinear conjugate gradient method for accelerating charged polymer dynamics simulation
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- A scaled derivative-free projection method for solving nonlinear monotone equations
- Two modified conjugate gradient methods for solving unconstrained optimization and application
- A conjugate gradient method for distributed optimal control problems with nonhomogeneous Helmholtz equation
- Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- A novel simple particle swarm optimization algorithm for global optimization
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems
- Title not available (Why is that?)
- Boundary and distributed optimal control for a population dynamics PDE model with discontinuous in time Galerkin FEM schemes
Uses Software
This page was built for publication: Some modified conjugate gradient methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277201)
