Skip to main content
SpringerLink
Log in

A Smoothing Support Vector Machine Based on Exact Penalty Function

  • Conference paper
Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3801))

Included in the following conference series:

Abstract

In this paper, we study a smoothing support vector machine (SVM) by using exact penalty function. First, we formulate the optimization problem of SVM as an unconstrained and nonsmooth optimization problem via exact penalty function. Second, we propose a two-order differentiable function to approximately smooth the exact penalty function, and get an unconstrained and smooth optimization problem. Third, by error analysis, we can get approximate solution of SVM by solving its approximately smooth penalty optimization problem without constraint. Compared with artificial neural network and time sequence, the precision of prediction of our smoothing SVM which is illustrated with the numerical experiment is better.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Burges, C.J.C.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2, 121–167 (1998)

    Article  Google Scholar 

  2. Lee, K.L., Billings, S.A.: Time series prediction using support vector machines, the orthogonal and the regularized orthogonal least-squares algorithms. International Journal of Systems Science 33, 811–811 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Yuh-Jye Lee, E., Mangasarin, O.L.: SSVM: A Smooth Support Vector Machine for Classification. Computational Optimization and Applications 20, 5–22 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Quan, Y., Yang, J.: An Improved Parameter Tuning Method for Support Vector Machines. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 607–610. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Zenios, S.A., Pinar, M.C., Dembo, R.S.: A smooth penalty function algorithm for network-structured problems. European Journal of Operation Research 64, 258–277 (1993)

    Article  Google Scholar 

  6. Meng, Z.Q., Dang, C.Y., Zhou, G., Zhu, Y., Jiang, M.: A New Neural Network for Nonlinear Constrained Optimization Problems. In: Yin, F.-L., Wang, J., Guo, C. (eds.) ISNN 2004. LNCS, vol. 3173, pp. 406–412. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Yang, X.Q., Meng, Z.Q., Huang, X.X., Pong, G.T.Y.: Smoothing nonlinear penalty functions for constrained optimization. Numerical Functional Analysis Optimization 24, 351–364 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Rubinov, A.M., Glover, B.M., Yang, X.Q.: Decreasing functions with applications to penalization, SIAM Journal. Optimization 10, 289–313 (1999)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Business and Administration, Zhejiang University of Technology, Zhejiang, 310032, China

    Zhiqing Meng, Gengui Zhou & Yihua Zhu

  2. College of Information Engineering, Xiangtan University, Hunan, 411105, China

    Lifang Peng

Authors
  1. Zhiqing Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gengui Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yihua Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lifang Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yuping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security (Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meng, Z., Zhou, G., Zhu, Y., Peng, L. (2005). A Smoothing Support Vector Machine Based on Exact Penalty Function. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_83

Download citation

  • DOI: https://doi.org/10.1007/11596448_83

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation