Enregistré dans:
Détails bibliographiques
Auteurs principaux: Wang, Yixin, Li, Qingna, Zhang, Liwei
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:https://arxiv.org/abs/2506.22603
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866908610207940608
author Wang, Yixin
Li, Qingna
Zhang, Liwei
author_facet Wang, Yixin
Li, Qingna
Zhang, Liwei
contents Bilevel hyperparameter optimization has received growing attention thanks to the fast development of machine learning. Due to the tremendous size of data sets, the scale of bilevel hyperparameter optimization problem could be extremely large, posing great challenges in designing efficient numerical algorithms. In this paper, we focus on solving the large-scale mathematical programs with equilibrium constraints (MPEC) derived from hyperparameter selection of L1 support vector classification (L1-SVC). We propose a highly efficient smoothing damped Newton method (SDNM) for solving such MPEC. Compared with most existing algorithms where subproblems are solved by packages, our approach fully takes advantage of the structure of MPEC and therefore is package-free. Moreover, the proposed SDNM converges to C-stationary point under MPEC-LICQ with subproblem enjoys a quadratic convergence rate under proper assumptions. Extensive numerical results over LIBSVM dataset show the superior performance of SDNM over other state-of-art algorithms.
format Preprint
id arxiv_https___arxiv_org_abs_2506_22603
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle An Efficient Smoothing Damped Newton Method for Large-Scale Mathematical Programs with Equilibrium Constraints
Wang, Yixin
Li, Qingna
Zhang, Liwei
Optimization and Control
Bilevel hyperparameter optimization has received growing attention thanks to the fast development of machine learning. Due to the tremendous size of data sets, the scale of bilevel hyperparameter optimization problem could be extremely large, posing great challenges in designing efficient numerical algorithms. In this paper, we focus on solving the large-scale mathematical programs with equilibrium constraints (MPEC) derived from hyperparameter selection of L1 support vector classification (L1-SVC). We propose a highly efficient smoothing damped Newton method (SDNM) for solving such MPEC. Compared with most existing algorithms where subproblems are solved by packages, our approach fully takes advantage of the structure of MPEC and therefore is package-free. Moreover, the proposed SDNM converges to C-stationary point under MPEC-LICQ with subproblem enjoys a quadratic convergence rate under proper assumptions. Extensive numerical results over LIBSVM dataset show the superior performance of SDNM over other state-of-art algorithms.
title An Efficient Smoothing Damped Newton Method for Large-Scale Mathematical Programs with Equilibrium Constraints
topic Optimization and Control
url https://arxiv.org/abs/2506.22603