Decomposition approaches for constrained spatial auction market problems
From MaRDI portal
Publication:844131
DOI10.1007/s11067-008-9083-6zbMath1187.91078MaRDI QIDQ844131
Publication date: 18 January 2010
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-008-9083-6
variational inequalities; decomposition methods; alternating direction method; proximal method; spatial auction markets
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90B10: Deterministic network models in operations research
91B26: Auctions, bargaining, bidding and selling, and other market models
91B72: Spatial models in economics
Related Items
Combined methods for dynamic spatial auction market models, On penalty methods for non monotone equilibrium problems
Cites Work
- Equilibrium models and variational inequalities.
- Spatial price equilibrium: Advances in theory, computation and application. Papers presented at the Thirty-First North American Regional Science Association Meeting held at Denver, Colorado, USA, November 1984
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Constrained auction clearing in the Italian electricity market
- Network economics: a variational inequality approach
- Methods of descent for nondifferentiable optimization
- On variational inequalities for auction market problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Necessary and sufficient conditions for a penalty method to be exact
- Monotone Operators and the Proximal Point Algorithm
- Spatial Oligopolistic Electricity Models with Cournot Generators and Regulated Transmission Prices
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Optimal Offer Construction in Electricity Markets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
