Pages that link to "Item:Q5619730"

The following pages link to Convergence Conditions for Ascent Methods. II: Some Corrections (Q5619730):

Displaying 50 items.

• Convergence of conjugate gradient methods with a closed-form stepsize formula (Q1956466) (← links)
• A class of gradient unconstrained minimization algorithms with adaptive stepsize (Q1970409) (← links)
• Hybrid Riemannian conjugate gradient methods with global convergence properties (Q2023690) (← links)
• An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem (Q2036061) (← links)
• A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems (Q2043170) (← links)
• Sufficient descent Riemannian conjugate gradient methods (Q2046556) (← links)
• A new accelerated conjugate gradient method for large-scale unconstrained optimization (Q2068094) (← links)
• A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems (Q2072782) (← links)
• A hybrid-line-and-curve search globalization technique for inexact Newton methods (Q2073945) (← links)
• Adaptive machine learning-based surrogate modeling to accelerate PDE-constrained optimization in enhanced oil recovery (Q2095535) (← links)
• Pseudospectral methods and iterative solvers for optimization problems from multiscale particle dynamics (Q2100558) (← links)
• Gaussian process regression for maximum entropy distribution (Q2124600) (← links)
• Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization (Q2125037) (← links)
• Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property (Q2129100) (← links)
• A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
• Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions (Q2163450) (← links)
• Diagonal approximation of the Hessian by finite differences for unconstrained optimization (Q2188948) (← links)
• New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method (Q2190791) (← links)
• A double parameter self-scaling memoryless BFGS method for unconstrained optimization (Q2190850) (← links)
• Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case (Q2216178) (← links)
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
• Spectral three-term constrained conjugate gradient algorithm for function minimizations (Q2294136) (← links)
• Dynamic search trajectory methods for global optimization (Q2294590) (← links)
• A class of globally convergent three-term Dai-Liao conjugate gradient methods (Q2301403) (← links)
• Simultaneous reconstruction of the perfusion coefficient and initial temperature from time-average integral temperature measurements (Q2307282) (← links)
• A new hybrid algorithm for convex nonlinear unconstrained optimization (Q2337034) (← links)
• Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update (Q2359995) (← links)
• Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization (Q2390003) (← links)
• A diagonal quasi-Newton updating method for unconstrained optimization (Q2420159) (← links)
• Scaled conjugate gradient algorithms for unconstrained optimization (Q2477015) (← links)
• Self-adaptive inexact proximal point methods (Q2479838) (← links)
• Improved sign-based learning algorithm derived by the composite nonlinear Jacobi process (Q2488877) (← links)
• Convergence of nonmonotone line search method (Q2493941) (← links)
• Some sufficient descent conjugate gradient methods and their global convergence (Q2514055) (← links)
• A recalling-enhanced recurrent neural network: conjugate gradient learning algorithm and its convergence analysis (Q2660959) (← links)
• Stochastic quasi-Newton with line-search regularisation (Q2664231) (← links)
• Constrained neural network training and its application to hyperelastic material modeling (Q2667314) (← links)
• A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems (Q2671105) (← links)
• A modified conjugate gradient method based on the self-scaling memoryless BFGS update (Q2672717) (← links)
• A link between the steepest descent method and fixed-point iterations (Q2678996) (← links)
• Assimilating data on the location of the free surface of a fluid flow to determine its viscosity (Q2689290) (← links)
• A sufficient descent Liu–Storey conjugate gradient method and its global convergence (Q2808326) (← links)
• Projection onto a Polyhedron that Exploits Sparsity (Q2817841) (← links)
• A subclass of generating set search with convergence to second-order stationary points (Q2926059) (← links)
• Constrained optimal control of switched systems based on modified BFGS algorithm and filled function method (Q2935389) (← links)
• New conjugate gradient method for unconstrained optimization (Q2954367) (← links)
• A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization (Q2957702) (← links)
• A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION (Q3148358) (← links)
• STUDYING THE BASIN OF CONVERGENCE OF METHODS FOR COMPUTING PERIODIC ORBITS (Q3165821) (← links)
• Optimal control of bioprocess systems using hybrid numerical optimization algorithms (Q3177634) (← links)