Pages that link to "Item:Q393748"

The following pages link to A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748):

Displaying 18 items.

• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
• A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
• A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
• A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
• An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
• A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION (Q4608945) (← links)
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints (Q4631819) (← links)
• Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions (Q5038179) (← links)
• Cost-Effective Robust Stabilization and Bifurcation Suppression (Q5232222) (← links)
• A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles (Q5268896) (← links)
• A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization (Q5865916) (← links)
• A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective (Q6093282) (← links)
• New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)
• Modified gradient sampling algorithm for nonsmooth semi-infinite programming (Q6578198) (← links)