Algorithm 851
From MaRDI portal
Recommendations
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
- Several guaranteed descent conjugate gradient methods for unconstrained optimization
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
- A class of conjugate gradient algorithm with sufficient descent property
- A conjugate gradient method with sufficient descent property and its convergence property
- An efficient conjugate gradient method with sufficient descent property
- A conjugate gradient method with sufficient descent property
- On Hager and Zhang's conjugate gradient method with guaranteed descent
Cited in
(only showing first 100 items - show all)- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations
- Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations
- A new conjugate gradient method with an efficient memory structure
- Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Reduced order optimal control of the convective FitzHugh-Nagumo equations
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- A modified three-term conjugate gradient method with sufficient descent property
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Spectral method and its application to the conjugate gradient method
- Towards a comprehensive approach to optimal control of non-ideal binary batch distillation
- A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- A class of accelerated subspace minimization conjugate gradient methods
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- Modeling and control through leadership of a refined flocking system
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- A hybrid quasi-Newton method with application in sparse recovery
- A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- An improvement of the Goldstein line search
- Two modified conjugate gradient methods for unconstrained optimization
- On Hager and Zhang's conjugate gradient method with guaranteed descent
- The convergence of conjugate gradient method with nonmonotone line search
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM
- A modified conjugate gradient method for monotone nonlinear equations with convex constraints
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence
- Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
- A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
- Optimal vaccination strategy for a mean-field stochastic susceptible-infected-vaccinated system
- A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem
- A novel value for the parameter in the Dai-Liao-type conjugate gradient method
- A family of effective spectral CG methods with an adaptive restart scheme
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Quasi-Newton acceleration for equality-constrained minimization
- A new subspace minimization conjugate gradient method for unconstrained minimization
- Some modified conjugate gradient methods for unconstrained optimization
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- Two adaptive Dai-Liao nonlinear conjugate gradient methods
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- Necessary and sufficient conditions for near‐optimal controls of a stochastic West Nile virus system with spatial diffusion
- On solving a revised model of the nonnegative matrix factorization problem by the modified adaptive versions of the Dai-Liao method
- Two optimal Dai-Liao conjugate gradient methods
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- An efficient Newton-like conjugate gradient method with restart strategy and its application
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
- An efficient adaptive scaling parameter for the spectral conjugate gradient method
- A nonmonotone adaptive trust region technique with a forgetting factor
- Another Hager-Zhang-type method via singular-value study for constrained monotone equations with application
- SOBMOR: Structured Optimization-Based Model Order Reduction
- A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations
- A conjugate gradient algorithm and its applications in image restoration
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- Matrix analyses on the Dai-Liao conjugate gradient method
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A hybridization of the Hestenes-Stiefel and Dai-Yuan conjugate gradient methods based on a least-squares approach
- An online conjugate gradient algorithm for large-scale data analysis in machine learning
- Erratum to: scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- New conjugate gradient-like methods for unconstrained optimization
- A modified nonmonotone trust region line search method
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique
- Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
- A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization
- Optimal control of convective FitzHugh-Nagumo equation
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- Two modified scaled nonlinear conjugate gradient methods
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- Accelerated nonmonotone line search technique for multiobjective optimization
- Hypergraph-based convex semi-supervised unconstraint symmetric matrix factorization for image clustering
- An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
- Conjugate gradient methods using value of objective function for unconstrained optimization
- A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions
- A conjugate gradient method for unconstrained optimization problems
- Adaptive multigrid strategy for geometry optimization of large-scale three dimensional molecular mechanics
- A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
- On the optimal control of the Schlögl-model
- A restart scheme for the memoryless BFGS method
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- Sufficient and necessary conditions of near-optimal controls for a diffusion dengue model with Lévy noise
- A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method
- An adaptive nonmonotone trust region algorithm
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems
- An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method
- Adjustment of the scaling parameter of Dai-Kou type conjugate gradient methods with application to motion control.
- On the control through leadership of the Hegselmann-Krause opinion formation model
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization
- A descent family of Dai-Liao conjugate gradient methods
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Second-order adjoints for solving PDE-constrained optimization problems
- Bayesian calibration for large‐scale fluid structure interaction problems under embedded/immersed boundary framework
This page was built for publication: Algorithm 851
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549169)
