Form of presentation | Articles in international journals and collections |
Year of publication | 2021 |
Язык | английский |
|
Konnov Igor Vasilevich, author
Pinyagina Olga Vladislavovna, author
|
Bibliographic description in the original language |
Konnov I, Pinyagina O., A Subgradient Projection Method for Set-Valued Network Equilibrium Problems//Communications in Computer and Information Science. - 2021. - Vol.1476 CCIS, Is.. - P.41-53. |
Annotation |
We describe a general set-valued variant of the network equilibrium problem with fixed demand. This problem is equivalent to a set-valued variational inequality. Under certain additional assumptions, it can be replaced with a nonsmooth convex optimization problem. We propose to apply the subgradient projection method with a special two-speed step-size choice procedure to this problem. Computational experiments on model networks showed that the proposed approach is rather efficient. It gives a more flexible procedure for the choice of parameters. |
Keywords |
Set-valued network equilibrium problem, Nonsmooth optimization problem, Subgradient projection method, Two-speed step-size choice |
The name of the journal |
Communications in Computer and Information Science
|
URL |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85115848330&doi=10.1007%2f978-3-030-86433-0_3&partnerID=40&md5=a077ef586f70be63b264d0c93e960395 |
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=258619&p_lang=2 |
Full metadata record |
Field DC |
Value |
Language |
dc.contributor.author |
Konnov Igor Vasilevich |
ru_RU |
dc.contributor.author |
Pinyagina Olga Vladislavovna |
ru_RU |
dc.date.accessioned |
2021-01-01T00:00:00Z |
ru_RU |
dc.date.available |
2021-01-01T00:00:00Z |
ru_RU |
dc.date.issued |
2021 |
ru_RU |
dc.identifier.citation |
Konnov I, Pinyagina O., A Subgradient Projection Method for Set-Valued Network Equilibrium Problems//Communications in Computer and Information Science. - 2021. - Vol.1476 CCIS, Is.. - P.41-53. |
ru_RU |
dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=258619&p_lang=2 |
ru_RU |
dc.description.abstract |
Communications in Computer and Information Science |
ru_RU |
dc.description.abstract |
We describe a general set-valued variant of the network equilibrium problem with fixed demand. This problem is equivalent to a set-valued variational inequality. Under certain additional assumptions, it can be replaced with a nonsmooth convex optimization problem. We propose to apply the subgradient projection method with a special two-speed step-size choice procedure to this problem. Computational experiments on model networks showed that the proposed approach is rather efficient. It gives a more flexible procedure for the choice of parameters. |
ru_RU |
dc.language.iso |
ru |
ru_RU |
dc.subject |
Set-valued network equilibrium problem |
ru_RU |
dc.subject |
Nonsmooth optimization problem |
ru_RU |
dc.subject |
Subgradient projection method |
ru_RU |
dc.subject |
Two-speed step-size choice |
ru_RU |
dc.title |
A Subgradient Projection Method for Set-Valued Network Equilibrium Problems |
ru_RU |
dc.type |
Articles in international journals and collections |
ru_RU |
|