The following pages link to (Q4016506):
Displaying 50 items.
- Convergence and stability of line search methods for unconstrained optimization (Q385584) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- A note on Kantorovich inequality for Hermite matrices (Q535503) (← links)
- Nonmonotone adaptive trust region method (Q621656) (← links)
- New quasi-Newton methods via higher order tensor models (Q629502) (← links)
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization (Q651495) (← links)
- A new class of nonmonotone conjugate gradient training algorithms (Q669374) (← links)
- An adaptive scaled BFGS method for unconstrained optimization (Q684183) (← links)
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method (Q869834) (← links)
- A new conjugate gradient algorithm for training neural networks based on a modified secant equation (Q905328) (← links)
- Convergence of PRP method with new nonmonotone line search (Q945382) (← links)
- A modified PRP conjugate gradient method (Q1026553) (← links)
- A new trust region method with adaptive radius (Q1029622) (← links)
- A class of nonmonotone conjugate gradient methods for unconstrained optimization (Q1293956) (← links)
- Modifying the BFGS method (Q1362522) (← links)
- How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Sequential quadratic programming for large-scale nonlinear optimization (Q1593815) (← links)
- A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
- Approximate Hessian for accelerated convergence of aerodynamic shape optimization problems in an adjoint-based framework (Q1649882) (← 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)
- A direct proof and a generalization for a Kantorovich type inequality (Q1774968) (← links)
- Convergence of line search methods for unconstrained optimization (Q1881700) (← links)
- Convergence and numerical results for a parallel asynchronous quasi- Newton method (Q1893309) (← links)
- Using function-values in multi-step quasi-Newton methods (Q1919371) (← links)
- On conjugate gradient-like methods for eigen-like problems (Q1923871) (← links)
- Smoothing methods for convex inequalities and linear complementarity problems (Q1924058) (← links)
- A perfect example for the BFGS method (Q1949264) (← links)
- A class of gradient unconstrained minimization algorithms with adaptive stepsize (Q1970409) (← links)
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
- A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control (Q2029652) (← links)
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity (Q2060902) (← links)
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization (Q2125037) (← links)
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
- Diagonal approximation of the Hessian by finite differences for unconstrained optimization (Q2188948) (← links)
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization (Q2190850) (← links)
- The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
- A Hessian-free Newton-Raphson method for the configuration of physics systems featured by numerically asymmetric force field (Q2229103) (← links)
- A regularized limited memory BFGS method for nonconvex unconstrained minimization (Q2248965) (← links)
- A method of trust region type for minimizing noisy functions (Q2365378) (← links)
- A new robust line search technique based on Chebyshev polynomials (Q2378711) (← links)
- A new version of the Liu-Storey conjugate gradient method (Q2381321) (← links)
- The convergence of subspace trust region methods (Q2389569) (← links)
- A preconditioned descent algorithm for variational inequalities of the second kind involving the \(p\)-Laplacian operator (Q2397095) (← links)
- A diagonal quasi-Newton updating method for unconstrained optimization (Q2420159) (← links)
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties (Q2453184) (← links)
- Improved sign-based learning algorithm derived by the composite nonlinear Jacobi process (Q2488877) (← links)
- On step-size estimation of line search methods (Q2489176) (← links)
