An algorithm for linearizing convex extremal problems
From MaRDI portal
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
(12)- Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra
- A maximal volume cone algorithm for linear programming problems
- Algorithms for approximate calculation of the minimum of a convex function from its values
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
- 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
- Approximation of convex functions by projections of polyhedra
- A Descent Algorithm for Minimizing Polyhedral Convex Functions
- scientific article; zbMATH DE number 3939126 (Why is no real title available?)
- scientific article; zbMATH DE number 4012312 (Why is no real title available?)
- Linear time algorithms for convex and monotone approximation
- The linearized version of an algorithm for the mixed norms problem
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)
