Pages that link to "Item:Q4521380"

The following pages link to Exploiting negative curvature directions in linesearch methods for unconstrained optimization (Q4521380):

Displaying 29 items.

• Preconditioning Newton-Krylov methods in nonconvex large scale optimization (Q377728) (← links)
• Combining and scaling descent and negative curvature directions (Q543412) (← links)
• A curvilinear method based on minimal-memory BFGS updates (Q711340) (← links)
• A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
• Improving directions of negative curvature in an efficient manner (Q1026565) (← links)
• Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems (Q1673895) (← links)
• Using negative curvature in solving nonlinear programs (Q1694388) (← links)
• Conjugate direction methods and polarity for quadratic hypersurfaces (Q1695819) (← links)
• Optimal quotients for solving large eigenvalue problems (Q1731607) (← links)
• A likelihood-based boosting algorithm for factor analysis models with binary data (Q2076167) (← links)
• Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
• Iterative grossone-based computation of negative curvature directions in large-scale optimization (Q2194128) (← links)
• A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
• A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654) (← links)
• A framework of conjugate direction methods for symmetric linear systems in optimization (Q2342136) (← links)
• Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
• Exploiting negative curvature in deterministic and stochastic optimization (Q2425164) (← links)
• Iterative computation of negative curvature directions in large scale optimization (Q2457949) (← links)
• Nonconvex optimization using negative curvature within a modified linesearch (Q2482748) (← links)
• Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory (Q2569193) (← links)
• Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application (Q2569194) (← links)
• A curvilinear search algorithm for unconstrained optimization by automatic differentiation (Q2770192) (← links)
• A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
• A symmetric rank-one quasi-Newton line-search method using negative curvature directions (Q3093055) (← links)
• Adaptive Quadratically Regularized Newton Method for Riemannian Optimization (Q3176355) (← links)
• Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks (Q4657813) (← links)
• The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations (Q5268935) (← links)
• A dwindling filter line search method for unconstrained optimization (Q5497020) (← links)
• Adaptive nonmonotone line search method for unconstrained optimization (Q6059117) (← links)