Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem (Q2674925): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11424-022-0187-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4289886457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithm for robust resource allocation with polyhedral uncertain allocation parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed stochastic mirror descent algorithm for resource allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distributed Convex Optimization Under Inequality and Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Dual Gradient Tracking for Resource Allocation in Unbalanced Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Splitting Approach for Distributed Resource Allocation With Regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual subgradient method with averaging for optimal resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed stochastic mirror descent for strongly convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication-efficient algorithms for decentralized and stochastic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Linearized Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem
scientific article

    Statements

    Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem (English)
    0 references
    0 references
    0 references
    0 references
    14 September 2022
    0 references
    distributed resource allocation problem
    0 references
    mirror-descent algorithm
    0 references
    nonsmooth functions
    0 references

    Identifiers