Pages that link to "Item:Q5936068"
From MaRDI portal
The following pages link to A modified BFGS method and its global convergence in nonconvex minimization (Q5936068):
Displayed 50 items.
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- On Hager and Zhang's conjugate gradient method with guaranteed descent (Q273329) (← links)
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
- A modified scaling parameter for the memoryless BFGS updating formula (Q297561) (← 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)
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775) (← links)
- Globally convergent modified Perry's conjugate gradient method (Q440856) (← links)
- Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization (Q442712) (← 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)
- Two modified three-term conjugate gradient methods with sufficient descent property (Q479259) (← links)
- A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization (Q488947) (← links)
- An improved adaptive trust-region algorithm (Q519772) (← links)
- A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (Q555476) (← links)
- Two modified HS type conjugate gradient methods for unconstrained optimization problems (Q611200) (← links)
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems (Q625664) (← links)
- Improved Hessian approximation with modified secant equations for symmetric rank-one method (Q629505) (← links)
- An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates (Q645035) (← links)
- Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search (Q662895) (← links)
- Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization (Q679697) (← links)
- An adaptive scaled BFGS method for unconstrained optimization (Q684183) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
- A conjugate gradient method with sufficient descent property (Q747726) (← 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)
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae (Q887119) (← links)
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (Q928232) (← links)
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization (Q953368) (← links)
- Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems (Q964960) (← links)
- Two new conjugate gradient methods based on modified secant equations (Q972741) (← links)
- A limited memory BFGS-type method for large-scale unconstrained optimization (Q1004767) (← links)
- Two modified Dai-Yuan nonlinear conjugate gradient methods (Q1014353) (← 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)
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← 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 adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix (Q1677473) (← links)
- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions (Q1715789) (← links)
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization (Q1718269) (← links)
- A partitioned PSB method for partially separable unconstrained optimization problems (Q1733684) (← links)
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
- Nonmonotone spectral method for large-scale symmetric nonlinear equations (Q1938081) (← links)
- New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications (Q1952757) (← links)
- A new modified BFGS method for unconstrained optimization problems (Q1993498) (← links)
- A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems (Q2004132) (← links)
