scientific article; zbMATH DE number 7626760
From MaRDI portal
Publication:5053267
Motokazu Watanabe, Takayuki Okuno, Akihiro Kawana, Akiko Takeda
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/1806.01520
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Smooth minimization of non-smooth functions
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems
- Model selection for primal SVM
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- A note on the complexity of \(L _{p }\) minimization
- Smoothing methods for nonsmooth, nonconvex minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
- A Bilevel Optimization Approach for Parameter Learning in Variational Models
- Nonconvex TV$^q$-Models in Image Restoration: Analysis and a Trust-Region Regularization--Based Superlinearly Convergent Solver
- Smoothing and First Order Methods: A Unified Framework
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- On $l_q$ Optimization and Matrix Completion
- Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
- Optimality conditions for bilevel programming problems
- Bilevel Programming Problems
- Group sparse optimization via $\ell_{p,q}$ regularization
- Model Selection and Estimation in Regression with Grouped Variables
- Optimality conditions for bilevel programming problems
This page was built for publication:
