Pages that link to "Item:Q5632019"
From MaRDI portal
The following pages link to An algorithm for approximating convex functions by means by first degree splines (Q5632019):
Displaying 9 items.
- \(L_1\) approximations of strictly convex functions by means of first degree splines (Q1244652) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- Approximation of quadratic Bézier curves by arc splines (Q1347173) (← links)
- Integrating unimodality into distributionally robust optimal power flow (Q2085818) (← links)
- Optimizing resource speed for two-stage real-time tasks (Q2362234) (← links)
- Functional approximation of planar curves via adaptive segmentation (Q3948523) (← links)
- Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)
- (Q4094294) (← links)
- An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem (Q6181252) (← links)