Pages that link to "Item:Q1915808"

The following pages link to A quasi-second-order proximal bundle algorithm (Q1915808):

Displaying 19 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)
• Solving generation expansion planning problems with environmental constraints by a bundle method (Q373184) (← links)
• A bundle modification strategy for convex minimization (Q869143) (← links)
• Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
• Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
• Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
• A preconditioning proximal Newton method for nondifferentiable convex optimization (Q1356053) (← links)
• Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
• A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
• A family of variable metric proximal methods (Q1804367) (← links)
• Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
• The developments of proximal point algorithms (Q2158107) (← links)
• Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• Role of subgradients in variational analysis of polyhedral functions (Q6151593) (← links)
• Minimizing oracle-structured composite functions (Q6173766) (← links)