Pages that link to "Item:Q2719240"

The following pages link to On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems (Q2719240):

Displaying 34 items.

• The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
• Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems (Q2209686) (← links)
• Using gradient directions to get global convergence of Newton-type methods (Q2244123) (← links)
• A regularized limited memory BFGS method for nonconvex unconstrained minimization (Q2248965) (← links)
• Nonsmooth multiobjective programming with quasi-Newton methods (Q2256315) (← links)
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
• An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
• A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors (Q2307757) (← links)
• A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems (Q2332754) (← links)
• Nonsmoothness and a variable metric method (Q2346393) (← links)
• Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← 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 new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems (Q2412840) (← links)
• Inexact successive quadratic approximation for regularized optimization (Q2419525) (← links)
• Solution methodologies for minimizing a sum of pointwise minima of two functions (Q2679000) (← links)
• Maximizing the electromagnetic chirality of thin metallic nanowires at optical frequencies (Q2683073) (← links)
• A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
• A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter (Q2868907) (← links)
• Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
• A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems (Q3016307) (← links)
• A globally convergent BFGS method for nonlinear monotone equations without any merit functions (Q3055067) (← links)
• A Riemannian BFGS Method for Nonconvex Optimization Problems (Q3179709) (← links)
• A globally convergent BFGS method for nonconvex minimization without line searches (Q3369523) (← links)
• An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems (Q5242267) (← links)
• New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters (Q5855678) (← links)
• Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization (Q6095733) (← links)
• An overview of stochastic quasi-Newton methods for large-scale machine learning (Q6097379) (← links)
• A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI (Q6099416) (← links)
• A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization (Q6141538) (← links)
• A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM (Q6142230) (← links)
• Greedy PSB methods with explicit superlinear convergence (Q6175468) (← links)
• Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems (Q6180307) (← links)
• An adaptive projection BFGS method for nonconvex unconstrained optimization problems (Q6202792) (← links)