Pages that link to "Item:Q1306664"
From MaRDI portal
The following pages link to New quasi-Newton equation and related methods for unconstrained optimization (Q1306664):
Displaying 50 items.
- A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations (Q2189341) (← links)
- A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← 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 modified Newton-like method for nonlinear equations (Q2204162) (← 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)
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q2240113) (← links)
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
- A family of Hager-Zhang conjugate gradient methods for system of monotone nonlinear equations (Q2279636) (← links)
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
- Scaled nonlinear conjugate gradient methods for nonlinear least squares problems (Q2322819) (← links)
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function (Q2327437) (← links)
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q2338474) (← links)
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization (Q2346397) (← links)
- An adaptive sizing BFGS method for unconstrained optimization (Q2355301) (← links)
- A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
- Local and superlinear convergence of quasi-Newton methods based on modified secant conditions (Q2372957) (← links)
- A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
- The global convergence of a modified BFGS method for nonconvex functions (Q2402402) (← links)
- A modified quasi-Newton method for nonlinear equations (Q2406290) (← links)
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization (Q2406313) (← links)
- Structured two-point stepsize gradient methods for nonlinear least squares (Q2420782) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization (Q2441364) (← links)
- Another hybrid conjugate gradient algorithm for unconstrained optimization (Q2481406) (← links)
- New quasi-Newton methods for unconstrained optimization problems (Q2493696) (← links)
- New line search methods for unconstrained optimization (Q2510603) (← links)
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices (Q2514763) (← links)
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition (Q2515111) (← links)
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
- A modified secant equation quasi-Newton method for unconstrained optimization (Q2700102) (← links)
- A new quasi-Newton's method for unconstrained multiobjective optimization (Q2823854) (← links)
- A modified two-point stepsize gradient algorithm for unconstrained minimization (Q2867423) (← links)
- A class of modified BFGS methods with function value information for unconstrained optimization (Q2873833) (← links)
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
- A nonlinear conjugate gradient method based on the MBFGS secant condition (Q3423590) (← links)
- A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family (Q3458820) (← links)
- A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q4638925) (← links)
- A family of quasi-Newton methods for unconstrained optimization problems (Q4646526) (← links)
- Higher order curvature information and its application in a modified diagonal Secant method (Q4646553) (← links)
- (Q4690556) (← links)
- (Q4945653) (← links)
- A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization (Q4959904) (← links)
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization (Q5028578) (← links)
- (Q5151745) (← links)
- On the Local and Superlinear Convergence of a Parameterized DFP Method (Q5409730) (← links)
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation (Q5495572) (← links)
- A descent family of Dai–Liao conjugate gradient methods (Q5746716) (← links)
- A modified conjugate gradient method based on a modified secant equation (Q5855677) (← links)