RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Impact factor Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.: Year: Volume: Issue: Page: Find

 Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2010, Number 5, Pages 20–27 (Mi vmumm810)

Mathematics

Approximation of convex functions by projections of polyhedra

E. S. Gorskaya

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: A method for approximate solution of minimization problems for multivariate convex functions with convex constraints is proposed in the paper. The main idea consists in approximation of the objective function and constraints by piecewise linear functions, then the problem of convex programming can be reduced to a problem of linear programming. We present algorithms for construction of approximating polygons for some classes of univariate 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.

Key words: convex problems, projections of polyhedra, approximation, complexity of algorithms.

Full text: PDF file (281 kB)

Bibliographic databases:
UDC: 519.853.3+517.518.8+514.172.45

Citation: E. S. Gorskaya, “Approximation of convex functions by projections of polyhedra”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2010, no. 5, 20–27

Citation in format AMSBIB
\Bibitem{Gor10} \by E.~S.~Gorskaya \paper Approximation of convex functions by projections of polyhedra \jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh. \yr 2010 \issue 5 \pages 20--27 \mathnet{http://mi.mathnet.ru/vmumm810} \mathscinet{http://www.ams.org/mathscinet-getitem?mr=2815263} \zmath{https://zbmath.org/?q=an:1304.90158}