Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
From MaRDI portal
Publication:2068628
Recommendations
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- scientific article; zbMATH DE number 6178808
- A new hybrid conjugate gradient algorithm for unconstrained optimization
- New hybrid conjugate gradient method for unconstrained optimization
- A new hybrid conjugate gradient method for unconstrained optimization
Cites work
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- A literature survey of benchmark functions for global optimisation problems
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- Algorithm 851
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- Conjugate Gradient Methods with Inexact Searches
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient hybrid conjugate gradient techniques
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 2107185 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Hybrid conjugate gradient methods for unconstrained optimization
- Iterative methods and their dynamics with applications: a contemporary study
- Methods of conjugate gradients for solving linear systems
- New hybrid conjugate gradient method for unconstrained optimization
- Nonlinear conjugate gradient methods for unconstrained optimization
- Optimization theory and methods. Nonlinear programming
- Some three-term conjugate gradient methods with the inexact line search condition
- The conjugate gradient method in extremal problems
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(14)- A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- scientific article; zbMATH DE number 6178808 (Why is no real title available?)
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- New DY-HS hybrid conjugate gradient algorithm for solving optimization problem of unsteady partial differential equations with convection term
- A modified Levenberg-Marquardt method for solving system of nonlinear equations
- Optimal control of three-dimensional unsteady partial differential equations with convection term in continuous casting
- A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery
- An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
- A new hybrid three-term LS-CD conjugate gradient in solving unconstrained optimization problems
- Some improved Dai-Yuan conjugate gradient methods for large-scale unconstrained optimization problems
- An efficient projection algorithm for large-scale system of monotone nonlinear equations with applications in signal recovery
- A convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications
- The global convergence of a spectral three-term Riemannian conjugate gradient method with convex combination
- An efficient FR-CD-like algorithm for unconstrained optimization
This page was built for publication: Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2068628)
