CG_DESCENT

swMATH4813MaRDI QIDQ16975FDOQ16975

Author name not available (Why is that?)

Described by source

• Algorithm 851

Cited In (only showing first 100 items - show all)

• 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
• 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
• Spectral method and its application to the conjugate gradient method
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• Numerical methods for large-scale nonlinear optimization
• On Hager and Zhang's conjugate gradient method with guaranteed descent
• The convergence of conjugate gradient method with nonmonotone line search
• Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems
• 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
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Quasi-Newton acceleration for equality-constrained minimization
• Two adaptive Dai-Liao nonlinear conjugate gradient methods
• Some modified conjugate gradient methods for unconstrained optimization
• The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
• Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
• An optimal parameter for Dai-Liao family of conjugate gradient methods
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
• A modified nonmonotone trust region line search method
• Optimal control of convective FitzHugh-Nagumo equation
• Recent Advances in Bound Constrained Optimization
• 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
• Two modified scaled nonlinear conjugate gradient methods
• A conjugate gradient method for unconstrained optimization problems
• The global convergence of a descent PRP conjugate gradient method
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
• Second-order adjoints for solving PDE-constrained optimization problems
• A new family of conjugate gradient methods
• Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
• The Limited Memory Conjugate Gradient Method
• Two proposals for robust PCA using semidefinite programming
• An efficient multigrid strategy for large-scale molecular mechanics optimization
• A simple sufficient descent method for unconstrained optimization
• Two accelerated nonmonotone adaptive trust region line search methods
• A descent Dai-Liao conjugate gradient method for nonlinear equations
• Two modified three-term conjugate gradient methods with sufficient descent property
• Numerical Methods for Electronic Structure Calculations of Materials
• Adjoint-based optimization of PDEs in moving domains
• On the sufficient descent condition of the Hager-Zhang conjugate gradient methods
• Self-adaptive inexact proximal point methods
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• A new nonmonotone line search technique for unconstrained optimization
• A descent extension of the Polak-Ribière-Polyak conjugate gradient method
• An adaptive conjugate gradient algorithm for large-scale unconstrained optimization
• Norm descent conjugate gradient methods for solving symmetric nonlinear equations
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• 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
• Title not available (Why is that?)
• A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
• A New Active Set Algorithm for Box Constrained Optimization
• An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
• Inexact restoration method for minimization problems arising in electronic structure calculations
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization
• Symmetric Perry conjugate gradient method
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
• On optimality of two adaptive choices for the parameter of Dai-Liao method
• A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
• CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method
• Dai-Kou type conjugate gradient methods with a line search only using gradient
• A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
• A modified three-term PRP conjugate gradient algorithm for optimization models
• Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations
• An efficient hybrid conjugate gradient method for unconstrained optimization
• Title not available (Why is that?)
• 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
• A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
• 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 Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ₁regularized problem
• A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
• A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
• An efficient adaptive scaling parameter for the spectral conjugate gradient method
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
• The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations
• A conjugate gradient algorithm and its applications in image restoration
• Title not available (Why is that?)
• INITIAL IMPROVEMENT OF THE HYBRID ACCELERATED GRADIENT DESCENT PROCESS
• A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique
• A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
• Conjugate gradient methods using value of objective function for unconstrained optimization
• Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
• Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
• An improved Perry conjugate gradient method with adaptive parameter choice
• Preconditioned nonlinear conjugate gradient methods based on a modified secant equation

This page was built for software: CG_DESCENT