Pages that link to "Item:Q3805796"

The following pages link to Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems (Q3805796):

Displaying 50 items.

• A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
• A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
• Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
• Global convergence of a modified limited memory BFGS method for non-convex minimization (Q385195) (← links)
• A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
• Analysis of sparse quasi-Newton updates with positive definite matrix completion (Q489095) (← links)
• A class of diagonal quasi-Newton methods for large-scale convex minimization (Q503542) (← links)
• Sufficient descent directions in unconstrained optimization (Q538309) (← links)
• Spectral scaling BFGS method (Q604256) (← links)
• The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems (Q625664) (← links)
• New quasi-Newton methods via higher order tensor models (Q629502) (← links)
• Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search (Q662895) (← links)
• An adaptive scaled BFGS method for unconstrained optimization (Q684183) (← links)
• Analysis of a self-scaling quasi-Newton method (Q689143) (← links)
• A nonmonotone PSB algorithm for solving unconstrained optimization (Q694601) (← 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 modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems (Q831261) (← links)
• Global convergence of the non-quasi-Newton method for unconstrained optimization problems (Q854562) (← links)
• A new BFGS algorithm using the decomposition matrix of the correction matrix to obtain the search directions (Q892527) (← links)
• A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
• Some numerical experiments with variable-storage quasi-Newton algorithms (Q909585) (← 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)
• A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule (Q949372) (← links)
• Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
• A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
• A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
• A new backtracking inexact BFGS method for symmetric nonlinear equations (Q1031701) (← links)
• A new quasi-Newton algorithm (Q1095608) (← links)
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients (Q1176574) (← links)
• Numerical expirience with a class of self-scaling quasi-Newton algorithms (Q1264971) (← links)
• Family of optimally conditioned quasi-Newton updates for unconstrained optimization (Q1338563) (← links)
• Modifying the BFGS method (Q1362522) (← links)
• Some convergence properties of descent methods (Q1372548) (← links)
• Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
• The convergence of Broyden algorithms for LC gradient function (Q1582577) (← links)
• Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
• A class of one parameter conjugate gradient methods (Q1664259) (← 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)
• The hybrid BFGS-CG method in solving unconstrained optimization problems (Q1724270) (← links)
• A partitioned PSB method for partially separable unconstrained optimization problems (Q1733684) (← links)
• Global convergence property of scaled two-step BFGS method (Q1744145) (← links)
• Convergence property of a class of variable metric methods. (Q1764533) (← links)
• The revised DFP algorithm without exact line search (Q1811670) (← links)
• Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems (Q1824569) (← links)
• Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch (Q1873573) (← links)
• Convergence and numerical results for a parallel asynchronous quasi- Newton method (Q1893309) (← links)
• A parallel quasi-Newton algorithm for unconstrained optimization (Q1895652) (← links)