IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v46y1997i1p131-142.html
   My bibliography  Save this article

Simplices by point-sliding and the Yamnitsky-Levin algorithm

Author

Listed:
  • U. Faigle
  • M. Hunting
  • W. Kern
  • R. Prakash
  • K. Supowit

Abstract

Yamnitsky and Levin proposed a variant of Khachiyan's ellopsoid method for testing feasibility of systems of linear inequalities that also runs in polynomial time but uses simplices instead of ellipsoids. Starting with then-simplexS and the half-space {x¦a T x ≤ β}, the algorithm finds a simplexS YL of small volume that enclosesS ∩ {x¦a T x ≤ β}. We interpretS YL as a simplex obtainable by point-sliding and show that the smallest such simplex can be determined by minimizing a simple strictly convex function. We furthermore discuss some numerical results. The results suggest that the number of iterations used by our method may be considerably less than that of the standard ellipsoid method. Copyright Physica-Verlag 1997

Suggested Citation

  • U. Faigle & M. Hunting & W. Kern & R. Prakash & K. Supowit, 1997. "Simplices by point-sliding and the Yamnitsky-Levin algorithm," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 46(1), pages 131-142, February.
    • Handle: RePEc:spr:mathme:v:46:y:1997:i:1:p:131-142
    DOI: 10.1007/BF01199467
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01199467
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01199467?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. Frenk, J.B.G. & Gromicho, J.A.S. & Zhang, S., 1994. "A deep cut ellipsoid algorithm for convex programming," Econometric Institute Research Papers 11633, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    Full references (including those not matched with items on IDEAS)

    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. Komunjer, Ivana, 2005. "Quasi-maximum likelihood estimation for conditional quantiles," Journal of Econometrics, Elsevier, vol. 128(1), pages 137-164, September.
    2. Carrizosa, E. & Frenk, J.B.G., 1996. "Dominating Sets for Convex Functions with some Applications," Econometric Institute Research Papers EI 9657-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Da Tian, 2014. "An entire space polynomial-time algorithm for linear programming," Journal of Global Optimization, Springer, vol. 58(1), pages 109-135, January.
    4. E. Carrizosa & J. B. G. Frenk, 1998. "Dominating Sets for Convex Functions with Some Applications," Journal of Optimization Theory and Applications, Springer, vol. 96(2), pages 281-295, February.

    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:mathme:v:46:y:1997:i:1:p:131-142. 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.