An interior-point method for the single-facility location problem with mixed norms using a conic formulation
type: Item
instance of: scholarly article
title: An interior-point method for the single-facility location problem with mixed norms using a conic formulation
zbMATH Open document ID: 1154.90005
author: Robert Chares
author: François Glineur
published in: Mathematical Methods of Operations Research
publication date: 2009-01-30T00:00:00Z
full work available at URL: coredp2007 71.pdf
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5500944
zbMATH Keywords: Nonsymmetric conic optimization
zbMATH Keywords: Conic reformulation
zbMATH Keywords: Sum of norm minimization
zbMATH Keywords: Single-facility location problems
zbMATH Keywords: Interior-point methods
MaRDI profile type: Publication
OpenAlex ID: W2161272973
cites work: An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Q4821526
cites work: Generalized goal programming: polynomial methods and applications
cites work: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
cites work: Solving convex location problems with gauges in polynomial time
cites work: An interior point method for multi-facility location problems with regions forbidden for placement
cites work: Proving strong duality for geometric optimization using a conic formulation
cites work: Conic formulation for \(l_p\)-norm optimization
cites work: Q4954403
cites work: A new polynomial-time algorithm for linear programming
cites work: On the Complexity of a Practical Interior-Point Method
cites work: Interior-point methods: An old and new approach to nonlinear programming
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: A mathematical view of interior-point methods in convex optimization
cites work: An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
cites work: An Efficient Algorithm for Minimizing a Sum of p-Norms
DOI: 10.1007/S00186-008-0225-X
description: scientific article; zbMATH DE number 5500944