scientific article; zbMATH DE number 7626760
From MaRDI portal
Publication:5053267
Cites work
- A bilevel optimization approach for parameter learning in variational models
- A note on the complexity of \(L _{p }\) minimization
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Bi-level path following for cross validated solution of kernel quantile regression
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Group sparse optimization via \(\ell_{p,q}\) regularization
- scientific article; zbMATH DE number 3612796 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Model Selection and Estimation in Regression with Grouped Variables
- Model selection for primal SVM
- Nearly unbiased variable selection under minimax concave penalty
- Nonconvex TV^q-models in image restoration: analysis and a trust-region regularization-based superlinearly convergent solver
- On $l_q$ Optimization and Matrix Completion
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
- Optimality conditions for bilevel programming problems
- Optimality conditions for bilevel programming problems
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- Smoothing methods for nonsmooth, nonconvex minimization
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
Cited in
(7)- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- On \ell_p-hyperparameter Learning via Bilevel Nonsmooth Optimization
- Bilevel optimization with convex majorant approach for training sparse neural networks
- A fast smoothing newton method for bilevel hyperparameter optimization for SVC with logistic loss
- Unified smoothing approach for best hyperparameter selection problem using a bilevel optimization strategy
- Riemannian bilevel optimization
- A penalty-based method for communication-efficient decentralized bilevel programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053267)
