Pages that link to "Item:Q711385"
From MaRDI portal
The following pages link to Convergence analysis of a modified BFGS method on convex minimizations (Q711385):
Displayed 32 items.
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- A quasi-Newton algorithm for large-scale nonlinear equations (Q509967) (← links)
- An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
- A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- A new type of quasi-Newton updating formulas based on the new quasi-Newton equation (Q779629) (← links)
- A new adaptive trust region algorithm for optimization problems (Q1637037) (← 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)
- A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models (Q1720966) (← links)
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing (Q1724067) (← links)
- A new modified BFGS method for unconstrained optimization problems (Q1993498) (← links)
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing (Q2004234) (← links)
- Convergence analysis of an improved BFGS method and its application in the Muskingum model (Q2007100) (← links)
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems (Q2010240) (← links)
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← 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)
- Two-step conjugate gradient method for unconstrained optimization (Q2204167) (← links)
- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems (Q2209686) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← 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 modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
- The global convergence of a modified BFGS method for nonconvex functions (Q2402402) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
- A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
- A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems (Q2987782) (← links)
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems (Q3016307) (← links)
- A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems (Q3083525) (← links)
- A BFGS algorithm for solving symmetric nonlinear equations (Q4916309) (← links)
- A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization (Q4959904) (← links)