liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
On a Reformulation of Mathematical Programs with Cardinality Constraints
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0003-1836-4200
University of Würzburg, Germany. (Institute of Mathematics)
Technical University of Darmstadt, Germany.
2015 (English)In: Advances in Global Optimization / [ed] David Gao, Ning Ruan and Wenxun Xing, Switzerland: Springer International Publishing , 2015, 3-14 p.Chapter in book (Refereed)
Abstract [en]

Mathematical programs with cardinality constraints are optimization problems with an additional constraint which requires the solution to be sparse in the sense that the number of nonzero elements, i.e. the cardinality, is bounded by a given constant. Such programs can be reformulated as a mixed-integer ones in which the sparsity is modeled with the use of complementarity-type constraints. It is shown that the standard relaxation of the integrality leads to a nonlinear optimization program of the striking property that its solutions (global minimizers) are the same as the solutions of the original program with cardinality constraints. Since the number of local minimizers of the relaxed program is typically larger than the number of local minimizers of the cardinality-constrained problem, the relationship between the local minimizers is also discussed in detail. Furthermore, we show under which assumptions the standard KKT conditions are necessary optimality conditions for the relaxed program. The main result obtained for such conditions is significantly different from the existing optimality conditions that are known for the somewhat related class of mathematical programs with complementarity constraints.

Place, publisher, year, edition, pages
Switzerland: Springer International Publishing , 2015. 3-14 p.
, Springer Proceedings in Mathematics & Statistics, ISSN 2194-1009 ; 95
Keyword [en]
Cardinality constraints, global minima, local minima, stationary points, M-stationarity, relaxation, regularization method
National Category
Computational Mathematics
URN: urn:nbn:se:liu:diva-112131DOI: 10.1007/978-3-319-08377-3_1ISI: 000357801400001ISBN: 978-3-319-08376-6 (print)ISBN: 978-3-319-08377-3 (online)OAI: diva2:763725
Available from: 2014-11-17 Created: 2014-11-17 Last updated: 2015-08-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textFind book in another country/Hitta boken i ett annat land

Search in DiVA

By author/editor
Burdakov, Oleg
By organisation
Optimization The Institute of Technology
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 624 hits
ReferencesLink to record
Permanent link

Direct link