A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation

Authors:
Jein-Shan Chen;Shaohua Pan;Chun-Hsu Ko
Affiliations:
Department of Mathematics, National Taiwan Normal University, Taipei, Taiwan 11677;School of Mathematical Sciences, South China University of Technology, Guangzhou, China 510640;Department of Electrical Engineering, I-Shou University, Kaohsiung, Taiwan 840
Venue:
Journal of Global Optimization
Year:
2011

Citing 21
Cited 0

Matrix analysis

Matrix analysis
NP-Hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands

Mathematics of Operations Research
A nonsmooth version of Newton's method

Mathematical Programming: Series A and B
Convergence analysis of some algorithms for solving nonsmooth equations

Mathematics of Operations Research
Solution of monotone complementarity problems with locally Lipschitzian functions

Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
Lectures on modern convex optimization: analysis, algorithms, and engineering applications

Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Smoothing Functions for Second-Order-Cone Complementarity Problems

SIAM Journal on Optimization
A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms

SIAM Journal on Optimization
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications

SIAM Journal on Optimization
Complementarity Functions and Numerical Experiments on Some Smoothing Newton Methods for Second-Order-Cone Complementarity Problems

Computational Optimization and Applications
Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems

Operations Research
Algorithmic approaches for solving the euclidean distance location and location-allocation problems

Algorithmic approaches for solving the euclidean distance location and location-allocation problems
A heuristic method for large-scale multi-facility location problems

Computers and Operations Research
Convex Optimization

Convex Optimization
A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems

SIAM Journal on Optimization
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem

Mathematics of Operations Research
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem

Mathematical Programming: Series A and B
Approximation Algorithms for Metric Facility Location Problems

SIAM Journal on Computing
A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions

Discrete Applied Mathematics
On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity

SIAM Journal on Optimization
A polynomial time dual algorithm for the Euclidean multifacility location problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a primal-dual continuation approach for the capacitated multi-facility Weber problem (CMFWP) based on its nonlinear second-order cone program (SOCP) reformulation. The main idea of the approach is to reformulate the CMFWP as a nonlinear SOCP with a nonconvex objective function, and then introduce a logarithmic barrier term and a quadratic proximal term into the objective to construct a sequence of convexified subproblems. By this, this class of nondifferentiable and nonconvex optimization problems is converted into the solution of a sequence of nonlinear convex SOCPs. In this paper, we employ the semismooth Newton method proposed in Kanzow et al. (SIAM Journal of Optimization 20:297---320, 2009) to solve the KKT system of the resulting convex SOCPs. Preliminary numerical results are reported for eighteen test instances, which indicate that the continuation approach is promising to find a satisfying suboptimal solution, even a global optimal solution for some test problems.