Abstract
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 some preliminary results of computational tests.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
