On constrained optimization with nonconvex regularization
From MaRDI portal
Publication:2225521
DOI10.1007/s11075-020-00928-3zbMath1496.90064OpenAlexW3016676401MaRDI QIDQ2225521
Ernesto G. Birgin, Alberto Ramos, José Mario Martínez
Publication date: 8 February 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-00928-3
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Nonconcave penalized likelihood with a diverging number of parameters.
- Support-vector networks
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Testing Unconstrained Optimization Software
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- On High-order Model Regularization for Constrained Optimization
- On Regularization and Active-set Methods with Complexity for Constrained Optimization
- A Statistical View of Some Chemometrics Regression Tools
- Computational Methods for Inverse Problems
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Practical Augmented Lagrangian Methods for Constrained Optimization
- On sequential optimality conditions for smooth constrained optimization
