IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v54y2013i1p77-91.html
   My bibliography  Save this article

An acceleration scheme for cyclic subgradient projections method

Author

Listed:
  • Touraj Nikazad

    ()

  • Mokhtar Abbasi

    ()

Abstract

An algorithm for solving convex feasibility problem for a finite family of convex sets is considered. The acceleration scheme of De Pierro (em Methodos de projeção para a resolução de sistemas gerais de equações algébricas lineares. Thesis (tese de Doutoramento), Instituto de Matemática da UFRJ, Cidade Universitária, Rio de Janeiro, Brasil, 1981 ), which is designed for simultaneous algorithms, is used in the algorithm to speed up the fully sequential cyclic subgradient projections method. A convergence proof is presented. The advantage of using this strategy is demonstrated with some examples. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • Touraj Nikazad & Mokhtar Abbasi, 2013. "An acceleration scheme for cyclic subgradient projections method," Computational Optimization and Applications, Springer, vol. 54(1), pages 77-91, January.
  • Handle: RePEc:spr:coopap:v:54:y:2013:i:1:p:77-91 DOI: 10.1007/s10589-012-9490-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-012-9490-y
    Download Restriction: Access to full text is restricted to subscribers.

    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. C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, pages 681-689.
    2. Jacob, Nancy L, 1974. "A Limited-Diversification Portfolio Selection Model for the Small Investor," Journal of Finance, American Finance Association, vol. 29(3), pages 847-856, June.
    3. Nitin R. Patel & Marti G. Subrahmanyam, 1982. "A Simple Algorithm for Optimal Portfolio Selection with Fixed Transaction Costs," Management Science, INFORMS, pages 303-314.
    4. Mansini, Renata & Speranza, Maria Grazia, 1999. "Heuristic algorithms for the portfolio selection problem with minimum transaction lots," European Journal of Operational Research, Elsevier, vol. 114(2), pages 219-233, April.
    Full references (including those not matched with items on IDEAS)

    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:coopap:v:54:y:2013:i:1:p:77-91. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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.

    We have no references for this item. You can help adding them by using 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.