SLQP-GS

swMATH5162MaRDI QIDQ17302FDOQ17302

Author name not available (Why is that?)

Cited In (14)

• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
• A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy 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
• Cost-Effective Robust Stabilization and Bifurcation Suppression
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
• A feasible point method with bundle modification for nonsmooth convex constrained optimization
• A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION
• A proximal-projection partial bundle method for convex constrained minimax problems
• Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
• A new restricted memory level bundle method for constrained convex nonsmooth optimization

This page was built for software: SLQP-GS