A note on the smoothing quadratic regularization method for non-Lipschitz optimization
From MaRDI portal
Publication:494677
DOI10.1007/s11075-014-9929-6zbMath1329.90138OpenAlexW2015651368MaRDI QIDQ494677
Yakui Huang, Hong-Wei Liu, Wei-jie Cong
Publication date: 1 September 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9929-6
nonsmooth nonconvex optimizationsmoothing approximationnon-Lipschitz optimizationquadratic regularization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
Uses Software
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A note on the complexity of \(L _{p }\) minimization
- Smoothing methods for nonsmooth, nonconvex minimization
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Optimization and nonsmooth analysis
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Comments on «Wavelets in statistics: A review» by A. Antoniadis
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
