Restart procedures for the conjugate gradient method
From MaRDI portal
Publication:4180145
Cites work
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- Linear Convergence of the Conjugate Gradient Method
- Some convergence properties of the conjugate gradient method
Cited in
(only showing first 100 items - show all)- A Lagrange-Newton algorithm for sparse nonlinear programming
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- Pyramidal classification based on incomplete dissimilarity data
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- A new hybrid algorithm for convex nonlinear unconstrained optimization
- Global convergence of the Dai-Yuan conjugate gradient method with perturbations
- Efficient generalized conjugate gradient algorithms. II: Implementation
- Efficient boundary condition-enforced immersed boundary method for incompressible flows with moving boundaries
- Convergence of conjugate gradient methods with constant stepsizes
- Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
- Advances in artificial neural networks -- methodological development and application
- Inverse coefficient problem for the coupled system of fourth and second order partial differential equations
- An accelerated relaxed-inertial strategy based CGP algorithm with restart technique for constrained nonlinear pseudo-monotone equations to image de-blurring problems
- scientific article; zbMATH DE number 4009671 (Why is no real title available?)
- Surrogate-assisted classification-collaboration differential evolution for expensive constrained optimization problems
- A new approach for shape preserving interpolating curves
- An H-form variant of the partitioned QN method
- Convergence properties of the Beale-Powell restart algorithm
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- The convergence properties of some new conjugate gradient methods
- An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies.
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- A solution method for nonlinear monotone equations via hybrid spectral conjugate gradient and signal recovery problems
- Vectorization of conjugate-gradient methods for large-scale minimization in meteorology
- A modified PRP conjugate gradient method
- A new supermemory gradient method for unconstrained optimization problems
- Simulating comparisons of different computing algorithms fitting zero-inflated Poisson models for zero abundant counts
- A new subspace minimization conjugate gradient method for unconstrained minimization
- Some modified conjugate gradient methods for unconstrained optimization
- Practical perspectives on symplectic accelerated optimization
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- HARES: An efficient method for first-principles electronic structure calculations of complex systems
- Efficient hybrid conjugate gradient techniques
- A modified Hestenes-Stiefel conjugate gradient method with an optimal property
- A new version of the Liu-Storey conjugate gradient method
- An efficient adaptive scaling parameter for the spectral conjugate gradient method
- Globally convergent modified Perry's conjugate gradient method
- A conjugate gradient projection method with restart procedure for solving constraint equations and image restorations
- Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
- Composite SAR imaging using sequential joint sparsity
- Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods
- Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- scientific article; zbMATH DE number 179183 (Why is no real title available?)
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- On Conjugate Gradient Algorithms as Objects of Scientific Study
- Nonlinear conjugate gradient for smooth convex functions
- Improved biogeography-based optimization with random ring topology and Powell's method
- A hybrid artificial bee colony optimizer by combining with life-cycle, Powell's search and crossover
- Scaled conjugate gradient algorithms for unconstrained optimization
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- Hierarchical multinomial processing tree models: a latent-class approach
- A family of spectral conjugate gradient methods with strong convergence and its applications in image restoration and machine learning
- TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model
- Globally convergent conjugate gradient algorithms
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- A modified Perry conjugate gradient method and its global convergence
- Parametric identification of a heating mobile source in a three-dimensional geometry
- Global convergence of the general three-term conjugate gradient methods with the relaxed strong Wolfe line-search
- A new smoothing spectral conjugate gradient method for solving tensor complementarity problems
- Modified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimization
- TV-like regularization for backward parabolic problems
- A conjugate gradient method for unconstrained optimization problems
- A combined conjugate-gradient quasi-Newton minimization algorithm
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Extended conjugate-gradient methods with restarts
- A new three-term conjugate gradient method
- A fast nonlinear conjugate gradient based method for 3D concentrated frictional contact problems
- Readily implementable conjugate gradient methods
- Global convergence of two kinds of three-term conjugate gradient methods without line search
- A restart scheme for the memoryless BFGS method
- A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
- Maximum likelihood parameter estimation in the three-parameter log-normal distribution using the continuation method
- A convergent dynamic method for large minimization problems
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- Explicit topology optimization of novel polyline-based core sandwich structures using surrogate-assisted evolutionary algorithm
- Optimization limits in improving system reliability
- A new class of efficient and globally convergent conjugate gradient methods in the Dai-Liao family
- Computational experience with conjugate gradient algorithms
- Hydraulic conductivity estimation in partially saturated soils using the adjoint method
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Hybrid Hu-Storey type methods for large-scale nonlinear monotone systems and signal recovery
- Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
- Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations
- Two new conjugate gradient methods based on modified secant equations
- Global convergence of conjugate gradient method in unconstrained optimization problems
- Large-scale linearly constrained optimization
- Generalized Polak-Ribière algorithm
- An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
- A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- Rate of convergence of a restarted CG-DESCENT method
- A new descent algorithm with curve search rule
- Conjugate direction methods with variable storage
- Heating source localization in a reduced time
- Some computational advances in unconstrained optimization
This page was built for publication: Restart procedures for the conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180145)
