An algorithm for linearizing convex extremal problems

DOI10.1070/SM2010V201N04ABEH004079MaRDI QIDQ3577772zbMATH OpenFDO

Authors E. S. Gorskaya

Publication date 23 July 2010

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

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)

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

Cited in

(10)

• scientific article; zbMATH DE number 4012312 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 3939126 (Why is no real title available?)
• Approximation of convex functions by projections of polyhedra
• A Descent Algorithm for Minimizing Polyhedral Convex Functions
• Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra
• Linear time algorithms for convex and monotone approximation

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)