The conjugate gradient method in extremal problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- Two modified Dai-Yuan nonlinear conjugate gradient methods
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- A modified PRP conjugate gradient method
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- A sparse sequential quadratic programming algorithm
- Implementing proximal point methods for linear programming
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- A class of methods for solving large, convex quadratic programs subject to box constraints
- On three-term conjugate gradient algorithms for unconstrained optimization
- Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
- Convergence properties of the Beale-Powell restart algorithm
- Augmented Lagrangian algorithms for linear programming
- Conjugate gradient methods with Armijo-type line searches.
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A PRP-based residual method for large-scale monotone nonlinear equations
- A decomposition method for large-scale box constrained optimization
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems
- A class of one parameter conjugate gradient methods
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization
- Comments on ``Hybrid conjugate gradient algorithm for unconstrained optimization
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- Conjugate gradient based acceleration for inverse problems
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization
- A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- On the strong convergence of a sufficient descent Polak-Ribière-Polyak conjugate gradient method
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
- A time-space spectral tau method for the time fractional cable equation and its inverse problem
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A new family of conjugate gradient methods for unconstrained optimization
- An iterative working-set method for large-scale nonconvex quadratic programming
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- A new variant of the memory gradient method for unconstrained optimization
- A hybrid nonlinear conjugate gradient method
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- A new descent memory gradient method and its global convergence
- Nonmonotone spectral method for large-scale symmetric nonlinear equations
- The global convergence of a new mixed conjugate gradient method for unconstrained optimization
- Solving optimal control problem of monodomain model using hybrid conjugate gradient methods
- Convergence of conjugate gradient methods with a closed-form stepsize formula
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
- A modified nonlinear conjugate gradient method with the Armijo line search and its application
- A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- A class of modified FR conjugate gradient method and applications to non-negative matrix factorization
- A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Improved conjugate gradient method for nonlinear system of equations
- A diagonal PRP-type projection method for convex constrained nonlinear monotone equations
- A modified hybrid conjugate gradient method for unconstrained optimization
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- Sufficient descent Riemannian conjugate gradient methods
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- Behavior of the combination of PRP and HZ methods for unconstrained optimization
- Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations
- Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations
- Modified HS conjugate gradient method for solving generalized absolute value equations
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- A new accelerated conjugate gradient method for large-scale unconstrained optimization
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
- Least-squares-based three-term conjugate gradient methods
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
- A three-term conjugate gradient method with accelerated subspace quadratic optimization
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction
- Real-time pricing method for smart grid based on social welfare maximization model
- A class of line search-type methods for nonsmooth convex regularized minimization
- Globally convergent diagonal Polak-Ribière-Polyak like algorithm for nonlinear equations
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems
- A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems
- Two spectral conjugate gradient methods for unconstrained optimization problems
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
- Machine learning algorithms of relaxation subgradient method with space extension
- Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application
- An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration
This page was built for publication: The conjugate gradient method in extremal problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5637506)
