IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i2d10.1007_s10878-024-01250-7.html
   My bibliography  Save this article

An $$L_2$$ L 2 regularization reduced quadratic surface support vector machine model

Author

Listed:
  • Jiguang Wang

    (Nanjing University)

  • Fangfang Guo

    (Dalian University of Technology)

  • Jie Shen

    (Liaoning Normal University)

Abstract

In this paper, a reduced quadratic surface support vector machine (RQSSVM) classification model is proposed and solved using the augmented Lagrange method. The new model can effectively handle nonlinearly separable data without kernel function selection and parameter tuning due to its quadratic surface segmentation facility. Meanwhile, the maximum margin term is replaced by an $$L_2$$ L 2 regularization term and the Hessian of the quadratic surface is reduced to a diagonal matrix. This simplification significantly reduces the number of decision variables and improves computational efficiency. The $$L_1$$ L 1 loss function is used to transform the problem into a convex composite optimization problem. Then the transformed problem is solved by the Augmented Lagrange method and the non-smoothness of the subproblems is handled by the semi-smooth Newton algorithm. Numerical experiments on artificial and public benchmark datasets show that RQSSVM model not only inherits the superior performance of quadratic surface SVM for segmenting nonlinear surfaces, but also significantly improves the segmentation speed and efficiency.

Suggested Citation

  • Jiguang Wang & Fangfang Guo & Jie Shen, 2025. "An $$L_2$$ L 2 regularization reduced quadratic surface support vector machine model," Journal of Combinatorial Optimization, Springer, vol. 49(2), pages 1-28, March.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:2:d:10.1007_s10878-024-01250-7
    DOI: 10.1007/s10878-024-01250-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01250-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01250-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. R. T. Rockafellar, 1976. "Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 97-116, May.
    2. Lin, Fengming & Fang, Shu-Cherng & Fang, Xiaolei & Gao, Zheming & Luo, Jian, 2024. "A distributionally robust chance-constrained kernel-free quadratic surface support vector machine," European Journal of Operational Research, Elsevier, vol. 316(1), pages 46-60.
    3. Tao Yu & Wei Huang & Xin Tang, 2023. "A Novel Fuzzy Unsupervised Quadratic Surface Support Vector Machine Based on DC Programming: An Application to Credit Risk Management," Mathematics, MDPI, vol. 11(22), pages 1-14, November.
    4. Jian Luo & Shu-Cherng Fang & Zhibin Deng & Xiaoling Guo, 2016. "Soft Quadratic Surface Support Vector Machine for Binary Classification," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(06), pages 1-22, December.
    5. Yanqin Bai & Xiao Han & Tong Chen & Hua Yu, 2015. "Quadratic kernel-free least squares support vector machine for target diseases classification," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 850-870, November.
    6. Asa Ben-Hur & Cheng Soon Ong & Sören Sonnenburg & Bernhard Schölkopf & Gunnar Rätsch, 2008. "Support Vector Machines and Kernels for Computational Biology," PLOS Computational Biology, Public Library of Science, vol. 4(10), pages 1-10, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gao, Zheming & Fang, Shu-Cherng & Luo, Jian & Medhin, Negash, 2021. "A kernel-free double well potential support vector machine with applications," European Journal of Operational Research, Elsevier, vol. 290(1), pages 248-262.
    2. Changlin Wang & Zhixia Yang & Junyou Ye & Xue Yang & Manchen Ding, 2024. "Supervised Feature Selection via Quadratic Surface Regression with $$l_{2,1}$$ l 2 , 1 -Norm Regularization," Annals of Data Science, Springer, vol. 11(2), pages 647-675, April.
    3. Xin Yan & Hongmiao Zhu & Jian Luo, 0. "A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-18.
    4. Xin Yan & Hongmiao Zhu & Jian Luo, 2021. "A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 948-965, November.
    5. Mingyang Wu & Zhixia Yang, 2025. "Kernel-free Reduced Quadratic Surface Support Vector Machine with 0-1 Loss Function and L $$_p$$ p -norm Regularization," Annals of Data Science, Springer, vol. 12(1), pages 381-412, February.
    6. Zhiguo Wang & Lufei Huang & Cici Xiao He, 2021. "A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 785-812, November.
    7. Jean-Pierre Crouzeix & Abdelhak Hassouni & Eladio Ocaña, 2023. "A Short Note on the Twice Differentiability of the Marginal Function of a Convex Function," Journal of Optimization Theory and Applications, Springer, vol. 198(2), pages 857-867, August.
    8. Bingsheng He & Li-Zhi Liao & Xiang Wang, 2012. "Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods," Computational Optimization and Applications, Springer, vol. 51(2), pages 649-679, March.
    9. Xiaoming Yuan, 2011. "An improved proximal alternating direction method for monotone variational inequalities with separable structure," Computational Optimization and Applications, Springer, vol. 49(1), pages 17-29, May.
    10. Zhu, Daoli & Marcotte, Patrice, 1995. "Coupling the auxiliary problem principle with descent methods of pseudoconvex programming," European Journal of Operational Research, Elsevier, vol. 83(3), pages 670-685, June.
    11. Hao Hao & Ji Zhang & Qian Zhang & Li Yao & Yichen Sun, 2021. "Improved gray neural network model for healthcare waste recycling forecasting," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 813-830, November.
    12. Guo, Zhaomiao & Fan, Yueyue, 2017. "A Stochastic Multi-Agent Optimization Model for Energy Infrastructure Planning Under Uncertainty and Competition," Institute of Transportation Studies, Working Paper Series qt89s5s8hn, Institute of Transportation Studies, UC Davis.
    13. Jian Luo & Yukai Zheng & Tao Hong & An Luo & Xueqi Yang, 2024. "Fuzzy support vector regressions for short-term load forecasting," Fuzzy Optimization and Decision Making, Springer, vol. 23(3), pages 363-385, September.
    14. Wei Gao & Wuping Bao & Xin Zhou, 2019. "Analysis of cough detection index based on decision tree and support vector machine," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 375-384, January.
    15. R. S. Burachik & S. Scheimberg & B. F. Svaiter, 2001. "Robustness of the Hybrid Extragradient Proximal-Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 111(1), pages 117-136, October.
    16. A. F. Izmailov & M. V. Solodov, 2022. "Perturbed Augmented Lagrangian Method Framework with Applications to Proximal and Smoothed Variants," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 491-522, June.
    17. Jing Yu & Lining Xing & Xu Tan, 0. "The new treatment mode research of hepatitis B based on ant colony algorithm," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
    18. Gang Du & Xi Liang & Xiaoling Ouyang & Chunming Wang, 0. "Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
    19. M. Kyono & M. Fukushima, 2000. "Nonlinear Proximal Decomposition Method for Convex Programming," Journal of Optimization Theory and Applications, Springer, vol. 106(2), pages 357-372, August.
    20. Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:49:y:2025:i:2:d:10.1007_s10878-024-01250-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.