Linear inequalities in mathematical programming and pattern recognition

DOI10.1007/BF01061299zbMATH Open0666.90048MaRDI QIDQ1117138FDOQ1117138

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

Publication date: 1988

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

zbMATH Keywords

contractionboundary solutions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Adaptive thresholding technique for solving optimization problems on attainable sets of \((\max,\min)\)-linear systems.
• Title not available (Why is that?)

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)