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

On smooth reformulations and direct non-smooth computations for minimax problems

Author

Listed:
  • Ralph Kearfott
  • Sowmya Muniswamy
  • Yi Wang
  • Xinyu Li
  • Qian Wang

Abstract

Minimax problems can be approached by reformulating them into smooth problems with constraints or by dealing with the non-smooth objective directly. We focus on verified enclosures of all globally optimal points of such problems. In smooth problems in branch and bound algorithms, interval Newton methods can be used to verify existence and uniqueness of solutions, to be used in eliminating regions containing such solutions, and point Newton methods can be used to obtain approximate solutions for good upper bounds on the global optimum. We analyze smooth reformulation approaches, show weaknesses in them, and compare reformulation to solving the non-smooth problem directly. In addition to analysis and illustrative problems, we exhibit the results of numerical computations on various test problems. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Ralph Kearfott & Sowmya Muniswamy & Yi Wang & Xinyu Li & Qian Wang, 2013. "On smooth reformulations and direct non-smooth computations for minimax problems," Journal of Global Optimization, Springer, vol. 57(4), pages 1091-1111, December.
    • Handle: RePEc:spr:jglopt:v:57:y:2013:i:4:p:1091-1111
    DOI: 10.1007/s10898-012-0014-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-0014-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-0014-1?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. Ralph Kearfott, 2014. "On rigorous upper bounds to a global optimum," Journal of Global Optimization, Springer, vol. 59(2), pages 459-476, July.
    2. Hermann Schichl & Mihály Markót & Arnold Neumaier, 2014. "Exclusion regions for optimization problems," Journal of Global Optimization, Springer, vol. 59(2), pages 569-595, July.
    3. Ralph Kearfott, 2015. "Some observations on exclusion regions in branch and bound algorithms," Journal of Global Optimization, Springer, vol. 62(2), pages 229-241, June.

    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:57:y:2013:i:4:p:1091-1111. 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.