Customized alternating direction methods of multipliers for generalized multi-facility Weber problem

DOI10.1007/s10957-022-02133-9zbMath1506.90140OpenAlexW4310276198MaRDI QIDQ2679571

Yibing Lv, Su Zhang, Yan Gu, Liyun Ling, Jian-lin Jiang

Publication date: 23 January 2023

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-022-02133-9

zbMATH Keywords

linearizationfacility locationalternating direction method of multipliersover-relaxationgeneralized multi-facility Weber problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A variational inequality approach for constrained multifacility Weber problem under gauge
• An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
• On the global and linear convergence of the generalized alternating direction method of multipliers
• A customized proximal point algorithm for convex minimization with linear constraints
• A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
• A sequential updating scheme of the Lagrange multiplier for separable convex programming
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Alternating Direction Method for Image Inpainting in Wavelet Domains
• 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
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• 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