View : 15 Download: 0

Recognizing underlying sparsity in optimization

Title
Recognizing underlying sparsity in optimization
Authors
Kim S.Kojima M.Toint P.
Ewha Authors
김선영
SCOPUS Author ID
김선영scopus
Issue Date
2009
Journal Title
Mathematical Programming
ISSN
0025-5610JCR Link
Citation
vol. 119, no. 2, pp. 273 - 303
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
Exploiting sparsity is essential to improve the efficiency of solving large optimization problems. We present a method for recognizing the underlying sparsity structure of a nonlinear partially separable problem, and show how the sparsity of the Hessian matrices of the problem's functions can be improved by performing a nonsingular linear transformation in the space corresponding to the vector of variables. A combinatorial optimization problem is then formulated to increase the number of zeros of the Hessian matrices in the resulting transformed space, and a heuristic greedy algorithm is applied to this formulation. The resulting method can thus be viewed as a preprocessor for converting a problem with hidden sparsity into one in which sparsity is explicit. When it is combined with the sparse semidefinite programming relaxation by Waki et al. for polynomial optimization problems, the proposed method is shown to extend the performance and applicability of this relaxation technique. Preliminary numerical results are presented to illustrate this claim. © 2008 Springer-Verlag.
DOI
10.1007/s10107-008-0210-4
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE