Pages that link to "Item:Q3359665"

The following pages link to A Modified BFGS Algorithm for Unconstrained Optimization (Q3359665):

Displaying 50 items.

• A modified scaling parameter for the memoryless BFGS updating formula (Q297561) (← links)
• Scaling damped limited-memory updates for unconstrained optimization (Q306311) (← links)
• Two modified scaled nonlinear conjugate gradient methods (Q390466) (← links)
• A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
• An improved nonlinear conjugate gradient method with an optimal property (Q476750) (← links)
• Spectral scaling BFGS method (Q604256) (← links)
• Two effective hybrid conjugate gradient algorithms based on modified BFGS updates (Q645035) (← links)
• An adaptive scaled BFGS method for unconstrained optimization (Q684183) (← links)
• A modified BFGS algorithm based on a hybrid secant equation (Q763667) (← links)
• A type of modified BFGS algorithm with any rank defects and the local \(Q\)-superlinear convergence properties (Q854430) (← links)
• Global convergence of the non-quasi-Newton method for unconstrained optimization problems (Q854562) (← links)
• A modified secant method for unconstrained optimization (Q884544) (← links)
• On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae (Q887119) (← links)
• Two new conjugate gradient methods based on modified secant equations (Q972741) (← links)
• New quasi-Newton equation and related methods for unconstrained optimization (Q1306664) (← links)
• Computational experience with known variable metric updates (Q1337205) (← 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)
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
• Using function-values in multi-step quasi-Newton methods (Q1919371) (← links)
• A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
• Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
• An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing (Q2034433) (← links)
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
• Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations (Q2061399) (← links)
• Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing (Q2083385) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization (Q2140823) (← links)
• On \(q\)-BFGS algorithm for unconstrained optimization problems (Q2144107) (← links)
• A hybrid quasi-Newton method with application in sparse recovery (Q2167383) (← links)
• A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations (Q2189341) (← links)
• Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions (Q2190800) (← links)
• A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization (Q2204182) (← links)
• Descent Perry conjugate gradient methods for systems of monotone nonlinear equations (Q2205641) (← links)
• A class of accelerated subspace minimization conjugate gradient methods (Q2231338) (← links)
• Nonmonotone adaptive trust region method with line search based on new diagonal updating (Q2261939) (← links)
• An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
• A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
• A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function (Q2327437) (← links)
• An adaptive sizing BFGS method for unconstrained optimization (Q2355301) (← links)
• A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
• A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
• Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization (Q2406313) (← links)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices (Q2514763) (← links)
• A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
• Computational experiments with scaled initial hessian approximation for the broyden family methods^∗ (Q2709452) (← links)
• Multi-directional parallel algorithms for unconstrained optimization (Q2785395) (← links)
• The Broyden-Fletcher-Goldfarb-Shanno algorithm based on new quasi-Newton equation (Q2858555) (← links)