Pages that link to "Item:Q2885467"

The following pages link to Comparing different nonsmooth minimization methods and software (Q2885467):

Displaying 16 items.

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
• A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator (Q276854) (← links)
• Composite proximal bundle method (Q359623) (← links)
• Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (Q480827) (← links)
• Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
• Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
• A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
• A convergence analysis of the method of codifferential descent (Q1756589) (← links)
• A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
• Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
• A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization (Q2438434) (← links)
• Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
• An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
• A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)