The global convergence of a modified BFGS method for nonconvex functions

Fu, 2015, Enabling personalized search over encrypted out-sourced data with efficiency improvement, IEEE Trans. Parallel Distrib. Fu, 2016, Towards efficient multi-keyword fuzzy search over encrypted outsourced data with accuracy improvement, IEEE Trans. Inf. Foren. Sec., 10.1109/TIFS.2016.2596138 Gu, 2016, A robust regularization path algorithm for ν-support vector classification, IEEE Trans. Neural Netw. Learn. Gu, 2015, Incremental support vector learning for ordinal regression, IEEE Trans. Neural Netw. Learn., 26, 1403, 10.1109/TNNLS.2014.2342533 Gu, 2016, Structural minimax probability machine, IEEE Trans. Neural Netw. Learn. Li, 2015, Segmentation-based image copy-move forgery detection scheme, IEEE Trans. Inf. Forensics Secur., 10, 507, 10.1109/TIFS.2014.2381872 Pan, 2015, Efficient motion and disparity estimation optimization for low complexity multiview video coding, IEEE Trans. Broadcast., 61, 166, 10.1109/TBC.2015.2419824 Pan, 2016, IEEE Trans. Broadcast., Fast motion estimation based on content property for low-complexity H.265/HEVC encoder, 1 Xia, 2015, A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data, IEEE Trans. Parallel Distrib., 27, 340, 10.1109/TPDS.2015.2401003 Xia, 2016, Steganalysis of LSB matching using differences between nonadjacent pixels, Multimedia Tools Appl., 75, 1947, 10.1007/s11042-014-2381-8 Yuan, 2016, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, J. Optim. Theory Appl., 168, 129, 10.1007/s10957-015-0781-1 Xia, 2016, A privacy-preserving and copy-deterrence content-based image retrieval scheme in cloud computing, IEEE Trans. Inf. Forensics Secur., 10.1109/TIFS.2016.2590944 Yuan, 2016, Fingerprint liveness detection based on multi-scale LPQ and PCA, China Commun., 13, 60, 10.1109/CC.2016.7559076 Zhou, 2016, Effective and efficient global context verification for image copy detection, IEEE Trans. Inf. Forensics Secur. Broyden, 1970, The convergence of a class of double rank minimization algorithms: 2 The new algorithm, J. Inst. Math. Appl., 6, 222, 10.1093/imamat/6.3.222 Fletcher, 1970, A new approach to variable metric algorithms, Comput. J., 13, 317, 10.1093/comjnl/13.3.317 Goldfarb, 1970, A family of variable metric methods derived by variational means, Math. Comp., 24, 23, 10.1090/S0025-5718-1970-0258249-6 Schanno, 1970, Conditions of quasi-Newton methods for function minimization, Math. Comp., 24, 647, 10.1090/S0025-5718-1970-0274029-X Davidon, 1991, Variable metric methods for minimization, SIAM J. Optim., 1, 1, 10.1137/0801001 Fletcher, 1963, A rapidly convergent descent method for minimization, Comput. J., 6, 163, 10.1093/comjnl/6.2.163 Powell, 1971, On the convergence of the variable metric algorithm, J. Inst. Math. Appl., 7, 21, 10.1093/imamat/7.1.21 Dixon, 1972, Variable metric algorithms: Nessary and sufficient conditions for identical behavior on nonquadratic functions, J. Optim. Theory Appl., 10, 34, 10.1007/BF00934961 Powell, 1976, Some global convergence properties of a variable metric algorithm for minimization without exact line searches Byrd, 1987, Global convergence of a class of quasi-Newton methods on convex problems, SIAM J. Numer. Anal., 24, 1171, 10.1137/0724077 Broyden, 1973, On the local and supelinear convergence of quasi-Newton methods, J. Inst. Math. Appl., 12, 223, 10.1093/imamat/12.3.223 Byrd, 1989, A tool for the analysis of quasi-Newton methods with application to unconstrained minimization, SIAM J. Numer. Anal., 26, 727, 10.1137/0726042 Griewank, 1991, The global convergence of partioned BFGS on problems with convex decompositons and Lipschitzian gradients, Math. Program., 50, 141, 10.1007/BF01594933 Toint, 1986, Global convergence of the partioned BFGS algorithm for convex partially separable opertimization, Math. Program., 36, 290, 10.1007/BF02592063 Dennis Jr, 1977, Quasi-Newton methods, motivation and theory, SIAM Rev., 19, 46, 10.1137/1019005 Dennis, 1974, A characteization of superlinear convergence and its application to quasi-Newton methods, Math. Comp., 28, 549, 10.1090/S0025-5718-1974-0343581-1 Griewank, 1982, Local convergence analysis for partitioned quasi-Newton updates, Numer. Math., 39, 429, 10.1007/BF01407874 Li, 2001, A modified BFGS method and its global convergence in nonconvex minimization, J. Comput. Appl. Math., 129, 15, 10.1016/S0377-0427(00)00540-9 Li, 2001, On the global convergence of the BFGS method for nonconvex unconstrained optimization problems, SIAM J. Optim., 11, 1054, 10.1137/S1052623499354242 Powell, 1970, A new algorithm for unconstrained optimation, 31 Wei, 2003, An SQP-type method and its application in stochastic programming, J. Optim. Theory Appl., 116, 205, 10.1023/A:1022122521816 Wei, 2004, The superlinear convergence of a modified BFGS-type method for unconstrained optimization, Comput. Optim. Appl., 29, 315, 10.1023/B:COAP.0000044184.25410.39 Yuan, 2010, Convergence analysis of a modified BFGS method on convex minimizations, Comput. Optim. Appl., 47, 237, 10.1007/s10589-008-9219-0 Zhang, 1999, New quasi-Newton equation and related methods for unconstrained optimization, J. Optim. Theory Appl., 102, 147, 10.1023/A:1021898630001 Dai, 2003, Convergence properties of the BFGS algorithm, SIAM J. Optim., 13, 693, 10.1137/S1052623401383455 Yuan, 2017, Global convergence of the BFGS method and the PRP method for general functions under a modified weak Wolfe–Powell line search, Appl. Math. Model., 10.1016/j.apm.2017.02.008 Al-Baali, 1986, An efficient line search for nonlinear least squares, J. Optim. Theory Appl., 48, 359, 10.1007/BF00940566 Fletcher, 1987 Andrei, 2008, An unconstrained optimization test functions collection, Adv. Modell. Optim., 10, 147 Dolan, 2002, Benchmarking optimization software with performance profiles, Math. Program., 91, 201, 10.1007/s101070100263