A note on the smoothing quadratic regularization method for non-Lipschitz optimization
type: Item
instance of: scholarly article
title: A note on the smoothing quadratic regularization method for non-Lipschitz optimization
zbMATH Open document ID: 1329.90138
author: Yakui Huang
author: Hongwei Liu
author: Weijie Cong
published in: Numerical Algorithms
publication date: 2015-09-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 6477410
zbMATH Keywords: nonsmooth nonconvex optimization
zbMATH Keywords: non-Lipschitz optimization
zbMATH Keywords: smoothing approximation
zbMATH Keywords: quadratic regularization
describes a project that uses: GradSamp
MaRDI profile type: Publication
full work available at URL: s11075-014-9929-6
OpenAlex ID: W2015651368
cites work: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
cites work: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
cites work: On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
cites work: Smoothing methods for nonsmooth, nonconvex minimization
cites work: Complexity of unconstrained \(L_2 - L_p\) minimization
cites work: Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
cites work: Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
cites work: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
cites work: Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
cites work: Optimization and nonsmooth analysis
cites work: Comments on «Wavelets in statistics: A review» by A. Antoniadis
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
cites work: A note on the complexity of \(L _{p }\) minimization
cites work: Asymptotic properties of bridge estimators in sparse high-dimensional regression models
cites work: Minimizing Nonconvex Functions for Sparse Vector Reconstruction
cites work: Modified Gauss–Newton scheme with worst case guarantees for global performance
cites work: Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
cites work: Variational Analysis
cites work: Q4864293
cites work: Nearly unbiased variable selection under minimax concave penalty
DOI: 10.1007/S11075-014-9929-6
description: scientific article; zbMATH DE number 6477410