New conjugate gradient method for unconstrained optimization
From MaRDI portal
Publication:2954367
DOI10.1051/RO/2015064zbMATH Open1357.65076OpenAlexW2325251790MaRDI QIDQ2954367FDOQ2954367
Authors: Y. Chaib, Badreddine Sellami 
Publication date: 12 January 2017
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2015064
Recommendations
- 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
- New conjugate gradient-like methods for unconstrained optimization
- A new efficient conjugate gradient method for unconstrained optimization
- New hybrid conjugate gradient method for unconstrained optimization
- A NEW NONLINEAR CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
- Solving unconstrained optimization with a new type of conjugate gradient method
- A new conjugate gradient method for nonlinear unconstrained optimization problems
- Two new conjugate gradient methods for unconstrained optimization
global convergencelarge-scalenumerical resultunconstrained optimizationconjugate gradient methodline search
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Nonlinear programming (90C30)
Cites Work
- CUTE
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- Title not available (Why is that?)
- An unconstrained optimization test functions collection
- Title not available (Why is that?)
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- 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
- Global convergence result for conjugate gradient methods
- 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?)
- A three-parameter family of nonlinear conjugate gradient methods
- A survey of nonlinear conjugate gradient methods
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Conjugate Gradient Methods with Inexact Searches
- A new two-parameter family of nonlinear conjugate gradient methods
- A class of globally convergent conjugate gradient methods
Cited In (30)
- Calculation formula of conjugate gradient method
- Solving unconstrained optimization with a new type of conjugate gradient method
- A modified nonlinear conjugate gradient algorithm for unconstrained optimization and portfolio selection problems
- A new CG-algorithm with self-scaling VM-update for unconstraint optimization
- A new conjugate gradient method based on the modified BFGS formula
- Title not available (Why is that?)
- A trust region algorithm with conjugate gradient technique for optimization problems
- A variational method for unconstrained optimization problems
- Title not available (Why is that?)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Conjugate gradient methods using value of objective function for unconstrained optimization
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- A class of nonmonotone conjugate gradient methods for unconstraint optimization
- A new conjugate gradient method with the Wolfe line search
- Title not available (Why is that?)
- A gradient-related algorithm with inexact line searches
- A new conjugate gradient method for unconstrained optimization with sufficient descent
- A new conjugate gradient method for unconstrained optimization
- A new conjugate gradient method for unconstrained optimization
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- A rank-one fitting method for unconstrained optimization problems
- A linearly convergent conjugate gradient method for unconstrained optimization problems
- New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems.
- A new method of moving asymptotes for large-scale unconstrained optimization
- A new algorithm for moving asymptotes for solving unconstrained optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Acceleration of conjugate gradient algorithms for unconstrained optimization
Uses Software
This page was built for publication: New conjugate gradient method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954367)
