Pages that link to "Item:Q5566849"
From MaRDI portal
The following pages link to Convergence Conditions for Ascent Methods (Q5566849):
Displaying 50 items.
- Some numerical experiments with variable-storage quasi-Newton algorithms (Q909585) (← links)
- A tolerant algorithm for linearly constrained optimization calculations (Q910337) (← links)
- Convergence of PRP method with new nonmonotone line search (Q945382) (← links)
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule (Q949372) (← links)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization (Q989146) (← links)
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems (Q1004008) (← links)
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
- A truncated descent HS conjugate gradient method and its global convergence (Q1036485) (← links)
- An efficient line search for nonlinear least squares (Q1057187) (← links)
- Stepsize analysis for descent methods (Q1133148) (← links)
- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms (Q1138482) (← links)
- Solution of eigenvalue problems in Hilbert spaces by a gradient method (Q1226375) (← links)
- Convergence proof of minimization algorithms for nonconvex functions (Q1232247) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- Numerically stable computation of step-sizes for descent methods. The nonconvex case (Q1241019) (← links)
- Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben (Q1242859) (← links)
- A comparison of nonlinear optimization methods for supervised learning in multilayer feedforward neural networks (Q1268172) (← links)
- Convergence properties of the Beale-Powell restart algorithm (Q1286637) (← links)
- MERLIN-3. 0. A multidimensional optimization environment (Q1299612) (← links)
- Modifying the BFGS update by a new column scaling technique (Q1338135) (← links)
- Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization (Q1384067) (← links)
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization (Q1411546) (← links)
- Convergence of implementable descent algorithms for unconstrained optimization (Q1573997) (← links)
- Direct search methods: Then and now (Q1593826) (← links)
- A robust descent type algorithm for geophysical inversion through adaptive regularization (Q1614201) (← links)
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
- Useful redundancy in parameter and time delay estimation for continuous-time models (Q1626931) (← links)
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization (Q1644524) (← links)
- A note on the Morozov principle via Lagrange duality (Q1653323) (← links)
- A class of one parameter conjugate gradient methods (Q1664259) (← links)
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search (Q1664598) (← links)
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization (Q1665439) (← links)
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization (Q1670017) (← links)
- A double parameter scaled BFGS method for unconstrained optimization (Q1677470) (← links)
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix (Q1677473) (← links)
- On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery (Q1701931) (← links)
- Accelerated double direction method for solving unconstrained optimization problems (Q1719483) (← links)
- A novel fractional Tikhonov regularization coupled with an improved super-memory gradient method and application to dynamic force identification problems (Q1720969) (← links)
- The hybrid BFGS-CG method in solving unconstrained optimization problems (Q1724270) (← links)
- Convergence rate of descent method with new inexact line-search on Riemannian manifolds (Q1730772) (← links)
- Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
- Fully implicit simulation of polymer flooding with MRST (Q1785143) (← links)
- On obtaining optimal well rates and placement for CO\(_2\) storage (Q1785164) (← links)
- The revised DFP algorithm without exact line search (Q1811670) (← links)
- A globalization procedure for solving nonlinear systems of equations (Q1815701) (← links)
- Pseudorandom lattices for global optimization (Q1827238) (← links)
- From linear to nonlinear iterative methods (Q1873166) (← links)
