Pages that link to "Item:Q535081"
From MaRDI portal
The following pages link to Globally convergent cutting plane method for nonconvex nonsmooth minimization (Q535081):
Displaying 16 items.
- NSO (Q17412) (← links)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← 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)
- Cutting sphere algorithm (Q597178) (← links)
- A global linearization approach to solve nonlinear nonsmooth constrained programming problems (Q656550) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence (Q1717026) (← links)
- A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm (Q1721580) (← links)
- Generalized \(\gamma\)-valid cut procedure for concave minimization (Q1807817) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- A vector forward mode of automatic differentiation for generalized derivative evaluation (Q3458838) (← links)
- Gradient set splitting in nonconvex nonsmooth numerical optimization (Q3562383) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
- A feasible direction algorithm for nonlinear second-order cone programs (Q5238072) (← links)
