Selective bi-coordinate variations for resource allocation type problems

DOI10.1007/S10589-016-9824-2zbMath1381.90085OpenAlexW2233850507MaRDI QIDQ301690

F. Blanchet-Sadri, M. Dambrine

Publication date: 1 July 2016

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-016-9824-2

zbMATH Keywords

optimization problemsresource allocationbi-coordinate descentdecentralized exchange mechanismlocal variations

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Production models (90B30) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Distributed algorithms (68W15)

Related Items (6)

A method of bi-coordinate variations with tolerances and its convergence ⋮ Selective bi-coordinate method for limit non-smooth resource allocation type problems ⋮ An almost cyclic 2-coordinate descent method for singly linearly constrained problems ⋮ Simplified versions of the conditional gradient method ⋮ Variational inequality type formulations of general market equilibrium problems with local information ⋮ A Coordinate Wise Variational Method with Tolerance Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel coordinate descent methods for big data optimization
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
• Distributed multi-agent optimization with state-dependent communication
• Equilibrium models and variational inequalities.
• Resource allocation in wireless networks. Theory and algorithms
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• Nonlinear programming and variational inequality problems. A unified approach
• Constrained auction clearing in the Italian electricity market
• A combined relaxation method for decomposable variational inequalities^*
• Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks

This page was built for publication: Selective bi-coordinate variations for resource allocation type problems