IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/2078.html
   My bibliography  Save this paper

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

Author

Listed:
  • CHARES, Robert
  • GLINEUR, François

Abstract

We consider the single-facility location problem with mixed norms, i.e. the problem of minimizing the sum of the distances from a point to a set of fixed points in $${\mathbb{R}^n}$$ , where each distance can be measured according to a different p-norm. We show how this problem can be expressed into a structured conic format by decomposing the nonlinear components of the objective into a series of constraints involving three-dimensional cones. Using the availability of a self-concordant barrier for these cones, we present a polynomial-time algorithm (a long-step path-following interior-point scheme) to solve the problem up to any given accuracy. Finally, we report computational results for this algorithm and compare with standard nonlinear optimization solvers applied to this problem. Copyright Springer-Verlag 2008
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • CHARES, Robert & GLINEUR, François, 2009. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," LIDAM Reprints CORE 2078, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvrp:2078
    DOI: 10.1007/s00186-008-0225-x
    Note: In : Mathematical Methods of Operations Research, 68, 383-405, 2008
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. F. Glineur & T. Terlaky, 2004. "Conic Formulation for l p -Norm Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(2), pages 285-307, August.
    2. Yu. E. Nesterov & M. J. Todd, 1997. "Self-Scaled Barriers and Interior-Point Methods for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 1-42, February.
    3. repec:cor:louvrp:-1726 is not listed on IDEAS
    4. François Glineur, 2001. "Proving Strong Duality for Geometric Optimization Using a Conic Formulation," Annals of Operations Research, Springer, vol. 105(1), pages 155-184, July.
    5. NESTEROV, Yu., 2006. "Towards nonsymmetric conic optimization," LIDAM Discussion Papers CORE 2006028, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Le Hien, 2015. "Differential properties of Euclidean projection onto power cone," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 265-284, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. NESTEROV, Yu., 2006. "Constructing self-concordant barriers for convex cones," LIDAM Discussion Papers CORE 2006030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Krokhmal, Pavlo A. & Soberanis, Policarpio, 2010. "Risk optimization with p-order conic constraints: A linear programming approach," European Journal of Operational Research, Elsevier, vol. 201(3), pages 653-671, March.
    3. F. Glineur & T. Terlaky, 2004. "Conic Formulation for l p -Norm Optimization," Journal of Optimization Theory and Applications, Springer, vol. 122(2), pages 285-307, August.
    4. Yue Lu & Ching-Yu Yang & Jein-Shan Chen & Hou-Duo Qi, 2020. "The decompositions with respect to two core non-symmetric cones," Journal of Global Optimization, Springer, vol. 76(1), pages 155-188, January.
    5. Chee-Khian Sim, 2019. "Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence," Computational Optimization and Applications, Springer, vol. 74(2), pages 583-621, November.
    6. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Other publications TiSEM 949fb20a-a2c6-4d87-85ea-8, Tilburg University, School of Economics and Management.
    7. B.V. Halldórsson & R.H. Tütüncü, 2003. "An Interior-Point Method for a Class of Saddle-Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 559-590, March.
    8. G. Q. Wang & Y. Q. Bai, 2012. "A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 966-985, September.
    9. G. Q. Wang & L. C. Kong & J. Y. Tao & G. Lesaja, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 588-604, August.
    10. E. A. Yıldırım, 2003. "An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 649-676, November.
    11. Vasile L. Basescu & John E. Mitchell, 2008. "An Analytic Center Cutting Plane Approach for Conic Programming," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 529-551, August.
    12. G. Q. Wang & Y. Q. Bai & X. Y. Gao & D. Z. Wang, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Interior-Point Methods for Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 242-262, April.
    13. J.F. Sturm & S. Zhang, 1998. "On Sensitivity of Central Solutions in Semidefinite Programming," Tinbergen Institute Discussion Papers 98-040/4, Tinbergen Institute.
    14. Mehdi Karimi & Levent Tunçel, 2020. "Primal–Dual Interior-Point Methods for Domain-Driven Formulations," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 591-621, May.
    15. Changhe Liu & Hongwei Liu, 2012. "A new second-order corrector interior-point algorithm for semidefinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 75(2), pages 165-183, April.
    16. Behrouz Kheirfam, 2015. "A Corrector–Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 246-260, January.
    17. Renato D. C. Monteiro & Paulo R. Zanjácomo, 2000. "General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 381-399, August.
    18. Quoc Tran-Dinh & Anastasios Kyrillidis & Volkan Cevher, 2018. "A Single-Phase, Proximal Path-Following Framework," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1326-1347, November.
    19. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Discussion Paper 2001-27, Tilburg University, Center for Economic Research.
    20. Jinchuan Zhou & Yu-Lin Chang & Jein-Shan Chen, 2015. "The H-differentiability and calmness of circular cone functions," Journal of Global Optimization, Springer, vol. 63(4), pages 811-833, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvrp:2078. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.