IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v30y2004i2p285-300.html
   My bibliography  Save this article

Convergence Properties of Dikin’s Affine Scaling Algorithm for Nonconvex Quadratic Minimization

Author

Listed:
  • Paul Tseng

Abstract

No abstract is available for this item.

Suggested Citation

  • Paul Tseng, 2004. "Convergence Properties of Dikin’s Affine Scaling Algorithm for Nonconvex Quadratic Minimization," Journal of Global Optimization, Springer, vol. 30(2), pages 285-300, November.
    • Handle: RePEc:spr:jglopt:v:30:y:2004:i:2:p:285-300
    DOI: 10.1007/s10898-004-8276-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-004-8276-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-004-8276-x?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. Takashi Tsuchiya, 1992. "Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems," Mathematics of Operations Research, INFORMS, vol. 17(3), pages 527-557, August.
    2. I. I. Dikin & C. Roos, 1997. "Convergence of the Dual Variables for the Primal Affine Scaling Method with Unit Steps in the Homogeneous Case," Journal of Optimization Theory and Applications, Springer, vol. 95(2), pages 305-321, November.
    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. William Hager & Hongchao Zhang, 2014. "An affine scaling method for optimization problems with polyhedral constraints," Computational Optimization and Applications, Springer, vol. 59(1), pages 163-183, October.

    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. Dax, Achiya, 2006. "The l1 solution of linear inequalities," Computational Statistics & Data Analysis, Elsevier, vol. 50(1), pages 40-60, January.
    2. Fabio Vitor & Todd Easton, 2022. "Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming," Computational Optimization and Applications, Springer, vol. 83(1), pages 211-246, September.

    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:jglopt:v:30:y:2004:i:2:p:285-300. 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.