Pages that link to "Item:Q439450"
From MaRDI portal
The following pages link to Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450):
Displaying 13 items.
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
- A strongly sub-feasible direction method with subgradient selection for nonsmooth optimization (Q2915929) (← links)
- (Q4037898) (← links)
- (Q4719027) (← links)
- (Q4950903) (← links)
- (Q5037959) (← links)
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization (Q5085236) (← links)