Pages that link to "Item:Q4180145"

The following pages link to Restart procedures for the conjugate gradient method (Q4180145):

Displaying 50 items.

• Convergence properties of the Beale-Powell restart algorithm (Q1286637) (← links)
• A class of nonmonotone conjugate gradient methods for unconstrained optimization (Q1293956) (← links)
• Constructing optimal ultrametrics (Q1314829) (← links)
• Generalized Polak-Ribière algorithm (Q1321261) (← links)
• Pyramidal classification based on incomplete dissimilarity data (Q1344856) (← links)
• Conjugate gradient methods in confirmatory factor analysis (Q1361523) (← links)
• Family of projected descent methods for optimization problems with simple bounds (Q1364228) (← links)
• Compactly supported radial functions and the Strang-Fix condition (Q1368918) (← links)
• Maximum likelihood parameter estimation in the three-parameter log-normal distribution using the continuation method (Q1392033) (← links)
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
• An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies. (Q1406655) (← links)
• A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
• Advances in artificial neural networks -- methodological development and application (Q1662505) (← links)
• Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
• A modified conjugacy condition and related nonlinear conjugate gradient method (Q1718989) (← links)
• A hybrid of DL and WYL nonlinear conjugate gradient methods (Q1723746) (← links)
• The hybrid BFGS-CG method in solving unconstrained optimization problems (Q1724270) (← links)
• A new supermemory gradient method for unconstrained optimization problems (Q1758038) (← links)
• A new descent algorithm with curve search rule (Q1764727) (← links)
• Computational issues of importance to the inverse recovery of epicardial potentials in a realistic heart-torso geometry (Q1823179) (← links)
• Vectorization of conjugate-gradient methods for large-scale minimization in meteorology (Q1823863) (← links)
• An H-form variant of the partitioned QN method (Q1873167) (← links)
• Simultaneous estimation of spatially dependent diffusion coefficient and source term in a nonlinear 1D diffusion problem (Q1877749) (← links)
• CATSCALE: A stochastic multidimensional scaling methodology for the spatial analysis of sorting data and the study of stimulus categorization (Q1896215) (← links)
• A parametric procedure for ultrametric tree estimation from conditional rank order proximity data (Q1901372) (← links)
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
• A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
• Surrogate-assisted classification-collaboration differential evolution for expensive constrained optimization problems (Q1999087) (← links)
• A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q2017614) (← links)
• A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update (Q2052328) (← links)
• Simultaneous recovery of surface heat flux and thickness of a solid structure by ultrasonic measurements (Q2055151) (← links)
• A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
• Efficient boundary condition-enforced immersed boundary method for incompressible flows with moving boundaries (Q2131023) (← links)
• New hybrid conjugate gradient method as a convex combination of LS and FR methods (Q2150719) (← links)
• A new smoothing spectral conjugate gradient method for solving tensor complementarity problems (Q2171089) (← links)
• A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations (Q2189341) (← links)
• Two-step conjugate gradient method for unconstrained optimization (Q2204167) (← links)
• Optimization for deep learning: an overview (Q2218095) (← links)
• Explicit topology optimization of novel polyline-based core sandwich structures using surrogate-assisted evolutionary algorithm (Q2236156) (← links)
• Hierarchical multinomial processing tree models: a latent-class approach (Q2260951) (← links)
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
• Efficient generalized conjugate gradient algorithms. II: Implementation (Q2277157) (← links)
• Improved biogeography-based optimization with random ring topology and Powell's method (Q2284474) (← links)
• Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization (Q2299208) (← links)
• A new hybrid algorithm for convex nonlinear unconstrained optimization (Q2337034) (← links)
• A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization (Q2346397) (← links)
• A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
• Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update (Q2359995) (← links)
• A new version of the Liu-Storey conjugate gradient method (Q2381321) (← links)
• A descent extension of the Polak-Ribière-Polyak conjugate gradient method (Q2400710) (← links)