A penalty-based method for communication-efficient decentralized bilevel programming
From MaRDI portal
Cites work
- A penalty function approach for solving bi-level linear programs
- A solution method for the static constrained Stackelberg problem via penalty method
- A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic
- Accelerated Dual Descent for Network Flow Optimization
- Bilevel programming in traffic planning: Models, methods and challenge
- Communication-efficient algorithms for decentralized and stochastic optimization
- DAdam: a consensus-based distributed adaptive gradient method for online optimization
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Distributed Subgradient Methods for Multi-Agent Optimization
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Fast linear iterations for distributed averaging
- Fastest Mixing Markov Chain on a Graph
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1163116 (Why is no real title available?)
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- scientific article; zbMATH DE number 7626760 (Why is no real title available?)
- Network Newton Distributed Optimization Methods
- On Nonconvex Decentralized Gradient Descent
- On the convergence of decentralized gradient descent
This page was built for publication: A penalty-based method for communication-efficient decentralized bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027373)
