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 8 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 optimal adaptive algorithm for the approximation of concave functions (Q2492698) (← 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)
- Gradient-Based Discrete-Time Concurrent Learning for Standalone Function Approximation (Q5125479) (← links)