An algorithm for linearizing convex extremal problems

DOI10.1070/SM2010V201N04ABEH004079zbMATH Open1218.90110MaRDI QIDQ3577772FDOQ3577772

Authors: E. S. Gorskaya 

Publication date: 23 July 2010

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Recommendations

• Approximation of convex functions by projections of polyhedra
• scientific article; zbMATH DE number 4108510
• On a method of simplex embeddings in convex programming.
• Linear time algorithms for convex and monotone approximation
• A method for approximating the solution set of a system of convex inequalities by polytopes

zbMATH Keywords

piecewise linear functionsapproximation of functionsconvex problemsevaluation of operator norms

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Approximation by convex sets (52A27)

Cited In (10)

• An algorithm to find a maximum of a multilinear map over a product of spheres
• O(n) algorithms for discrete n-point approximation by quasi-convex functions
• A maximal volume cone algorithm for linear programming problems
• The linearized version of an algorithm for the mixed norms problem
• Title not available (Why is that?)
• A Descent Algorithm for Minimizing Polyhedral Convex Functions
• Approximation of convex functions by projections of polyhedra
• Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra
• Linear time algorithms for convex and monotone approximation
• Title not available (Why is that?)

This page was built for publication: An algorithm for linearizing convex extremal problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577772)