A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
From MaRDI portal
Publication:645558
DOI10.1007/s10898-010-9632-7zbMath1279.90133OpenAlexW2016363262MaRDI QIDQ645558
Chun-Hsu Ko, Jein-Shan Chen, Shaohua Pan
Publication date: 8 November 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9632-7
nonconvexsemismooth Newton methodnondifferentiablecapacitated multi-facility Weber problemsecond-order cone program
Related Items (2)
Global optimization algorithm for capacitated multi-facility continuous location-allocation problems ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of second-order cone programming
- Convexification procedures and decomposition methods for nonconvex optimization problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Second-order cone programming
- A heuristic method for large-scale multi-facility location problems
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- A nonsmooth version of Newton's method
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
- Lectures on Modern Convex Optimization
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A quadratically convergent method for minimizing a sum of euclidean norms
- Approximation Algorithms for Metric Facility Location Problems
- New heuristic methods for the capacitated multi-facility Weber problem
- Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
- Matrix Analysis
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- The facility location problem with general cost functions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- The Transportation-Location Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
This page was built for publication: A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
