Abstract
A method for approximate solution of minimization problems for multivariable convex functions with convex constraints is proposed. The main idea consists in approximation of the objective function and constraints by piecewise linear functions and subsequent reduction of the initial convex programming problem to a problem of linear programming. We present algorithms constructing approximating polygons for some classes of single variable convex functions. The many-dimensional problem is reduced to a one-dimensional one by an inductive procedure. The efficiency of the method is illustrated by numerical examples.
Similar content being viewed by others
References
S. Boyd and L. Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge, 2006).
Y. Nesterov and A. Nemirovsky, Interior Point Polynomial Methods in Convex Programming (SIAM, Philadelphia, PA, 1994).
M. Ludwig, C. Schütt, and El. Werner, “Approximation of the Euclidean Ball by Polytopes,” Stud. Math. 173(1), 1 (2006).
L. Chen, “New Analysis of the Sphere Covering Problems and Optimal Polytope Approximation of Convex Bodies,” J. Approx. Theory 133(1), 134 (2005).
M. Lopez and S. Reisner, “Hausdorff Approximation of Convex Polygons,” Comput. Geom. 32(2), 139 (2005).
J. S. Müller, “Step by Step Approximation of Plane Convex Bodies,” Arch. Math. (Basel) 58(6), 606 (1992).
P. M. Gruber, “Error of Asymptotic Formulae for Volume Approximation of Convex Bodies in \( \mathbb{E}^d \) d. Dedicated to Edmund Hlawka on the Occasion of His 85th Birthday,” Monatsh. Math. 135(4), 279 (2002).
C. Schütt and El. Werner, “Random Polytopes with Vertices on the Boundary of a Convex Body,” C. r. Acad. sci. Paris, Ser. A 331(9), 697 (2000).
R. Schneider, “Polyhedral Approximation of Smooth Convex Bodies,” J. Math. Anal. and Appl. 128(2), 470 (1987).
D. E. McClure and R. A. Vitale, “Polygonal Approximation of Plane Convex Bodies,” J. Math. Anal. and Appl. 51(2), 326 (1975).
V. Yu. Protasov, “The Joint Spectral Radius and Invariant Sets of Linear Operators,” Fundam. Prikl. Matem. 2(1), 205 (1996).
E. S. Gorskaya, “An Algorithm for Linearizing Convex Extremal Problems,” Matem. Sborn. 201(4), 3 (2010) [Sbornik: Math. 201 (4), 471 (2010)].
A. Ben-Tal and A. Nemirovsky, “On Polyhedral Approximations of the Second Order Cone,” Math. Oper. Res. 26, 193 (2001).
A. Yu. Levin, “On an Algorithm for the Minimization of Convex Functions,” Doklady Akad. Nauk SSSR, 160(6), 1241 (1965) [Soviet Math. Doklady bf 6, 286 (1965)].
Author information
Authors and Affiliations
Additional information
Original Russian Text © E.S.Gorskaya, 2010, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2010, Vol. 65, No. 5, pp. 20–27.
About this article
Cite this article
Gorskaya, E.S. Approximation of convex functions by projections of polyhedra. Moscow Univ. Math. Bull. 65, 196–203 (2010). https://doi.org/10.3103/S0027132210050049
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132210050049