Pages that link to "Item:Q1771221"

The following pages link to The superlinear convergence of a modified BFGS-type method for unconstrained optimization (Q1771221):

Displaying 50 items.

• A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
• A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
• Scaling damped limited-memory updates for unconstrained optimization (Q306311) (← links)
• Global convergence of a modified limited memory BFGS method for non-convex minimization (Q385195) (← links)
• Two modified scaled nonlinear conjugate gradient methods (Q390466) (← links)
• Globally convergent modified Perry's conjugate gradient method (Q440856) (← links)
• A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
• The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems (Q625664) (← links)
• An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
• Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
• A modified BFGS algorithm based on a hybrid secant equation (Q763667) (← links)
• A new type of quasi-Newton updating formulas based on the new quasi-Newton equation (Q779629) (← links)
• A type of modified BFGS algorithm with any rank defects and the local \(Q\)-superlinear convergence properties (Q854430) (← links)
• Global convergence properties of two modified BFGS-type methods (Q874351) (← links)
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
• The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (Q928232) (← links)
• The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions (Q939545) (← links)
• Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
• A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
• A new trust region method with adaptive radius (Q1029622) (← links)
• A new backtracking inexact BFGS method for symmetric nonlinear equations (Q1031701) (← links)
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← 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 modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems (Q2004127) (← links)
• Convergence analysis of an improved BFGS method and its application in the Muskingum model (Q2007100) (← links)
• Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
• New results on superlinear convergence of classical quasi-Newton methods (Q2031938) (← links)
• A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
• Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing (Q2083385) (← links)
• A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems (Q2142484) (← links)
• Rates of superlinear convergence for classical quasi-Newton methods (Q2149549) (← links)
• Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model (Q2165892) (← links)
• A hybrid quasi-Newton method with application in sparse recovery (Q2167383) (← links)
• Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization (Q2167421) (← links)
• Global convergence of a modified Broyden family method for nonconvex functions (Q2171116) (← links)
• Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions (Q2190800) (← links)
• The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
• A regularized limited memory BFGS method for nonconvex unconstrained minimization (Q2248965) (← links)
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
• A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function (Q2327437) (← links)
• A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
• The global convergence of a modified BFGS method for nonconvex functions (Q2402402) (← links)
• Global convergence of a modified BFGS-type method for unconstrained non-convex minimization (Q2454986) (← links)
• The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization (Q2479147) (← links)
• New line search methods for unconstrained optimization (Q2510603) (← links)
• A modified secant equation quasi-Newton method for unconstrained optimization (Q2700102) (← links)
• A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
• A class of modified BFGS methods with function value information for unconstrained optimization (Q2873833) (← links)