CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Selective bi-coordinate variations for resource allocation type problems
Authors
Konnov I.
Publication date
1 January 2016
Publisher
Abstract
© 2016, Springer Science+Business Media New York.We suggest a modification of the coordinate descent methods for resource allocation problems, which keeps the basic convergence properties of the gradient ones, but enables one to reduce the total computational expenses and to provide all the computations in a distributed manner. We describe applications to economic (auction) equilibrium problems and give preliminary results of computational tests
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/105283
Last time updated on 07/05/2019
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/143106
Last time updated on 07/05/2019