IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v107y2000i2d10.1023_a1026422013954.html
   My bibliography  Save this article

On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems

Author

Listed:
  • K. A. Ariyawansa

    (Washington State University)

  • P. L. Jiang

    (Delta Dental Plan of Minnesota)

Abstract

Burke, Goldstein, Tseng, and Ye (Ref. 1) have presented an interesting interior-point algorithm for a class of smooth convex minimax problems. They have also presented a complexity analysis leading to a worst-case bound on the total work necessary to obtain a solution within a prescribed tolerance. In this paper, we present refinements to the analysis of Burke et al. which show that the resulting complexity bound can be worse than those for other algorithms available at the time Ref. 1 was published.

Suggested Citation

  • K. A. Ariyawansa & P. L. Jiang, 2000. "On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 107(2), pages 223-243, November.
    • Handle: RePEc:spr:joptap:v:107:y:2000:i:2:d:10.1023_a:1026422013954
    DOI: 10.1023/A:1026422013954
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1026422013954
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1026422013954?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Robert G. Bland & Donald Goldfarb & Michael J. Todd, 1981. "Feature Article—The Ellipsoid Method: A Survey," Operations Research, INFORMS, vol. 29(6), pages 1039-1091, December.
    2. Robert Mifflin, 1975. "Subproblem and Overall Convergence for a Method-of-Centers Algorithm," Operations Research, INFORMS, vol. 23(4), pages 796-809, August.
    3. Kurt M. Anstreicher, 1997. "On Vaidya's Volumetric Cutting Plane Method for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 63-89, February.
    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. E. Y. Pee & J. O. Royset, 2011. "On Solving Large-Scale Finite Minimax Problems Using Exponential Smoothing," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 390-421, February.

    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. V. Balakrishnan & R. L. Kashyap, 1999. "Robust Stability and Performance Analysis of Uncertain Systems Using Linear Matrix Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 457-478, March.
    2. Tanaka, Masato & Matsui, Tomomi, 2022. "Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games," Mathematical Social Sciences, Elsevier, vol. 115(C), pages 47-51.
    3. Yaguang Yang, 2013. "A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 859-873, September.
    4. Maxime C. Cohen & Ilan Lobel & Renato Paes Leme, 2020. "Feature-Based Dynamic Pricing," Management Science, INFORMS, vol. 66(11), pages 4921-4943, November.
    5. Zhang, Yufeng & Khani, Alireza, 2019. "An algorithm for reliable shortest path problem with travel time correlations," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 92-113.
    6. Paul Karaenke & Martin Bichler & Stefan Minner, 2019. "Coordination Is Hard: Electronic Auction Mechanisms for Increased Efficiency in Transportation Logistics," Management Science, INFORMS, vol. 65(12), pages 5884-5900, December.
    7. Simone A. Rocha & Thiago G. Mattos & Rodrigo T. N. Cardoso & Eduardo G. Silveira, 2022. "Applying Artificial Neural Networks and Nonlinear Optimization Techniques to Fault Location in Transmission Lines—Statistical Analysis," Energies, MDPI, vol. 15(11), pages 1-24, June.
    8. Kurt M. Anstreicher, 2000. "The Volumetric Barrier for Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 365-380, August.
    9. Robert M. Freund & Jorge R. Vera, 2009. "Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 869-879, November.
    10. Mehdi Karimi & Somayeh Moazeni & Levent Tunçel, 2018. "A Utility Theory Based Interactive Approach to Robustness in Linear Optimization," Journal of Global Optimization, Springer, vol. 70(4), pages 811-842, April.

    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:spr:joptap:v:107:y:2000:i:2:d:10.1023_a:1026422013954. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.