Pages that link to "Item:Q1870009"
From MaRDI portal
The following pages link to An algorithm for approximating piecewise linear concave functions from sample gradients (Q1870009):
Displaying 6 items.
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Concave regression: value-constrained estimation and likelihood ratio-based inference (Q1739026) (← links)
- An Approximate Dynamic Programming Algorithm for Monotone Value Functions (Q2797467) (← links)
- Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
- Optimal Hour-Ahead Bidding in the Real-Time Electricity Market with Battery Storage Using Approximate Dynamic Programming (Q3458751) (← links)
- Sparse Convex Regression (Q4995070) (← links)