An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
From MaRDI portal
Publication:2307752
Recommendations
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- New numerical methods for Weber problem based on alternating direction method of multipliers
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- On the convergence of the Cooper's algorithm
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A generalized Weiszfeld method for the multi-facility location problem
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A heuristic method for large-scale multi-facility location problems
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- A note on Fermat's problem
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- A proximal point algorithm for log-determinant optimization with group Lasso regularization
- A sequential updating scheme of the Lagrange multiplier for separable convex programming
- Alternating direction method with Gaussian back substitution for separable convex programming
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Heuristic Methods for Location-Allocation Problems
- Mathematical Models of Road Travel Distances
- Multi-source facility location-allocation and inventory problem
- Multiplier and gradient methods
- On the Complexity of Some Common Geometric Location Problems
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Signal Recovery by Proximal Forward-Backward Splitting
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Using Block Norms for Location Modeling
Cited in
(12)- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
- ADMM-type methods for generalized multi-facility Weber problem
- Distributionally robust Weber problem with uncertain demand
- Un algorithme pour résoudre une famille de problèmes de localisation multisources
- New numerical methods for Weber problem based on alternating direction method of multipliers
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- Poisson noise removal based on non-convex hybrid regularizers
- A generalized \(k\)-means problem for clustering and an ADMM-based \(k\)-means algorithm
- A variational inequality approach for constrained multifacility Weber problem under gauge
This page was built for publication: An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307752)
