Restart procedures for the conjugate gradient method
From MaRDI portal
Publication:4180145
DOI10.1007/BF01593790zbMATH Open0396.90072OpenAlexW2043382734WikidataQ56807458 ScholiaQ56807458MaRDI QIDQ4180145FDOQ4180145
Authors: M. J. D. Powell
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593790
Cites Work
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some convergence properties of the conjugate gradient method
- Linear Convergence of the Conjugate Gradient Method
Cited In (only showing first 100 items - show all)
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- A new hybrid algorithm for convex nonlinear unconstrained optimization
- Global convergence of the Dai-Yuan conjugate gradient method with perturbations
- Convergence of conjugate gradient methods with constant stepsizes
- Title not available (Why is that?)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- A new approach for shape preserving interpolating curves
- Convergence properties of the Beale-Powell restart algorithm
- The convergence properties of some new conjugate gradient methods
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- A new supermemory gradient method for unconstrained optimization problems
- A modified PRP conjugate gradient method
- Some modified conjugate gradient methods for unconstrained optimization
- Efficient hybrid conjugate gradient techniques
- A new version of the Liu-Storey conjugate gradient method
- Composite SAR imaging using sequential joint sparsity
- Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
- Globally convergent modified Perry's conjugate gradient method
- 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
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- A hybrid artificial bee colony optimizer by combining with life-cycle, Powell's search and crossover
- Scaled conjugate gradient algorithms for unconstrained optimization
- A modified Perry conjugate gradient method and its global convergence
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Global convergence of two kinds of three-term conjugate gradient methods without line search
- A conjugate gradient method for unconstrained optimization problems
- 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
- 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 class of efficient and globally convergent conjugate gradient methods in the Dai-Liao family
- Hydraulic conductivity estimation in partially saturated soils using the adjoint method
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Large-scale linearly constrained optimization
- Two new conjugate gradient methods based on modified secant equations
- Conjugate direction methods with variable storage
- A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations
- Heating source localization in a reduced time
- QN-like variable storage conjugate gradients
- Simultaneous determination of time-varying strength and location of a heating source in a three-dimensional domain
- A conjugate gradient method for electronic structure calculations
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Evaluation of neural networks and data mining methods on a credit assessment task for class imbalance problem
- Sufficient descent conjugate gradient methods for large-scale optimization problems
- Compactly supported radial functions and the Strang-Fix condition
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- A three-parameter family of nonlinear conjugate gradient methods
- A family of hybrid conjugate gradient methods for unconstrained optimization
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- Partitioned variable metric updates for large structured optimization problems
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Extending the relationship between the conjugate gradient and BFGS algorithms
- Simultaneous estimation of the spacewise and timewise variations of mass and heat transfer coefficients in drying
- Simultaneous estimation of spatially dependent diffusion coefficient and source term in a nonlinear 1D diffusion problem
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- Damped Anderson Acceleration With Restarts and Monotonicity Control for Accelerating EM and EM-like Algorithms
- Nonlinear analysis of shear deformable beam-columns partially supported on tensionless three-parameter foundation
- On the limited memory BFGS method for large scale optimization
- Symmetric Perry conjugate gradient method
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Family of projected descent methods for optimization problems with simple bounds
- New spectral PRP conjugate gradient method for unconstrained optimization
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
- A limited memory descent Perry conjugate gradient method
- On the method of shortest residuals for unconstrained optimization
- Interval type-2 fuzzy weight adjustment for backpropagation neural networks with application in time series prediction
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- The convergence rate of a restart MFR conjugate gradient method with inexact line search
- Some numerical experiments with variable-storage quasi-Newton algorithms
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- A stochastic multidimensional unfolding approach for representing phased decision outcomes
- On the numerical solution of nonlinear problems in fluid dynamics by least squares and finite element methods. I. Least square formulations and conjugate gradient solution of the continuous problems
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Pyramidal classification based on incomplete dissimilarity data
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- Efficient generalized conjugate gradient algorithms. II: Implementation
- Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
- Efficient boundary condition-enforced immersed boundary method for incompressible flows with moving boundaries
- Title not available (Why is that?)
- 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
- Advances in artificial neural networks -- methodological development and application
- Surrogate-assisted classification-collaboration differential evolution for expensive constrained optimization problems
- An H-form variant of the partitioned QN method
- A solution method for nonlinear monotone equations via hybrid spectral conjugate gradient and signal recovery problems
- 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 new subspace minimization conjugate gradient method for unconstrained minimization
- Practical perspectives on symplectic accelerated optimization
- Simulating comparisons of different computing algorithms fitting zero-inflated Poisson models for zero abundant counts
- HARES: An efficient method for first-principles electronic structure calculations of complex systems
- Vectorization of conjugate-gradient methods for large-scale minimization in meteorology
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)