How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results

János D. Pintér ()
Additional contact information
János D. Pintér: Lehigh University

Annals of Operations Research, 2018, vol. 265, issue 1, No 7, 119-141

Abstract: Abstract Nonlinear optimization (NLO) encompasses a vast range of problems, from very simple to theoretically intractable instances. For this reason, it is impossible to offer guaranteed—while practically meaningful—advice to users of NLO software. This issue becomes apparent, when facing exceptionally hard and/or previously unexplored NLO challenges. We propose a heuristic quadratic meta-model based approach, and suggest corresponding key option settings to use with the Lipschitz global optimizer (LGO) solver suite. These LGO option settings are directly related to estimating the sufficient computational effort to handle a broad range of NLO problems. The proposed option settings are evaluated experimentally, by solving (numerically) a representative set of NLO test problems which are based on real-world optimization applications and non-trivial academic challenges. Our tests include also a set of scalable optimization problems which are increasingly difficult to handle as the size of the model-instances increases. Based on our computational results, it is possible to offer generally valid, practical advice to LGO users. Arguably (and mutatis mutandis), comparable advice can be given to users of other NLO software products with a similarly broad mandate to LGO’s. An additional benefit of such aggregated tests is that their results can effectively assist the rapid evaluation and verification of NLO solver performance during software development phases.

Keywords: Nonlinear (global and local) optimization; Scalable heuristic meta-models of NLO problems; Software benchmarking; LGO solver suite; Test model collections and numerical results (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2518-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:265:y:2018:i:1:d:10.1007_s10479-017-2518-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2518-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().