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
Gespeichert in:
| Datum: | 2021 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
2021
|
| Schriftenreihe: | Mathematical and computer modelling. Series: Physical and mathematical sciences |
| Online Zugang: | http://jnas.nbuv.gov.ua/article/UJRN-0001384359 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNAS| id |
open-sciencenbuvgovua-9804 |
|---|---|
| record_format |
dspace |
| spelling |
open-sciencenbuvgovua-98042024-02-25T16:12:07Z 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 U. V. Hudyma V. O. Hnatiuk 2308-5878 2021 en Mathematical and computer modelling. Series: Physical and mathematical sciences http://jnas.nbuv.gov.ua/article/UJRN-0001384359 Article |
| institution |
Library portal of National Academy of Sciences of Ukraine | LibNAS |
| collection |
Open-Science |
| language |
English |
| series |
Mathematical and computer modelling. Series: Physical and mathematical sciences |
| spellingShingle |
Mathematical and computer modelling. Series: Physical and mathematical sciences U. V. Hudyma V. O. Hnatiuk 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 |
| format |
Article |
| author |
U. V. Hudyma V. O. Hnatiuk |
| author_facet |
U. V. Hudyma V. O. Hnatiuk |
| author_sort |
U. V. Hudyma |
| title |
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 |
| title_short |
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 |
| title_full |
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 |
| title_fullStr |
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 |
| title_full_unstemmed |
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 |
| title_sort |
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 |
| publishDate |
2021 |
| url |
http://jnas.nbuv.gov.ua/article/UJRN-0001384359 |
| work_keys_str_mv |
AT uvhudyma numericalmethodofsimultaneoussolutiontheproblemoffindingthedistancebestbetweenaconvexpolyhedronandafinitedimensionalsubspaceofalinearnormedspaceanddualtask AT vohnatiuk numericalmethodofsimultaneoussolutiontheproblemoffindingthedistancebestbetweenaconvexpolyhedronandafinitedimensionalsubspaceofalinearnormedspaceanddualtask |
| first_indexed |
2025-07-17T11:54:44Z |
| last_indexed |
2025-07-17T11:54:44Z |
| _version_ |
1837895028362444800 |