Blocks of coordinates, stochastic programming, and markets
From MaRDI portal
Publication:1722745
DOI10.1007/s10287-018-0303-3OpenAlexW2789900030MaRDI QIDQ1722745
Publication date: 18 February 2019
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-018-0303-3
stochastic programmingconvolutionmarket equilibriumprojected gradientsbilateral matchingblock-coordinate methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bilateral exchange and competitive equilibrium
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- Bases, tools and principles for variational analysis
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Optimal scaling of a gradient method for distributed resource allocation
- A coordinate gradient descent method for nonsmooth separable minimization
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Distributed price adjustment based on convex analysis
- A quantitative comparison of risk measures
- Random block coordinate descent methods for linearly constrained optimization over networks
- Borch's theorem, equal margins, and efficient allocation
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Variational Analysis
- Bilateral Trading Processes, Pairwise Optimally, and Pareto Optimality
- DIRECT EXCHANGE IN LINEAR ECONOMIES
- Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks
This page was built for publication: Blocks of coordinates, stochastic programming, and markets
