An algorithm for linearizing convex extremal problems
- M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.
- OSTI ID:
- 21418091
- Journal Information:
- Sbornik. Mathematics, Vol. 201, Issue 4; Other Information: DOI: 10.1070/SM2010v201n04ABEH004079; ISSN 1064-5616
- Country of Publication:
- United States
- Language:
- English
Similar Records
Entropy based primal-dual algorithm for convex and linear cost transportation problems with serial and parallel implementations
Parallel algorithms for a class of convex optimization problems