@InBook{Hansen1995,
    author      = {Hansen, Pierre and Jaumard, Brigitte},
    title       = {Lipschitz Optimization},
    address     = {Boston, MA},
    booktitle   = {Handbook of Global Optimization},
    doi         = {10.1007/978-1-4615-2025-2_9},
    editor      = {Horst, Reiner and Pardalos, Panos M.},
    isbn        = {978-1-4615-2025-2},
    pages       = {407--493},
    publisher   = {Springer US},
    url         = {https://doi.org/10.1007/978-1-4615-2025-2_9},
    year        = {1995},
    abstract    = {Lipschitz optimization solves global optimization problems in which the objective function and constraint left-hand sides may be given by oracles (or explicitly) and have a bounded slope. The problems of finding an optimal solution, an $\epsilon$-optimal one, all optimal solutions, and a small volume enclosure of all optimal solutions within hyperrectangles (possibly containing only a-optimal points) are investigated. In the univariate case, necessary conditions for finite convergence are studied as well as bounds on the number of iterations and convergence of e-optimal algorithms. Methods of Piyayskii, Evtushenko, Timonov, Schoen, Galperin, Shen and Zhu, and Hansen, Jaumard and Lu are discussed and compared experimentally. The same is done in the multivariate case for the algorithms of Piyayskii; Mladineo; Jaumard, Herrmann and Ribault; Pinter; Galperin; Meewella and Mayne; Wood; Gourdin, Hansen and Jaumard.}
}

{"_id":"vh3DiiXFHv5pQTWEp","bibbaseid":"hansen-jaumard-lipschitzoptimization-1995","author_short":["Hansen, P.","Jaumard, B."],"bibdata":{"bibtype":"inbook","type":"inbook","author":[{"propositions":[],"lastnames":["Hansen"],"firstnames":["Pierre"],"suffixes":[]},{"propositions":[],"lastnames":["Jaumard"],"firstnames":["Brigitte"],"suffixes":[]}],"title":"Lipschitz Optimization","address":"Boston, MA","booktitle":"Handbook of Global Optimization","doi":"10.1007/978-1-4615-2025-2_9","editor":[{"propositions":[],"lastnames":["Horst"],"firstnames":["Reiner"],"suffixes":[]},{"propositions":[],"lastnames":["Pardalos"],"firstnames":["Panos","M."],"suffixes":[]}],"isbn":"978-1-4615-2025-2","pages":"407–493","publisher":"Springer US","url":"https://doi.org/10.1007/978-1-4615-2025-2_9","year":"1995","abstract":"Lipschitz optimization solves global optimization problems in which the objective function and constraint left-hand sides may be given by oracles (or explicitly) and have a bounded slope. The problems of finding an optimal solution, an $ε$-optimal one, all optimal solutions, and a small volume enclosure of all optimal solutions within hyperrectangles (possibly containing only a-optimal points) are investigated. In the univariate case, necessary conditions for finite convergence are studied as well as bounds on the number of iterations and convergence of e-optimal algorithms. Methods of Piyayskii, Evtushenko, Timonov, Schoen, Galperin, Shen and Zhu, and Hansen, Jaumard and Lu are discussed and compared experimentally. The same is done in the multivariate case for the algorithms of Piyayskii; Mladineo; Jaumard, Herrmann and Ribault; Pinter; Galperin; Meewella and Mayne; Wood; Gourdin, Hansen and Jaumard.","bibtex":"@InBook{Hansen1995,\n author = {Hansen, Pierre and Jaumard, Brigitte},\n title = {Lipschitz Optimization},\n address = {Boston, MA},\n booktitle = {Handbook of Global Optimization},\n doi = {10.1007/978-1-4615-2025-2_9},\n editor = {Horst, Reiner and Pardalos, Panos M.},\n isbn = {978-1-4615-2025-2},\n pages = {407--493},\n publisher = {Springer US},\n url = {https://doi.org/10.1007/978-1-4615-2025-2_9},\n year = {1995},\n abstract = {Lipschitz optimization solves global optimization problems in which the objective function and constraint left-hand sides may be given by oracles (or explicitly) and have a bounded slope. The problems of finding an optimal solution, an $\\epsilon$-optimal one, all optimal solutions, and a small volume enclosure of all optimal solutions within hyperrectangles (possibly containing only a-optimal points) are investigated. In the univariate case, necessary conditions for finite convergence are studied as well as bounds on the number of iterations and convergence of e-optimal algorithms. Methods of Piyayskii, Evtushenko, Timonov, Schoen, Galperin, Shen and Zhu, and Hansen, Jaumard and Lu are discussed and compared experimentally. The same is done in the multivariate case for the algorithms of Piyayskii; Mladineo; Jaumard, Herrmann and Ribault; Pinter; Galperin; Meewella and Mayne; Wood; Gourdin, Hansen and Jaumard.}\n}\n\n","author_short":["Hansen, P.","Jaumard, B."],"editor_short":["Horst, R.","Pardalos, P. M."],"key":"Hansen1995","id":"Hansen1995","bibbaseid":"hansen-jaumard-lipschitzoptimization-1995","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-1-4615-2025-2_9"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inbook","biburl":"https://raw.githubusercontent.com/mdolab/bib-file/refs/heads/master/mdolab.bib","dataSources":["qAPjQpsx8e9aJNrSa"],"keywords":[],"search_terms":["lipschitz","optimization","hansen","jaumard"],"title":"Lipschitz Optimization","year":1995}