Pages that link to "Item:Q4145437"

The following pages link to A modification of Armijo's step-size rule for negative curvature (Q4145437):

Displaying 33 items.

• Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems (Q623198) (← 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)
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
• A modified PRP conjugate gradient method (Q1026553) (← links)
• Improving directions of negative curvature in an efficient manner (Q1026565) (← links)
• Minimizing a differentiable function over a differential manifold (Q1151825) (← links)
• Modifications of the Wolfe line search rules to satisfy second-order optimality conditions in unconstrained optimization (Q1384067) (← 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)
• Nonmonotone curvilinear line search methods for unconstrained optimization (Q1816399) (← links)
• A likelihood-based boosting algorithm for factor analysis models with binary data (Q2076167) (← links)
• Iterative grossone-based computation of negative curvature directions in large-scale optimization (Q2194128) (← links)
• Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
• A new version of the Liu-Storey conjugate gradient method (Q2381321) (← links)
• Iterative computation of negative curvature directions in large scale optimization (Q2457949) (← links)
• An unconstrained optimization method using nonmonotone second order Goldstein's line search (Q2464310) (← 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)
• A curvilinear search algorithm for unconstrained optimization by automatic differentiation (Q2770192) (← links)
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems (Q3055065) (← links)
• Zwei trajektorienverfahren zur Lösung nichtlinearer optimierungsaufgaben (Q3200900) (← links)
• Curved search methods for unconstrained optimization (Q3211127) (← links)
• Curvilinear path steplength algorithms for minimization which use directions of negative curvature (Q3865866) (← links)
• Penalty methods for computing points that satisfy second order necessary conditions (Q3962792) (← links)
• On the use of directions of negative curvature in a modified newton method (Q4177356) (← links)
• An extremal problem with applications to renewable energy production (Q5001087) (← links)
• Some new step-size rules for optimization problems (Q5436239) (← links)
• A dwindling filter line search method for unconstrained optimization (Q5497020) (← links)
• On the final steps of Newton and higher order methods (Q5963239) (← links)
• Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems (Q6051305) (← links)
• Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization (Q6057628) (← links)
• Adaptive nonmonotone line search method for unconstrained optimization (Q6059117) (← links)