Pages that link to "Item:Q1153654"
From MaRDI portal
The following pages link to Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions (Q1153654):
Displaying 7 items.
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- A direct algorithm for optimal quadratic splines (Q913438) (← links)
- Solving highly nonlinear convex separable programs using successive approximation (Q1089265) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
- Constrained optimization in \(L_{\infty}\)-norm: An algorithm for convex quadratic interpolation (Q2640311) (← links)
- Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)
