Pages that link to "Item:Q1573986"

The following pages link to Globally convergent BFGS method for nonsmooth convex optimization (Q1573986):

Displaying 25 items.

• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
• An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
• An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← links)
• Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
• Constructing a sequence of discrete Hessian matrices of an \(SC^{1}\) function uniformly convergent to the generalized Hessian matrix (Q847841) (← links)
• A bundle modification strategy for convex minimization (Q869143) (← links)
• A quasi-Newton bundle method based on approximate subgradients (Q874359) (← links)
• A multipoint method of minimization of a convex function (Q1582924) (← links)
• A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
• A trust region method for nonsmooth convex optimization (Q1780126) (← links)
• An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
• Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
• Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
• A generalized duality method for solving variational inequalities. Applications to some nonlinear Dirichlet problems (Q2575160) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems (Q2719240) (← links)
• (Q4552723) (← links)
• Nonsmooth Variants of Powell's BFGS Convergence Theorem (Q4641661) (← links)
• An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← links)
• A memory gradient method for non-smooth convex optimization (Q5266154) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity (Q6078423) (← links)