IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v71y2018i1d10.1007_s10589-018-0019-x.html
   My bibliography  Save this article

Introduction to the special issue for SIMAI 2016

Author

Listed:
  • Valeria Ruggiero

    (University of Ferrara)

  • Gerardo Toraldo

    (Università degli Studi di Napoli Federico II)

Abstract

No abstract is available for this item.

Suggested Citation

  • Valeria Ruggiero & Gerardo Toraldo, 2018. "Introduction to the special issue for SIMAI 2016," Computational Optimization and Applications, Springer, vol. 71(1), pages 1-3, September.
    • Handle: RePEc:spr:coopap:v:71:y:2018:i:1:d:10.1007_s10589-018-0019-x
    DOI: 10.1007/s10589-018-0019-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-018-0019-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-018-0019-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. S. Bonettini & M. Prato & S. Rebegoldi, 2018. "A block coordinate variable metric linesearch based proximal gradient method," Computational Optimization and Applications, Springer, vol. 71(1), pages 5-52, September.
    2. Leopoldo Marini & Benedetta Morini & Margherita Porcelli, 2018. "Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications," Computational Optimization and Applications, Springer, vol. 71(1), pages 147-170, September.
    3. Andrea Manno & Laura Palagi & Simone Sagratella, 2018. "Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training," Computational Optimization and Applications, Springer, vol. 71(1), pages 115-145, September.
    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. Silvia Bonettini & Peter Ochs & Marco Prato & Simone Rebegoldi, 2023. "An abstract convergence framework with application to inertial inexact forward–backward methods," Computational Optimization and Applications, Springer, vol. 84(2), pages 319-362, March.
    2. Fabiana R. Oliveira & Orizon P. Ferreira & Gilson N. Silva, 2019. "Newton’s method with feasible inexact projections for solving constrained generalized equations," Computational Optimization and Applications, Springer, vol. 72(1), pages 159-177, January.
    3. Bonettini, S. & Prato, M. & Rebegoldi, S., 2021. "New convergence results for the inexact variable metric forward–backward method," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    4. Jiaxi Wang & Wei Ouyang, 2022. "Newton’s Method for Solving Generalized Equations Without Lipschitz Condition," Journal of Optimization Theory and Applications, Springer, vol. 192(2), pages 510-532, February.
    5. Andrea Cristofari, 2019. "An almost cyclic 2-coordinate descent method for singly linearly constrained problems," Computational Optimization and Applications, Springer, vol. 73(2), pages 411-452, June.
    6. Tommaso Colombo & Simone Sagratella, 2020. "Distributed algorithms for convex problems with linear coupling constraints," Journal of Global Optimization, Springer, vol. 77(1), pages 53-73, May.
    7. Wei Ouyang & Kui Mei, 2023. "A General Iterative Procedure for Solving Nonsmooth Constrained Generalized Equations," Mathematics, MDPI, vol. 11(22), pages 1-17, November.

    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:spr:coopap:v:71:y:2018:i:1:d:10.1007_s10589-018-0019-x. 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.