RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Nefedov, Viktor Nikolaevich

Statistics Math-Net.Ru
Total publications: 16
Scientific articles: 15

Number of views:
This page:232
Abstract pages:1592
Full texts:814
References:120
Associate professor
Candidate of physico-mathematical sciences

http://www.mathnet.ru/eng/person63464
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/192305

Publications in Math-Net.Ru
2019
1. V. N. Nefedov, “Некоторые численные методы приближенного вычисления вероятностной меры многогранника второго и третьего порядков точности”, Zh. Vychisl. Mat. Mat. Fiz., 59:7 (2019),  1108–1124  mathnet  elib
2018
2. V. N. Nefyodov, V. A. Osipova, S. O. Smerchinskaya, N. P. Yashina, “Non-contradictory aggregations of relations of strict order”, Izv. Vyssh. Uchebn. Zaved. Mat., 2018, 5,  71–85  mathnet; Russian Math. (Iz. VUZ), 62:5 (2018), 61–73  isi  scopus
3. V. N. Nefedov, S. O. Smerchinskaya, N. P. Yashina, “Constructing an aggregated relation with a minimum distance from the expert preferences”, Prikl. Diskr. Mat., 2018, 42,  120–132  mathnet
1993
4. V. N. Nefëdov, “The complexity of the computation of a global minimum in certain classes of optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 33:10 (1993),  1480–1498  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 33:10 (1993), 1309–1322  isi
1992
5. V. N. Nefëdov, “Some problems of solving Lipschitzian global optimization problems using the branch and bound method”, Zh. Vychisl. Mat. Mat. Fiz., 32:4 (1992),  512–529  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 32:4 (1992), 433–445  isi
1990
6. V. N. Nefedov, “A mathematical programming problem with a convex irregular feasible set”, Zh. Vychisl. Mat. Mat. Fiz., 30:6 (1990),  844–857  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 30:3 (1990), 145–154
7. V. N. Nefedov, “Estimation of the error in convex polynomial optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 30:2 (1990),  200–216  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 30:1 (1990), 147–158
1987
8. V. N. Nefedov, “Polynomial optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 27:5 (1987),  661–675  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 27:3 (1987), 13–21
9. V. N. Nefedov, “Search for the global maximum of a function of several variables on a set defined by constraints of inequality type”, Zh. Vychisl. Mat. Mat. Fiz., 27:1 (1987),  35–51  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 27:1 (1987), 23–32
1986
10. V. N. Nefedov, “Approximation of a set of Pareto-optimal solutions”, Zh. Vychisl. Mat. Mat. Fiz., 26:2 (1986),  163–176  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 26:1 (1986), 99–107
1984
11. V. N. Nefedov, “Approximation of a Pareto set”, Zh. Vychisl. Mat. Mat. Fiz., 24:7 (1984),  993–1007  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 24:4 (1984), 19–28
1983
12. V. N. Nefedov, “On regularization of lexicographic problems by the method of minimum concessions”, Zh. Vychisl. Mat. Mat. Fiz., 23:6 (1983),  1326–1340  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 23:6 (1983), 27–36
13. V. N. Nefedov, “Calculation of the conditional minimum of a function with a given accuracy”, Zh. Vychisl. Mat. Mat. Fiz., 23:3 (1983),  590–601  mathnet  mathscinet; U.S.S.R. Comput. Math. Math. Phys., 23:3 (1983), 47–55
1981
14. V. N. Nefedov, “Convex lexicographic problems”, Zh. Vychisl. Mat. Mat. Fiz., 21:4 (1981),  865–880  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 21:4 (1981), 49–65
1979
15. V. N. Nefedov, “Methods of regularizing three-stage convex lexicographic problems”, Dokl. Akad. Nauk SSSR, 249:5 (1979),  1060–1063  mathnet  mathscinet  zmath

2019
16. V. N. Nefedov, S. O. Smerchinskaya, N. P. Yashina, “Non-contradictory aggregation of quasi-order relations”, Prikl. Diskr. Mat., 2019, 45,  113–126  mathnet

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020