Pages that link to "Item:Q2482748"

The following pages link to Nonconvex optimization using negative curvature within a modified linesearch (Q2482748):

Displaying 10 items.

• 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)
• A likelihood-based boosting algorithm for factor analysis models with binary data (Q2076167) (← links)
• A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← 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)
• The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations (Q5268935) (← links)