An interior-point method for the single-facility location problem with mixed norms using a conic formulation

DOI10.1007/s00186-008-0225-xzbMath1154.90005OpenAlexW2161272973MaRDI QIDQ999133

Robert Chares, François Glineur

Publication date: 30 January 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.uclouvain.be/cps/ucl/doc/core/documents/coredp2007_71.pdf

zbMATH Keywords

Interior-point methodsConic reformulationNonsymmetric conic optimizationSingle-facility location problemsSum of norm minimization

Mathematics Subject Classification ID

Continuous location (90B85) Interior-point methods (90C51)

Related Items (1)

Differential properties of Euclidean projection onto power cone

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conic formulation for \(l_p\)-norm optimization
• A new polynomial-time algorithm for linear programming
• Interior-point methods: An old and new approach to nonlinear programming
• Generalized goal programming: polynomial methods and applications
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Lectures on Modern Convex Optimization
• On the Complexity of a Practical Interior-Point Method
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
• An Efficient Algorithm for Minimizing a Sum of p-Norms
• Proving strong duality for geometric optimization using a conic formulation

This page was built for publication: An interior-point method for the single-facility location problem with mixed norms using a conic formulation