Linear inequalities in mathematical programming and pattern recognition

DOI10.1007/BF01061299zbMath0666.90048MaRDI QIDQ1117138

N. N. Astaf'ev, I. I. Ëremin, Vl. D. Mazurov

Publication date: 1988

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

zbMATH Keywords

contractionboundary solutions

Mathematics Subject Classification ID

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

Related Items

Adaptive thresholding technique for solving optimization problems on attainable sets of (max, min)-linear systems

Cites Work

• A note on infinite systems of linear inequalities in R\(^n\)
• On infinite systems of linear inequalities
• Duality in convex programming: a linearization approach¹
• Duality gaps in semi-infinite linear programming—an approximation problem
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Convex Analysis
• On the Computational Solution of a Class of Generalized Moment Problems
• Convex analysis treated by linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item