Pages that link to "Item:Q2458362"
From MaRDI portal
The following pages link to A derivative-free method for linearly constrained nonsmooth optimization (Q2458362):
Displaying 9 items.
- A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
- Using constraints at the conceptual stage of the design of carton erection (Q613960) (← links)
- Statistical inferences for termination of Markov type random search algorithms (Q1035887) (← links)
- An algorithm for the estimation of a regression function by continuous piecewise linear functions (Q2268929) (← links)
- Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018) (← links)
- Clustering based polyhedral conic functions algorithm in classification (Q2514696) (← links)
- A trust region method for solving linearly constrained locally Lipschitz optimization problems (Q4559395) (← links)
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)
