On the convergence of the Cooper's algorithm
From MaRDI portal
Publication:2228419
DOI10.1007/S11590-020-01572-5zbMATH Open1460.90196OpenAlexW3012741977MaRDI QIDQ2228419FDOQ2228419
Authors: Ahmadreza Raeisi Dehkordi
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01572-5
Recommendations
- On Coates algorithm
- Convergence with probability one of stochastic approximation algorithms whose average is cooperative
- Convergence of \(r\)-algorithms
- On the convergence of descent algorithms
- Stochastic approximation algorithms with constant step size whose average is cooperative
- The convergence of Fletcher-Reeves algorithm
- Convergence of algorithms for problems of Landesman-Lazer type
- A convergence result for the \(B\)-algorithm
- Convergence of algorithms for perturbed optimization problems
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Convex Analysis
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- Heuristic Methods for Location-Allocation Problems
- A heuristic method for large-scale multi-facility location problems
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- A guided reactive GRASP for the capacitated multi-source Weber problem
- A cellular heuristic for the multisource Weber problem.
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- The optimal solution set of the multi-source Weber problem
Cited In (5)
- Title not available (Why is that?)
- Accelerating the convergence in the single-source and multi-source Weber problems
- A modified Cooper algorithm for large-scale multi-source Weber problem
- Location problems with costs being sums of powers of Euclidean distances
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
This page was built for publication: On the convergence of the Cooper's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228419)