An application of semi-infinite linear programming: approximation of a continuous function by a polynomial

zbMATH Open1235.90166MaRDI QIDQ5293003FDOQ5293003

Authors: David Bartl 

Publication date: 26 June 2007

Full work available at URL: https://eudml.org/doc/23877

Recommendations

• Semi-infinite linear optimization on noncompact spaces and its application to approximation theory
• scientific article; zbMATH DE number 1215251
• A one-phase algorithm for semi-infinite linear programming
• An implementation of a discretization method for semi-infinite programming
• scientific article; zbMATH DE number 19423

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90) Best approximation, Chebyshev systems (41A50) Semi-infinite programming (90C34)

Cites Work

• Title not available (Why is that?)
• Systems of Inequalities Involving Convex Functions
• On the Development of Optimization Theory
• Title not available (Why is that?)
• Generalizations of Farkas’ Theorem
• Elementare Theorie der konvexen Polyeder

Cited In (1)

• A semi-infinite programming method for approximating load duration curves by polynomials

This page was built for publication: An application of semi-infinite linear programming: approximation of a continuous function by a polynomial

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