A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
From MaRDI portal
Publication:2133373
Recommendations
- A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection
- A modified nonlinear conjugate gradient algorithm for unconstrained optimization and portfolio selection problems
- A new hybrid conjugate gradient FR and PRP method for unconstrained optimization problems
- A new hybrid conjugate gradient algorithm for unconstrained optimization
- A new hybrid conjugate gradient algorithm for unconstrained optimization
- A family of hybrid conjugate gradient methods for unconstrained optimization
- A new hybrid conjugate gradient method for unconstrained optimization
- A new hybrid conjugate gradient method for unconstrained optimization
- A new hybrid conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
Cites work
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A globally convergent version of the Polak-Ribière conjugate gradient method
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- 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 adaptive conjugate gradient algorithm for large-scale 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
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- 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
- Methods of conjugate gradients for solving linear systems
- New hybrid conjugate gradient method for unconstrained optimization
- Nonlinear conjugate gradient methods for unconstrained optimization
- The conjugate gradient method in extremal problems
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(23)- Penalty algorithm based on conjugate gradient method for solving portfolio management problem
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
- Projection method with inertial step for nonlinear equations: application to signal recovery
- Periodic solution for inertial neural networks with variable parameters
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- An efficient hybrid conjugate gradient method for unconstrained optimization
- A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection
- A three-term inertial derivative-free projection method for convex constrained monotone equations
- A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems
- Modified Dai-Yuan conjugate gradient method with sufficient descent property for nonlinear equations
- 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
- Application of a globally convergent hybrid conjugate gradient method in portfolio optimization
- Hybrid Hu-Storey type methods for large-scale nonlinear monotone systems and signal recovery
- Developing a new conjugate gradient algorithm with the benefit of some desirable properties of the Newton algorithm for unconstrained optimization
- A convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications
- A hybrid conjugate gradient method with trust region for large-scale unconstrained optimization problems
- On the extension of a hybrid conjugate gradient algorithm for multiobjective optimization
- A modified extended Fletcher–Reeves conjugate gradient method with an application in image restoration
- A new hybrid conjugate gradient method based on a convex combination for multiobjective optimization
- Two sufficient descent spectral conjugate gradient algorithms for unconstrained optimization with application
- A modified conjugate gradient method for unconstrained optimization with application in regression function
- An efficient FR-CD-like algorithm for unconstrained optimization
This page was built for publication: A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133373)
