Selective bi-coordinate variations for resource allocation type problems
DOI10.1007/S10589-016-9824-2zbMATH Open1381.90085OpenAlexW2233850507MaRDI QIDQ301690FDOQ301690
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
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
resource allocationoptimization problemsbi-coordinate descentdecentralized exchange mechanismlocal variations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel coordinate descent methods for big data optimization
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Nonlinear programming and variational inequality problems. A unified approach
- Title not available (Why is that?)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- Equilibrium models and variational inequalities.
- Distributed multi-agent optimization with state-dependent communication
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- Constrained auction clearing in the Italian electricity market
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equilibrium models for multi-commodity auction market problems
- A combined relaxation method for decomposable variational inequalities*
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks
- Resource allocation in wireless networks. Theory and algorithms
Cited In (6)
- 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
- A Coordinate Wise Variational Method with Tolerance Functions
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)
