OPTIMALITY CONDITIONS AND A SMOOTHING TRUST REGION NEWTON METHOD FOR NONLIPSCHITZ OPTIMIZATION

被引:70
作者
Chen, Xiaojun [1 ]
Niu, Lingfeng [2 ]
Yuan, Yaxiang [3 ]
机构
[1] Hong Kong Polytech Univ, Dept Appl Math, Hong Kong, Hong Kong, Peoples R China
[2] Univ Chinese Acad Sci, Res Ctr Fictitious Econ & Data Sci, Beijing 100190, Peoples R China
[3] Chinese Acad Sci, AMSS, LSEC, Beijing 100190, Peoples R China
关键词
nonsmooth nonconvex optimization; smoothing methods; convergence; regularized optimization; penalty function; non-Lipschitz; trust region Newton method; NONSMOOTH; MINIMIZATION; CONVERGENCE; ALGORITHM; SELECTION;
D O I
10.1137/120871390
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Regularized minimization problems with nonconvex, nonsmooth, perhaps non-Lipschitz penalty functions have attracted considerable attention in recent years, owing to their wide applications in image restoration, signal reconstruction, and variable selection. In this paper, we derive affine-scaled second order necessary and sufficient conditions for local minimizers of such minimization problems. Moreover, we propose a global convergent smoothing trust region Newton method which can find a point satisfying the affine-scaled second order necessary optimality condition from any starting point. Numerical examples are given to demonstrate the effectiveness of the smoothing trust region Newton method.
引用
收藏
页码:1528 / 1552
页数:25
相关论文
共 47 条
[1]  
[Anonymous], 1986, Handbook of Econometrics, DOI DOI 10.1016/S1573-4412(05)80005-4
[2]  
[Anonymous], 1998, Variational Analysis
[3]  
[Anonymous], TRUST REGION METHODS, DOI DOI 10.1137/1.9780898719857
[4]  
[Anonymous], J AM STAT ASS
[5]  
[Anonymous], 1987, Unconstrained Optimization: Practical Methods of Optimization
[6]   A TRUST REGION ALGORITHM FOR NONSMOOTH OPTIMIZATION [J].
BANNERT, T .
MATHEMATICAL PROGRAMMING, 1994, 67 (02) :247-264
[7]   Smoothing Neural Network for Constrained Non-Lipschitz Optimization With Applications [J].
Bian, Wei ;
Chen, Xiaojun .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2012, 23 (03) :399-411
[8]   From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images [J].
Bruckstein, Alfred M. ;
Donoho, David L. ;
Elad, Michael .
SIAM REVIEW, 2009, 51 (01) :34-81
[9]  
Burke J, 2005, AM J NURS, V105, P15, DOI 10.1097/00000446-200505000-00006
[10]   ON THE EVALUATION COMPLEXITY OF COMPOSITE FUNCTION MINIMIZATION WITH APPLICATIONS TO NONCONVEX NONLINEAR PROGRAMMING [J].
Cartis, Coralia ;
Gould, Nicholas I. M. ;
Toint, Philippe L. .
SIAM JOURNAL ON OPTIMIZATION, 2011, 21 (04) :1721-1739