Selective bi-coordinate variations for resource allocation type problems

DOI10.1007/S10589-016-9824-2MaRDI QIDQ301690zbMATH OpenOpenAlexFDO

Authors Igor V. Konnov

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

resource allocationoptimization problemsbi-coordinate descentdecentralized exchange mechanismlocal variations

Mathematics Subject Classification ID

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

Recommendations

• A method of bi-coordinate variations with tolerances and its convergence
• Selective bi-coordinate method for limit non-smooth resource allocation type problems
• A Coordinate Wise Variational Method with Tolerance Functions
• Composite optimization for the resource allocation problem
• scientific article; zbMATH DE number 3956810

Cites work

• scientific article; zbMATH DE number 1817778 (Why is no real title available?)
• scientific article; zbMATH DE number 3724232 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3487161 (Why is no real title available?)
• scientific article; zbMATH DE number 1786291 (Why is no real title available?)
• A combined relaxation method for decomposable variational inequalities^*
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
• Constrained auction clearing in the Italian electricity market
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• Distributed multi-agent optimization with state-dependent communication
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
• Equilibrium models and variational inequalities.
• Equilibrium models for multi-commodity auction market problems
• Nonlinear programming and variational inequality problems. A unified approach
• Parallel coordinate descent methods for big data optimization
• Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks
• Resource allocation in wireless networks. Theory and algorithms
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301690)