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)- Quasi-Newton acceleration for equality-constrained minimization
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Two accelerated nonmonotone adaptive trust region line search methods
- Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
- An improved Perry conjugate gradient method with adaptive parameter choice
- An efficient multigrid strategy for large-scale molecular mechanics optimization
- CG_DESCENT
- Several guaranteed descent conjugate gradient methods for unconstrained optimization
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Conjugate gradient methods using value of objective function for unconstrained optimization
- Two adaptive Dai-Liao nonlinear conjugate gradient methods
- Two proposals for robust PCA using semidefinite programming
- The global convergence of a new mixed conjugate gradient method for unconstrained optimization
- W-methods in optimal control
- Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
- Reduced order optimal control of the convective FitzHugh-Nagumo equations
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- A stochastic subspace approach to gradient-free optimization in high dimensions
- Two limited-memory optimization methods with minimum violation of the previous secant conditions
- Truncated trust region method for nonlinear inverse problems and application in full-waveform inversion
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
- A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- 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
- An online conjugate gradient algorithm for large-scale data analysis in machine learning
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- LMBOPT: a limited memory method for bound-constrained optimization
- A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- Optimal scaling parameters for spectral conjugate gradient methods
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- A hybrid quasi-Newton method with application in sparse recovery
- An active set trust-region method for bound-constrained optimization
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- The projection technique for two open problems of unconstrained optimization problems
- A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration
- A survey of gradient methods for solving nonlinear optimization
- A novel value for the parameter in the Dai-Liao-type conjugate gradient method
- A class of accelerated subspace minimization conjugate gradient methods
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A modified conjugate gradient method for monotone nonlinear equations with convex constraints
- Optimal vaccination strategy for an SIRS model with imprecise parameters and Lévy noise
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- A conjugate gradient algorithm and its applications in image restoration
- Adaptive continuation solid isotropic material with penalization for volume constrained compliance minimization
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- A new conjugate gradient method with an efficient memory structure
- Scaled nonlinear conjugate gradient methods for nonlinear least squares problems
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- 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
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- A globally convergent hybrid conjugate gradient method and its numerical behaviors
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- Optimal control of convective FitzHugh-Nagumo equation
- A descent Dai-Liao conjugate gradient method for nonlinear equations
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- Adjoint-based optimization of PDEs in moving domains
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Self-adaptive inexact proximal point methods
- Some sufficient descent conjugate gradient methods and their global convergence
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A new family of conjugate gradient methods
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- Sufficient and necessary conditions of near-optimal controls for a diffusion dengue model with Lévy noise
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula
- On Hager and Zhang's conjugate gradient method with guaranteed descent
- Some modified conjugate gradient methods for unconstrained optimization
- Spectral method and its application to the conjugate gradient method
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence
- A descent hybrid modification of the Polak-Ribière-Polyak conjugate gradient method
- Rate of convergence of a restarted CG-DESCENT method
- A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- New conjugate gradient-like methods for unconstrained optimization
- A modified non-monotone BFGS method for non-convex unconstrained optimization
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)
