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

Incorporating minimum Frobenius norm models in direct search

Author

Listed:
  • A. Custódio
  • H. Rocha
  • L. Vicente

Abstract

No abstract is available for this item.

Suggested Citation

  • A. Custódio & H. Rocha & L. Vicente, 2010. "Incorporating minimum Frobenius norm models in direct search," Computational Optimization and Applications, Springer, vol. 46(2), pages 265-278, June.
    • Handle: RePEc:spr:coopap:v:46:y:2010:i:2:p:265-278
    DOI: 10.1007/s10589-009-9283-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-009-9283-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-009-9283-0?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Árpád Bűrmen & Jernej Olenšek & Tadej Tuma, 2015. "Mesh adaptive direct search with second directional derivative-based Hessian update," Computational Optimization and Applications, Springer, vol. 62(3), pages 693-715, December.
    2. C. P. Brás & A. L. Custódio, 2020. "On the use of polynomial models in multiobjective directional direct search," Computational Optimization and Applications, Springer, vol. 77(3), pages 897-918, December.
    3. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    4. Sander Dedoncker & Wim Desmet & Frank Naets, 2021. "Generating set search using simplex gradients for bound-constrained black-box optimization," Computational Optimization and Applications, Springer, vol. 79(1), pages 35-65, May.
    5. László Pál, 2017. "Empirical study of the improved UNIRANDI local search method," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 929-952, December.
    6. He, Fang & Yin, Yafeng & Chen, Zhibin & Zhou, Jing, 2015. "Pricing of parking games with atomic players," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 1-12.
    7. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    8. Y. Diouane & S. Gratton & L. Vicente, 2015. "Globally convergent evolution strategies for constrained optimization," Computational Optimization and Applications, Springer, vol. 62(2), pages 323-346, November.
    9. Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong & Yang, Hai, 2012. "Design of more equitable congestion pricing and tradable credit schemes for multimodal transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1273-1287.
    10. Charles Audet & Michael Kokkolaras & Sébastien Le Digabel & Bastien Talgorn, 2018. "Order-based error for managing ensembles of surrogates in mesh adaptive direct search," Journal of Global Optimization, Springer, vol. 70(3), pages 645-675, March.
    11. Charles Audet & Sébastien Le Digabel & Renaud Saltet, 2022. "Quantifying uncertainty with ensembles of surrogates for blackbox optimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 29-66, September.
    12. Eric Newby & M. Ali, 2015. "A trust-region-based derivative free algorithm for mixed integer programming," Computational Optimization and Applications, Springer, vol. 60(1), pages 199-229, January.

    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:46:y:2010:i:2:p:265-278. 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.

    We have no bibliographic 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.

    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.