Cited in
(19)- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- A proximal-projection partial bundle method for convex constrained minimax problems
- PLCP
- GradSamp
- NSO
- SQPlab
- CARTopt
- Cost-effective robust stabilization and bifurcation suppression
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- A new restricted memory level bundle method for constrained convex nonsmooth optimization
This page was built for software: SLQP-GS
