NSO

swMATH5272MaRDI QIDQ17412FDOQ17412

Author name not available (Why is that?)

Described by source

• Globally convergent cutting plane method for nonconvex nonsmooth minimization

Cited In (7)

• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
• Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
• Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
• Diagonal bundle method for nonsmooth sparse optimization
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
• A feasible direction algorithm for nonlinear second-order cone programs
• A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm

This page was built for software: NSO