Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
From MaRDI portal
Publication:2866204
DOI10.1137/120864908zbMath1282.90175OpenAlexW2019465316MaRDI QIDQ2866204
Publication date: 13 December 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/7015
convergencestationary pointworst-case complexitynonsmooth nonconvex optimizationsmoothing approximationquadratic regularization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (27)
\(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems ⋮ A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm ⋮ Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Linearly Constrained Non-Lipschitz Optimization for Image Restoration ⋮ A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization ⋮ \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities ⋮ An improved algorithm for the \(L_2-L_p\) minimization problem ⋮ A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery ⋮ A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery ⋮ A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model ⋮ A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities ⋮ \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization ⋮ Penalty methods with stochastic approximation for stochastic nonlinear programming ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ A note on the smoothing quadratic regularization method for non-Lipschitz optimization ⋮ Smoothing quadratic regularization method for hemivariational inequalities ⋮ Unnamed Item ⋮ A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization ⋮ Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization ⋮ High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms ⋮ Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization ⋮ Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization ⋮ Convergence analyses on sparse feedforward neural networks via group lasso regularization ⋮ On sparse beamformer design with reverberation ⋮ A residual-based algorithm for solving a class of structured nonsmooth optimization problems ⋮ Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
This page was built for publication: Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
