Pages that link to "Item:Q381628"
From MaRDI portal
The following pages link to A feasible directions method for nonsmooth convex optimization (Q381628):
Displaying 9 items.
- 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)
- A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
- A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm (Q1721580) (← links)
- A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints (Q2231300) (← links)
- (Q3479464) (← links)
- Direct search nonsmooth constrained optimization via rounded ℓ<sub>1</sub> penalty functions (Q5038179) (← links)
- A feasible direction algorithm for nonlinear second-order cone programs (Q5238072) (← links)
- Nonsmooth optimization by Lie bracket approximations into random directions (Q6161345) (← links)
