Restart procedures for the conjugate gradient method
From MaRDI portal
Publication:4180145
DOI10.1007/BF01593790zbMath0396.90072OpenAlexW2043382734WikidataQ56807458 ScholiaQ56807458MaRDI QIDQ4180145
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593790
Related Items (only showing first 100 items - show all)
Sufficient descent conjugate gradient methods for large-scale optimization problems ⋮ Bivariate negative binomial regression model with excess zeros and right censoring: an application to Indonesian data ⋮ Globally convergent conjugate gradient algorithms ⋮ Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization ⋮ A Global Optimum Approach for One-Layer Neural Networks ⋮ A family of hybrid conjugate gradient methods for unconstrained optimization ⋮ A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family ⋮ Unnamed Item ⋮ Parametric identification of a heating mobile source in a three-dimensional geometry ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ Two families of hybrid conjugate gradient methods with restart procedures and their applications ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ Practical perspectives on symplectic accelerated optimization ⋮ Simulating comparisons of different computing algorithms fitting zero-inflated Poisson models for zero abundant counts ⋮ A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ A Conjugate Gradient Method for Electronic Structure Calculations ⋮ Adaptive trust-region method on Riemannian manifold ⋮ Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization ⋮ Composite SAR imaging using sequential joint sparsity ⋮ A new subspace minimization conjugate gradient method for unconstrained minimization ⋮ A restart scheme for the memoryless BFGS method ⋮ Mathematical Analysis and Numerical Approximations of Density Functional Theory Models for Metallic Systems ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms ⋮ Clustered sparse structural equation modeling for heterogeneous data ⋮ Descent Properties of an Anderson Accelerated Gradient Method with Restarting ⋮ A scaled nonlinear conjugate gradient algorithm for unconstrained optimization ⋮ TV‐like regularization for backward parabolic problems ⋮ Unnamed Item ⋮ A modified Hestenes–Stiefel conjugate gradient method with an optimal property ⋮ A three-parameter family of nonlinear conjugate gradient methods ⋮ Unnamed Item ⋮ Hydraulic conductivity estimation in partially saturated soils using the adjoint method ⋮ On the method of shortest residuals for unconstrained optimization ⋮ On Conjugate Gradient Algorithms as Objects of Scientific Study ⋮ Scaled conjugate gradient algorithms for unconstrained optimization ⋮ GLOBAL CONVERGENCE OF TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH ⋮ Global convergence of the general three-term conjugate gradient methods with the relaxed strong Wolfe line-search ⋮ A modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimization ⋮ HARES: An efficient method for first-principles electronic structure calculations of complex systems ⋮ Readily implementable conjugate gradient methods ⋮ Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ An efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems ⋮ Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem ⋮ Modified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimization ⋮ Large-scale linearly constrained optimization ⋮ A combined conjugate-gradient quasi-Newton minimization algorithm ⋮ An efficient adaptive scaling parameter for the spectral conjugate gradient method ⋮ Extending the relationship between the conjugate gradient and BFGS algorithms ⋮ L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family ⋮ A sufficient descent conjugate gradient method and its global convergence ⋮ Optimization limits in improving system reliability ⋮ Convergence of conjugate gradient methods with constant stepsizes ⋮ Unnamed Item ⋮ Determination of thermal conductivity of inhomogeneous orthotropic materials from temperature measurements ⋮ Unnamed Item ⋮ A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization ⋮ Two hybrid nonlinear conjugate gradient methods based on a modified secant equation ⋮ The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems ⋮ Rate of Convergence of a Restarted CG-DESCENT Method ⋮ Simultaneous determination of time-varying strength and location of a heating source in a three-dimensional domain ⋮ Long-term optimization of hydro-thermal power systems by generalized Conjugate-Gradient Methods ⋮ QN-like variable storage conjugate gradients ⋮ Simultaneous estimation of the spacewise and timewise variations of mass and heat transfer coefficients in drying ⋮ Conjugate direction methods with variable storage ⋮ Regularization tools for training large feed-forward neural networks using automatic differentiation∗ ⋮ A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter ⋮ A fast and robust unconstrained optimization method requiring minimum storage ⋮ An H-form variant of the partitioned QN method ⋮ Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update ⋮ Simultaneous estimation of spatially dependent diffusion coefficient and source term in a nonlinear 1D diffusion problem ⋮ Some modified conjugate gradient methods for unconstrained optimization ⋮ Efficient boundary condition-enforced immersed boundary method for incompressible flows with moving boundaries ⋮ A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ A hybrid artificial bee colony optimizer by combining with life-cycle, Powell's search and crossover ⋮ Pyramidal classification based on incomplete dissimilarity data ⋮ CATSCALE: A stochastic multidimensional scaling methodology for the spatial analysis of sorting data and the study of stimulus categorization ⋮ A new version of the Liu-Storey conjugate gradient method ⋮ New hybrid conjugate gradient method as a convex combination of LS and FR methods ⋮ Heating source localization in a reduced time ⋮ A parametric procedure for ultrametric tree estimation from conditional rank order proximity data ⋮ Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods ⋮ Conjugate gradient methods in confirmatory factor analysis ⋮ Evaluation of neural networks and data mining methods on a credit assessment task for class imbalance problem ⋮ Family of projected descent methods for optimization problems with simple bounds ⋮ Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data ⋮ Compactly supported radial functions and the Strang-Fix condition ⋮ The convergence properties of some new conjugate gradient methods ⋮ Advances in artificial neural networks -- methodological development and application ⋮ Efficient hybrid conjugate gradient techniques ⋮ A descent extension of the Polak-Ribière-Polyak conjugate gradient method ⋮ Nonlinear analysis of shear deformable beam-columns partially supported on tensionless three-parameter foundation ⋮ A new smoothing spectral conjugate gradient method for solving tensor complementarity problems ⋮ Adaptive restart of the optimized gradient method for convex optimization ⋮ New conjugacy condition and related new conjugate gradient methods for unconstrained optimization ⋮ A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines ⋮ A convergent dynamic method for large minimization problems ⋮ A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ Symmetric Perry conjugate gradient method
Cites Work
This page was built for publication: Restart procedures for the conjugate gradient method
