The following pages link to (Q4107408):
Displaying 50 items.
- A Stochastic Quasi-Newton Method for Large-Scale Optimization (Q121136) (← links)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- Global convergence of a modified limited memory BFGS method for non-convex minimization (Q385195) (← links)
- Convergence and stability of line search methods for unconstrained optimization (Q385584) (← links)
- Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252) (← links)
- A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
- A class of diagonal quasi-Newton methods for large-scale convex minimization (Q503542) (← 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)
- A new algorithm for box-constrained global optimization (Q639210) (← links)
- Analysis of a self-scaling quasi-Newton method (Q689143) (← links)
- Extra-updates criterion for the limited memory BFGS algorithm for large scale nonlinear optimization (Q700177) (← 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)
- A type of modified BFGS algorithm with any rank defects and the local \(Q\)-superlinear convergence properties (Q854430) (← links)
- Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization (Q858748) (← links)
- A new BFGS algorithm using the decomposition matrix of the correction matrix to obtain the search directions (Q892527) (← links)
- An accelerated double step size model in unconstrained optimization (Q902839) (← links)
- On the limited memory BFGS method for large scale optimization (Q911463) (← 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)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
- The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden (Q1056526) (← links)
- A superlinearly convergent method to linearly constrained optimization problems under degeneracy (Q1058463) (← links)
- A new quasi-Newton algorithm (Q1095608) (← links)
- Parallel quasi-Newton methods for unconstrained optimization (Q1116897) (← links)
- Hybrid method for nonlinear least-square problems without calculating derivatives (Q1123813) (← links)
- Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization (Q1131824) (← links)
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung (Q1136486) (← links)
- Minimizing a differentiable function over a differential manifold (Q1151825) (← links)
- A modified Newton's method for minimizing factorable functions (Q1157568) (← links)
- A variable metric algorithm for unconstrained minimization without evaluation of derivatives (Q1157671) (← links)
- Partitioned variable metric updates for large structured optimization problems (Q1162795) (← links)
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients (Q1176574) (← links)
- The equivalence of strict convexity and injectivity of the gradient in bounded level sets (Q1177236) (← links)
- New algorithms for linear programming (Q1207191) (← links)
- A comparison of nonlinear optimization methods for supervised learning in multilayer feedforward neural networks (Q1268172) (← links)
- A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy (Q1299844) (← links)
- Modifying the BFGS update by a new column scaling technique (Q1338135) (← links)
- Family of optimally conditioned quasi-Newton updates for unconstrained optimization (Q1338563) (← links)
- Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
- Modifying the BFGS method (Q1362522) (← links)
- How to deal with the unbounded in optimization: Theory and algorithms (Q1365044) (← links)
- Transformation of uniformly distributed particle ensembles (Q1372120) (← links)
- The convergence of Broyden algorithms for LC gradient function (Q1582577) (← links)
- A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← 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)
