Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
From MaRDI portal
Publication:2693651
DOI10.1007/s10107-022-01888-3OpenAlexW4296062046WikidataQ114228401 ScholiaQ114228401MaRDI QIDQ2693651
Jane J. Ye, Jin Zhang, Shangzhi Zeng, Xiao-Ming Yuan
Publication date: 24 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.09006
hyperparameter selectionbilevel programdifference of convex algorithmbilevel model of support vector machine classification
Related Items
Uses Software
Cites Work
- Solving semidefinite-quadratic-linear programs using SDPT3
- Model selection for primal SVM
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Foundations of bilevel programming
- DC programming and DCA: thirty years of developments
- Solving bilevel programs with the KKT-approach
- DC programming: overview.
- Numerically tractable optimistic bilevel problems
- Bilevel optimization. Advances and next challenges
- On solving simple bilevel programs with a nonconvex lower level program
- An overview of bilevel optimization
- Computing B-Stationary Points of Nonsmooth DC Programs
- DC Programming and DCA for General DC Programs
- On the numerical solution of a class of Stackelberg problems
- Computational Difficulties of Bilevel Linear Programming
- The Theory of Moral Hazard and Unobservable Behaviour: Part I
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- First-Order Methods in Optimization
- On the Calmness of a Class of Multifunctions
- Optimality conditions for bilevel programming problems
- Bilevel Optimization of Regularization Hyperparameters in Machine Learning
- Constraint Qualifications and Optimality Conditions in Bilevel Optimization
- Directional Necessary Optimality Conditions for Bilevel Programs
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization
- Bilevel Programming Problems
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods
- Classification model selection via bilevel programming
- Convex Analysis
- Mathematical Programs with Equilibrium Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
