Linear inequalities in mathematical programming and pattern recognition

DOI10.1007/BF01061299MaRDI QIDQ1117138zbMATH OpenFDO

Authors N. N. Astaf'ev, Ivan I. Eremin, Vl. D. Mazurov

Publication date 1988

Published in Ukrainian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01061299

zbMATH Keywords

boundary solutionscontraction

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Pattern recognition, speech recognition (68T10) Linear programming (90C05)

Review text

See the review in Zbl 0649.90074.

Cites work

• A note on infinite systems of linear inequalities in R^n
• Convex Analysis
• Convex analysis treated by linear programming
• Duality gaps in semi-infinite linear programming—an approximation problem
• Duality in convex programming: a linearization approach¹
• scientific article; zbMATH DE number 3854456 (Why is no real title available?)
• scientific article; zbMATH DE number 3898602 (Why is no real title available?)
• scientific article; zbMATH DE number 3963599 (Why is no real title available?)
• scientific article; zbMATH DE number 3978500 (Why is no real title available?)
• scientific article; zbMATH DE number 3700567 (Why is no real title available?)
• On infinite systems of linear inequalities
• On the Computational Solution of a Class of Generalized Moment Problems
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions

Cited in

(2)

• scientific article; zbMATH DE number 4060995 (Why is no real title available?)
• Adaptive thresholding technique for solving optimization problems on attainable sets of \((\max,\min)\)-linear systems.

This page was built for publication: Linear inequalities in mathematical programming and pattern recognition

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