A survey of gradient methods for solving nonlinear optimization
From MaRDI portal
Recommendations
- A survey of sufficient descent conjugate gradient methods for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- Nonlinear conjugate gradient methods for unconstrained optimization
- scientific article; zbMATH DE number 2063453
- A new modification of nonlinear conjugate gradient formula
Cites work
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 2063453 (Why is no real title available?)
- scientific article; zbMATH DE number 2064428 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- 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 Nonmonotone Line Search Technique for Newton’s Method
- A Picard-Mann hybrid iterative process
- A Two-Term PRP-Based Descent Method
- A brief survey of methods for solving nonlinear least-squares problems
- A class of globally convergent conjugate gradient methods
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- A class on nonmonotone stabilization methods in unconstrained optimization
- A classification of quasi-Newton methods
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- A conjugate gradient algorithm and its applications in image restoration
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A conjugate gradient method with global convergence for large-scale unconstrained optimization problems
- A continuous-time approach to online optimization
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- A global convergence of LS-CD hybrid conjugate gradient method
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- A new class of efficient and globally convergent conjugate gradient methods in the Dai-Liao family
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- A new reprojection of the conjugate directions
- A new stepsize for the steepest descent method
- A new type of quasi-Newton updating formulas based on the new quasi-Newton equation
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A note about WYL's conjugate gradient method and its applications
- A note on hybridization process applied on transformed double step size model
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- A projection method for convex constrained monotone nonlinear equations with applications
- A risk minimization problem for finite horizon semi-Markov decision processes with loss rates
- A sufficient descent conjugate gradient method and its global convergence
- A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations
- A survey of nonlinear conjugate gradient methods
- A survey of sufficient descent conjugate gradient methods for unconstrained optimization
- A transformation of accelerated double step size method for unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Accelerated double direction method for solving unconstrained optimization problems
- Accelerated gradient descent methods with line search
- Algorithm 851
- Algorithms for nonlinear constraints that use lagrangian functions
- Alternate minimization gradient method
- An accelerated double step size model in unconstrained optimization
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- An efficient hybrid conjugate gradient method for unconstrained optimization
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- An unconstrained optimization test functions collection
- Analysis of monotone gradient methods
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- Applications of the conjugate gradient method in optimal surface parameterizations
- Approximate greatest descent in neural network optimization
- Benchmarking optimization software with performance profiles.
- CUTE
- Computation of \(\{2,4\}\) and \(\{2,3\}\)-inverses based on rank-one updates
- Computing \(\{2,4\}\) and \(\{2,3\}\)-inverses by using the Sherman-Morrison formula
- Convergence Conditions for Ascent Methods
- Convergence analysis of a modified BFGS method on convex minimizations
- Convergence of line search methods for unconstrained optimization
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- 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
- Fixed Points by a New Iteration Method
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- Global convergence result for conjugate gradient methods
- Hybrid modification of accelerated double direction method
- Hybridization of accelerated gradient descent method
- Identification of Hessian matrix in distributed gradient-based multi-agent coordination control systems
- Initial improvement of the hybrid accelerated gradient descent process
- Introduction to Unconstrained Optimization with R
- Mean Value Methods in Iteration
- Methods of conjugate gradients for solving linear systems
- Minimization of functions having Lipschitz continuous first partial derivatives
- Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization
- Modified two-point stepsize gradient methods for unconstrained optimization
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- New quasi-Newton methods for unconstrained optimization problems
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Nonlinear conjugate gradient methods for unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Numerical Optimization
- On Steepest Descent
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
- On the Barzilai and Borwein choice of steplength for the gradient method
- Optimization theory and methods. Nonlinear programming
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- Scalar correction method for solving large scale unconstrained minimization problems
- Semi-local convergence of the Newton-HSS method under the center Lipschitz condition
- Stepsize analysis for descent methods
- Survey of derivative-free optimization
- Technical Note—A Modified Conjugate Gradient Algorithm
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- The application of quasi-Newton methods in fluid mechanics
- The conjugate gradient method in extremal problems
- The convergence properties of some new conjugate gradient methods
- Two modifications of the method of the multiplicative parameters in descent gradient methods
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- Two-Point Step Size Gradient Methods
- R-linear convergence of the Barzilai and Borwein gradient method
Cited in
(10)- scientific article; zbMATH DE number 5511136 (Why is no real title available?)
- An inertial Dai-Liao conjugate method for convex constrained monotone equations that avoids the direction of maximum magnification
- Solving nonlinear equations with a direct Broyden method and its acceleration
- An accelerated spectral CG based algorithm for optimization techniques on Riemannian manifolds and its comparative evaluation
- An improved spectral CG method based on Dai–Liao conjugacy condition and quasi-Newton direction
- An accelerated gradient descent method based on a non-monotone backtracking line search scheme for unconstrained optimization and image restoration problems.
- Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
- Adaptive neural network surrogate model for solving the implied volatility of time-dependent American option via Bayesian inference
- scientific article; zbMATH DE number 2084877 (Why is no real title available?)
This page was built for publication: A survey of gradient methods for solving nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220680)
