Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization

DOI10.1137/120871390zbMath1291.90238OpenAlexW2009680197MaRDI QIDQ2866196

Lingfeng Niu, Xiaojun Chen, Ya-Xiang Yuan

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/7014

zbMATH Keywords

convergence penalty function nonsmooth nonconvex optimization regularized optimization non-Lipschitz smoothing methods trust region Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (42)

Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms ⋮ A smoothing trust region filter algorithm for nonsmooth least squares problems ⋮ Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization ⋮ 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 truncated Newton algorithm for nonconvex sparse recovery ⋮ Optimality conditions for the constrainedL_p-regularization ⋮ Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization ⋮ An interior stochastic gradient method for a class of non-Lipschitz optimization problems ⋮ A globally convergent algorithm for a constrained non-Lipschitz image restoration model ⋮ Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs ⋮ \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities ⋮ Adaptive projected gradient thresholding methods for constrained \(l_0\) problems ⋮ A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems ⋮ A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model ⋮ Parameter synthesis in Markov models: a gentle survey ⋮ \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization ⋮ Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems ⋮ A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees ⋮ An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration ⋮ Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation ⋮ On constrained optimization with nonconvex regularization ⋮ Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities ⋮ Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization ⋮ A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal ⋮ A note on the smoothing quadratic regularization method for non-Lipschitz optimization ⋮ Unnamed Item ⋮ A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization ⋮ High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms ⋮ Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm ⋮ Low-order penalty equations for semidefinite linear complementarity problems ⋮ A unified primal dual active set algorithm for nonconvex sparse recovery ⋮ Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization ⋮ A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization ⋮ Computation of second-order directional stationary points for group sparse optimization ⋮ An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing ⋮ On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms ⋮ Bilevel Optimization of Regularization Hyperparameters in Machine Learning ⋮ Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^* ⋮ Recent advances in trust region algorithms

This page was built for publication: Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization