Milan Hladík's Publications:

On the efficient Gerschgorin inclusion usage in the global optimization $\alpha$BB method

Milan Hladík. On the efficient Gerschgorin inclusion usage in the global optimization αBB method. J. Glob. Optim., 61(2):235–253, 2015.

Download

[PDF] [gzipped postscript] [postscript] [HTML] 

Abstract

In this paper, we revisit the alpha-BB method for solving global optimization problems. We investigate optimality of the scaling vector used in Gerschgorin's inclusion theorem to calculate bounds on the eigenvalues of the Hessian matrix. We propose two heuristics to compute a good scaling vector d, and state three necessary optimality conditions for an optimal scaling vector. Since the scaling vectors calculated by the presented methods satisfy all three optimality conditions, they serve as cheap but efficient solutions. A small numerical study shows that they are practically always optimal.

BibTeX

@article{Hla2015c,
 author = "Milan Hlad\'{\i}k",
 title = "On the efficient {Gerschgorin} inclusion usage in the global optimization {$\alpha$BB} method",
 webtitle = "On the efficient Gerschgorin inclusion usage in the global optimization αBB method",
 journal = "J. Glob. Optim.",
 fjournal = "Journal of Global Optimization",
 volume = "61",
 number = "2",
 pages = "235-253",
 year = "2015",
 doi = "10.1007/s10898-014-0161-7",
 issn = "0925-5001",
 url = "https://doi.org/10.1007/s10898-014-0161-7",
 bib2html_dl_html = "https://link.springer.com/article/10.1007%2Fs10898-014-0161-7#",
bib2html_dl_pdf = "https://rdcu.be/cnoXV",
 abstract = "In this paper, we revisit the alpha-BB method for solving global optimization problems. We investigate optimality of the scaling vector used in Gerschgorin's inclusion theorem to calculate bounds on the eigenvalues of the Hessian matrix. We propose two heuristics to compute a good scaling vector d, and state three necessary optimality conditions for an optimal scaling vector. Since the scaling vectors calculated by the presented methods satisfy all three optimality conditions, they serve as cheap but efficient solutions. A small numerical study shows that they are practically always optimal.",
 keywords = "Global optimization; Eigenvalues; Hessian matrix; Convex relaxation",
}

Generated by bib2html.pl (written by Patrick Riley ) on Wed Feb 07, 2024 09:31:18