Conjugate Gradient Methods with Inexact Searches
From MaRDI portal
Publication:4184635
Cited in
(only showing first 100 items - show all)- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- Planar quasi-Newton algorithms for unconstrained saddlepoint problems
- Computational experience with conjugate gradient algorithms
- Some computational advances in unconstrained optimization
- Accelerated solution techniques and concrete cracking
- Minimization of extended quadratic functions
- Tracing post-limit-point paths with incomplete or without factorization of the stiffness matrix
- A numerical method for an approximate minimax estimator in linear regression
- Modelling the otolith membrane using boundary-fitted coordinates
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A double parameter scaled BFGS method for unconstrained optimization
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- Vectorization of conjugate-gradient methods for large-scale minimization in meteorology
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
- On the sufficient descent property of the Shanno's conjugate gradient method
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
- The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems
- Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
- A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications
- A hybrid approach for finding approximate solutions to constrained nonlinear monotone operator equations with applications
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
- A conjugate gradient sampling method for nonsmooth optimization
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- Scaled nonlinear conjugate gradient methods for nonlinear least squares problems
- 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 scaled three-term conjugate gradient method for unconstrained optimization
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- Formulation and numerical solution of finite-level quantum optimal control problems
- Some sufficient descent conjugate gradient methods and their global convergence
- An adaptive direct variational grid generation method
- A modified conjugate gradient method based on the self-scaling memoryless BFGS update
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula
- A three-parameter family of nonlinear conjugate gradient methods
- New three-term conjugate gradient method with guaranteed global convergence
- New conjugate gradient method for unconstrained optimization
- Optimal control of a class of piecewise deterministic processes
- A new family of globally convergent conjugate gradient methods
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
- Inverse determination of a heat source from natural convection in a porous cavity
- scientific article; zbMATH DE number 3812857 (Why is no real title available?)
- QN-like variable storage conjugate gradients
- A fast and robust unconstrained optimization method requiring minimum storage
- Globally convergent conjugate gradient algorithms
- The method of successive affine reduction for nonlinear minimization
- Symmetric Perry conjugate gradient method
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
- Some numerical methods for the study of the convexity notions arising in the calculus of variations
- On Variable-Metric Methods for Sparse Hessians
- Two modified scaled nonlinear conjugate gradient methods
- The application of optimal control methodology to nonlinear programming problems
- Conjugate direction methods with variable storage
- Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization
- A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei
- Globally convergence of nonlinear conjugate gradient method for unconstrained optimization
- A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A three-dimensional numerical internal tidal model involving adjoint method
- Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem
- Calibration of Lévy processes using optimal control of Kolmogorov equations with periodic boundary conditions
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Wolfe line search
- An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- Modeling and control through leadership of a refined flocking system
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
- A new two-parameter family of nonlinear conjugate gradient methods
- An adaptive competitive penalty method for nonsmooth constrained optimization
- Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- A practical method for solving large-scale TRS
- A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function
- Applying powell's symmetrical technique to conjugate gradient methods
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Some descent three-term conjugate gradient methods and their global convergence
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation
- New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters
- A new nonmonotone line search technique for unconstrained optimization
- HARES: An efficient method for first-principles electronic structure calculations of complex systems
- A gradient-related algorithm with inexact line searches
- An adaptive modified three-term conjugate gradient method with global convergence
- Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization
- A restart scheme for the memoryless BFGS method
- A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery
- A new hybrid three-term LS-CD conjugate gradient in solving unconstrained optimization problems
- A hybrid BFGS-like method for monotone operator equations with applications
This page was built for publication: Conjugate Gradient Methods with Inexact Searches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184635)
