Numerical Method of Simultaneous Solution the Problem of Finding the Distance (Best) Between a Convex Polyhedron and a Finite-Dimensional Subspace of a Linear Normed Space and Dual Task

Similar Items

• Numerical Method of Simultaneous Solution the Problem of Finding the Distance (Best) Between a Convex Polyhedron and a Finite-Dimensional Subspace of a Linear Normed Space and Dual Task
  by: Гудима, Уляна, et al.
  Published: (2021)
• The Criterions of the Extremality of a Sequence for the Problem of Finding the Distance Between Two Convex Sets of the Linear Normed Space
  by: U. V. Hudyma, et al.
  Published: (2019)
• The Relation of Duality and the Criterion of the Extremality of an Element for the Problem of Finding the Distance Between Two Convex Sets of Linear Normed Space
  by: U. V. Hudyma, et al.
  Published: (2018)
• The criteria extremal elements for the problem in the best sense of the family of convex Lipschitz functions of uniform approximation of a compact-continuous mapping of finite subspace
  by: U. V. Hudyma, et al.
  Published: (2013)
• The problem in the best sense of the weighted Hausdorff distance approximating a uniform plural continuous maps of compact convex images
  by: U. V. Hudyma, et al.
  Published: (2016)