Pages that link to "Item:Q3577772"
From MaRDI portal
The following pages link to An algorithm for linearizing convex extremal problems (Q3577772):
Displaying 11 items.
- Linear time algorithms for convex and monotone approximation (Q792060) (← links)
- The linearized version of an algorithm for the mixed norms problem (Q912569) (← links)
- Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra (Q1003740) (← links)
- A maximal volume cone algorithm for linear programming problems (Q1277217) (← links)
- Algorithms for approximate calculation of the minimum of a convex function from its values (Q1358455) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- An algorithm to find a maximum of a multilinear map over a product of spheres (Q1935752) (← links)
- O(n) algorithms for discrete n-point approximation by quasi-convex functions (Q2266345) (← links)
- Approximation of convex functions by projections of polyhedra (Q2513165) (← links)
- (Q3712145) (← links)
- (Q3762071) (← links)