ADMM-type methods for generalized multi-facility Weber problem

DOI10.3934/jimo.2020171zbMath1499.90235OpenAlexW3110359805MaRDI QIDQ2076464

Yibing Lv, Shun Zhang, Yuzhen Guo, Su Zhang, Jian-lin Jiang

Publication date: 16 February 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020171

zbMATH Keywords

singularitygaugealternating direction method of multiplierslocational constraintsmulti-facility Weber problem

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85) Nonlinear programming (90C30)

Uses Software

• RASL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Alternating direction augmented Lagrangian methods for semidefinite programming
• A unified primal-dual algorithm framework based on Bregman iteration
• A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
• Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
• Lectures on numerical methods for non-linear variational problems
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A variational inequality approach for constrained multifacility Weber problem under gauge
• Optimally linearizing the alternating direction method of multipliers for convex programming
• An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
• Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
• Locating a central hunter on the plane
• A customized proximal point algorithm for convex minimization with linear constraints
• A sequential updating scheme of the Lagrange multiplier for separable convex programming
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Using Block Norms for Location Modeling
• Mathematical Models of Road Travel Distances
• On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem
• On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem
• Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
• The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
• A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
• Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
• Link-Length Minimization in Networks
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions