Skip to main content
SpringerLink
Log in

DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm

  • Conference paper
Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 14))

Abstract

We propose a new solution for a class of nonconvex programs involving l 0 norm. Our method is based on a reformulation of these programs as bilevel programs, in which the objective function in the first level program is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a linear programming problem. Exact penalty techniques are then used to reformulate the obtained programs as DC programs. The resulted problems are then handled by the local algorithm DCA in DC programming. Preliminary computational results are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Weston, J., Elisseeff, A., Schölkopf, B., Tipping, M.: Use of the zero−norm with linear models and kernel methods. Journal of Machine Learning Research 3, 1439–1461 (2003)

    MathSciNet  MATH  Google Scholar 

  2. Neumann, J., Schnörr, C., Steidl, G.: Combined SVM-based Feature Selection and classification. Machine Learning 61, 129–150 (2005)

    Article  MATH  Google Scholar 

  3. Schnörr, C.: Signal and image approximation with level-set constraints. Computing 81, 137–160 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Le Thi, H.A., Pham Dinh, T., Le Dung, M.: Exact Penalty in DC Programming. Vietnam Journal of Mathematics 27(2), 169–179 (1999)

    MathSciNet  MATH  Google Scholar 

  5. Le Thi, H.A., Pham Dinh, T., Huynh Van, N.: Exact Penalty Techniques in DC Programming, Research Report, National Institute for Applied Sciences, Rouen (submitted, 2004)

    Google Scholar 

  6. Luo, Z.-Q., Pang, J.-S., Ralph, D., Wu, S.-Q.: Exact Penalization and Stationarity Conditions of Mathematical Programs with Equilibrium Constraints. Mathematical Programming 75, 19–76 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Pham Dinh, T., Le Thi, H.A.: Convex Analysis Approaches to DC Programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica 22(1), 287–367 (1997)

    Google Scholar 

  8. Rockafellar, R.T.: Convex Analysis. Princeton University Press, N.J (1970)

    Book  MATH  Google Scholar 

  9. Vicente, L.N., Calamai, P.H.: Bilevel and Multilevel Programming: A Bibliography Review. Journal of Global Optimization 5, 291–306 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  10. Amaldi, E., Kann., V.: On the approximability of minimizing non zero variables or unsatisfied relations in linear systems. Theoretical Computer Science 209, 237–260 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Proceeding of International Conference on Machina Learning ICML 2008 (2008)

    Google Scholar 

  12. Thiao, M., Pham Dinh, T., Le Thi, H.A.: Exact reformulations for a class of problems dealing l 0 norm. Technical report, L.M.I INSA of Rouen (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Modelling, Optimization and Operations Research, LMI, National Institute for Applied Sciences - Rouen, BP 08, Place Emile Blondel, F 76131, Mont Saint Aignan Cedex, France

    Mamadou Thiao & Tao Pham Dinh

  2. Laboratory of Theoretical and Applied Computer Science, UFR MIM, Metz University, Ile du Saulcy, 57045, Metz, France

    Hoai An Le Thi

Authors
  1. Mamadou Thiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tao Pham Dinh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hoai An Le Thi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, UFR MIM,, Paul Verlaine University of Metz, Metz, France

    Hoai An Le Thi

  2. Faculty of Sciences, Technology and Communications, University of Luxembourg, Luxembourg

    Pascal Bouvry

  3. Laboratory of Mathematics, National Institute for Applied Sciences, Rouen Mont, Saint Aignan, France

    Tao Pham Dinh

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thiao, M., Pham Dinh, T., Le Thi, H.A. (2008). DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87477-5_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87476-8

  • Online ISBN: 978-3-540-87477-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation