TY - JOUR AU - Ben-tal, A. AU - Nemirovski, A. PY - 2005 DA - 2005// TI - Non-Euclidean restricted memory level method for large-scale convex optimization JO - Math. Program. VL - 3 UR - https://doi.org/10.1007/s10107-004-0553-4 DO - 10.1007/s10107-004-0553-4 ID - Ben-tal2005 ER - TY - JOUR AU - Birge, J. R. AU - Qi, L. AU - Wei, Z. PY - 1998 DA - 1998// TI - A general approach to convergence properties of some methods for nonsmooth convex optimization JO - Appl. Math. Optim. VL - 38 UR - https://doi.org/10.1007/s002459900086 DO - 10.1007/s002459900086 ID - Birge1998 ER - TY - JOUR AU - Bonnans, J. F. AU - Gilbert, J. C. AU - Lemaréchal, C. AU - Sagastizábal, C. A. PY - 1995 DA - 1995// TI - A family of veriable metric proximal methods JO - Math. Program. VL - 68 ID - Bonnans1995 ER - TY - JOUR AU - Byrd, R. H. AU - Lu, P. H. AU - Nocedal, J. PY - 1995 DA - 1995// TI - A limited memory algorithm for bound constrained optimization JO - SIAM J. Sci. Stat. Comput. VL - 16 UR - https://doi.org/10.1137/0916069 DO - 10.1137/0916069 ID - Byrd1995 ER - TY - JOUR AU - Byrd, R. H. AU - Nocedal, J. AU - Schnabel, R. B. PY - 1994 DA - 1994// TI - Representations of quasi-Newton matrices and their use in limited memory methods JO - Math. Program. VL - 63 UR - https://doi.org/10.1007/BF01582063 DO - 10.1007/BF01582063 ID - Byrd1994 ER - TY - JOUR AU - Calamai, P. AU - Moré, J. J. PY - 1987 DA - 1987// TI - Projected gradient for linearly constrained programms JO - Math. Program. VL - 39 UR - https://doi.org/10.1007/BF02592073 DO - 10.1007/BF02592073 ID - Calamai1987 ER - TY - BOOK AU - Clarke, F. H. PY - 1983 DA - 1983// TI - Optimization and Nonsmooth Analysis PB - Wiley-Interscience CY - New York ID - Clarke1983 ER - TY - JOUR AU - Correa, R. AU - Lemaréchal, C. PY - 1993 DA - 1993// TI - Convergence of some algorithms for convex minization JO - Math. Program. VL - 62 UR - https://doi.org/10.1007/BF01585170 DO - 10.1007/BF01585170 ID - Correa1993 ER - TY - JOUR AU - Dolan, E. D. AU - Moré, J. J. PY - 2002 DA - 2002// TI - Benchmarking optimization software with performance profiles JO - Math. Program. VL - 91 UR - https://doi.org/10.1007/s101070100263 DO - 10.1007/s101070100263 ID - Dolan2002 ER - TY - JOUR AU - Facchinei, F. AU - Júdice, J. AU - Soares, J. PY - 1998 DA - 1998// TI - An active set Newton algorithm for large-scale nonlinear programs with box constraints JO - SIAM J. Optim. VL - 8 UR - https://doi.org/10.1137/S1052623493253991 DO - 10.1137/S1052623493253991 ID - Facchinei1998 ER - TY - BOOK AU - Fletcher, R. PY - 1987 DA - 1987// TI - Practical Methods of Optimization PB - Wiley CY - Chichester ID - Fletcher1987 ER - TY - JOUR AU - Fukushima, M. AU - Qi, L. PY - 1996 DA - 1996// TI - A global and superlinearly convergent algorithm for nonsmooth convex minimization JO - SIAM J. Optim. VL - 6 UR - https://doi.org/10.1137/S1052623494278839 DO - 10.1137/S1052623494278839 ID - Fukushima1996 ER - TY - BOOK AU - Goldberg, D. E. PY - 1998 DA - 1998// TI - Genetic Algorithms in Search, Optimization, and Machine Learning PB - Addison-Wesley CY - Reading ID - Goldberg1998 ER - TY - STD TI - Haarala, M., Mäkelä, M.M.: Limited memory bundle algorithm for large bound constrained nonsmooth minimization problems. Reports of the Department of Mathematical Information Technology, Series B. Scientific Computing, No. B. 1/2006, University of Jyväskylä, Finland (2006) ID - ref14 ER - TY - JOUR AU - Haarala, M. AU - Miettinen, K. AU - Mäkelä, M. M. PY - 2004 DA - 2004// TI - New limited memory bundle method for large-scale nonsmooth optimization JO - Optim. Methods Softw. VL - 19 UR - https://doi.org/10.1080/10556780410001689225 DO - 10.1080/10556780410001689225 ID - Haarala2004 ER - TY - BOOK AU - Hiriart-Urruty, J. B. AU - Lemmaréchal, C. PY - 1983 DA - 1983// TI - Convex Analysis and Minimization Algorithms II PB - Spring CY - Berlin ID - Hiriart-Urruty1983 ER - TY - STD TI - Karmitsa, N.: Test problems for large-scale nonsmooth minimization. Reports of the Department of Mathematical Information Technology, Series B. Scientific Computing, No. B. 4/2007, University of Jyväskylä, Finland (2007) ID - ref17 ER - TY - JOUR AU - Karmitsaa, N. AU - Bagirovb, A. AU - Mäkelä, M. M. PY - 2012 DA - 2012// TI - Comparing different nonsmooth minimization methods and software JO - Optim. Methods Softw. VL - 27 UR - https://doi.org/10.1080/10556788.2010.526116 DO - 10.1080/10556788.2010.526116 ID - Karmitsaa2012 ER - TY - BOOK AU - Kiwiel, K. C. PY - 1985 DA - 1985// TI - Methods of Descent for Nondifferentiable Optimization PB - Springer CY - Berlin UR - https://doi.org/10.1007/BFb0074500 DO - 10.1007/BFb0074500 ID - Kiwiel1985 ER - TY - JOUR AU - Kiwiel, K. C. PY - 1990 DA - 1990// TI - Proximity control in bundle methods for convex nondifferentiable optimization JO - Math. Program. VL - 46 UR - https://doi.org/10.1007/BF01585731 DO - 10.1007/BF01585731 ID - Kiwiel1990 ER - TY - JOUR AU - Kiwiel, K. C. PY - 1995 DA - 1995// TI - Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities JO - Math. Program. VL - 69 ID - Kiwiel1995 ER - TY - STD TI - Lemaréchal, C.: Extensions diverses des médthodes de gradient et applications, Thèse d’Etat. Paris (1980) ID - ref22 ER - TY - CHAP AU - Lemaréchal, C. ED - Nemhauser, G. L. ED - Rinnooy Kan, A. H. G. ED - Todd, M. J. PY - 1989 DA - 1989// TI - Nondifferentiable optimization BT - Optimization PB - Elsevier CY - New York UR - https://doi.org/10.1016/S0927-0507(89)01008-X DO - 10.1016/S0927-0507(89)01008-X ID - Lemaréchal1989 ER - TY - CHAP AU - Majava, K. AU - Haarala, N. AU - Kärkkäinen, T. PY - 2005 DA - 2005// TI - Solving variational image denoising problems using limited memory bundle method BT - Proceedings of the 2nd International Conference on Scientific Computing and Partial Differential Equations and the First East Asia SIAM Symposium, Hongkong ID - Majava2005 ER - TY - JOUR AU - Nguyen, V. H. AU - Strodiot, J. J. PY - 1984 DA - 1984// TI - A linearly constrained algorithm not requiring derivative continuity JO - Eng. Struct. VL - 6 UR - https://doi.org/10.1016/0141-0296(84)90056-7 DO - 10.1016/0141-0296(84)90056-7 ID - Nguyen1984 ER - TY - JOUR AU - Ni, Q. PY - 1998 DA - 1998// TI - A subspace projected conjugate algorithm for large bound constrained quadratic programming JO - Numer. Math. J. Chin. Univ. VL - 7 ID - Ni1998 ER - TY - JOUR AU - Ni, Q. AU - Yuan, Y. X. PY - 1997 DA - 1997// TI - A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound consrtained optimization JO - Math. Comput. VL - 66 UR - https://doi.org/10.1090/S0025-5718-97-00866-1 DO - 10.1090/S0025-5718-97-00866-1 ID - Ni1997 ER - TY - CHAP AU - Powell, M. J. D. PY - 1978 DA - 1978// TI - A fast algorithm for nonlinearly constrained optimization calculations BT - Numerical Analysis ID - Powell1978 ER - TY - JOUR AU - Qi, L. PY - 1993 DA - 1993// TI - Convergence analysis of some algorithms for solving nonsmooth equations JO - Math. Oper. Res. VL - 18 UR - https://doi.org/10.1287/moor.18.1.227 DO - 10.1287/moor.18.1.227 ID - Qi1993 ER - TY - JOUR AU - Qi, L. AU - Sun, J. PY - 1993 DA - 1993// TI - A nonsmooth version of Newton’s method JO - Math. Program. VL - 58 UR - https://doi.org/10.1007/BF01581275 DO - 10.1007/BF01581275 ID - Qi1993 ER - TY - BOOK AU - Schramm, H. PY - 1989 DA - 1989// TI - Eine kombination von bundle- und trust-region-verfahren zur Lösung nichtdifferenzierbare optimierungsprobleme ID - Schramm1989 ER - TY - JOUR AU - Schramm, H. AU - Zowe, J. PY - 1992 DA - 1992// TI - A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results JO - SIAM J. Optim. VL - 2 UR - https://doi.org/10.1137/0802008 DO - 10.1137/0802008 ID - Schramm1992 ER - TY - JOUR AU - Schultz, H. K. PY - 1973 DA - 1973// TI - A Kuhn–Tucker algorithm JO - SIAM J. Control Optim. VL - 11 UR - https://doi.org/10.1137/0311036 DO - 10.1137/0311036 ID - Schultz1973 ER - TY - JOUR AU - Sreedharan, V. P. PY - 1982 DA - 1982// TI - A subgradient projection algorithm JO - J. Approx. Theory VL - 35 UR - https://doi.org/10.1016/0021-9045(82)90029-6 DO - 10.1016/0021-9045(82)90029-6 ID - Sreedharan1982 ER - TY - JOUR AU - Wolfe, P. PY - 1975 DA - 1975// TI - A method of conjugate subgradients for minimizing nondifferentiable convex functions JO - Math. Program. Stud. VL - 3 UR - https://doi.org/10.1007/BFb0120703 DO - 10.1007/BFb0120703 ID - Wolfe1975 ER - TY - JOUR AU - Xiao, Y. AU - Wei, Z. PY - 2007 DA - 2007// TI - A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization JO - Appl. Math. Comput. VL - 185 ID - Xiao2007 ER - TY - STD TI - Yuan, G., Li, P., Lu, J.: The global convergence of the BFGS method with a modified WWP line search for nonconvex functions. Numer. Algorithms (2019, accepted) ID - ref37 ER - TY - JOUR AU - Yuan, G. AU - Li, T. AU - Hu, W. PY - 2020 DA - 2020// TI - A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems JO - Appl. Numer. Math. VL - 147 UR - https://doi.org/10.1016/j.apnum.2019.08.022 DO - 10.1016/j.apnum.2019.08.022 ID - Yuan2020 ER - TY - JOUR AU - Yuan, G. AU - Meng, Z. AU - Li, Y. PY - 2016 DA - 2016// TI - A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations JO - J. Optim. Theory Appl. VL - 168 UR - https://doi.org/10.1007/s10957-015-0781-1 DO - 10.1007/s10957-015-0781-1 ID - Yuan2016 ER - TY - BOOK AU - Yuan, G. AU - Sheng, Z. PY - 2017 DA - 2017// TI - Optimization Algorithm of Nonsmooth PB - Science Press CY - Beijing ID - Yuan2017 ER - TY - JOUR AU - Yuan, G. AU - Sheng, Z. AU - Wang, P. AU - Hu, W. AU - Li, C. PY - 2018 DA - 2018// TI - The global convergence of a modified BFGS method for nonconvex functions JO - J. Comput. Appl. Math. VL - 327 UR - https://doi.org/10.1016/j.cam.2017.05.030 DO - 10.1016/j.cam.2017.05.030 ID - Yuan2018 ER - TY - JOUR AU - Yuan, G. AU - Wei, Z. PY - 2012 DA - 2012// TI - The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems JO - Math. Model. Anal. VL - 17 UR - https://doi.org/10.3846/13926292.2012.661375 DO - 10.3846/13926292.2012.661375 ID - Yuan2012 ER - TY - JOUR AU - Yuan, G. AU - Wei, Z. AU - Li, G. PY - 2014 DA - 2014// TI - A modified Polak–Ribière–Polyak conjugate gradient algorithm with nonmonotone line search for nonsmooth convex minimization JO - J. Comput. Appl. Math. VL - 255 UR - https://doi.org/10.1016/j.cam.2013.04.032 DO - 10.1016/j.cam.2013.04.032 ID - Yuan2014 ER - TY - JOUR AU - Yuan, G. AU - Wei, Z. AU - Lu, X. PY - 2017 DA - 2017// TI - Global convergence of the BFGS method and the PRP method for general functions under a modified weak Wolfe–Powell line search JO - Appl. Math. Model. VL - 47 UR - https://doi.org/10.1016/j.apm.2017.02.008 DO - 10.1016/j.apm.2017.02.008 ID - Yuan2017 ER - TY - JOUR AU - Yuan, G. AU - Wei, Z. AU - Wang, Z. PY - 2013 DA - 2013// TI - Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization JO - Comput. Optim. Appl. VL - 54 UR - https://doi.org/10.1007/s10589-012-9485-8 DO - 10.1007/s10589-012-9485-8 ID - Yuan2013 ER - TY - JOUR AU - Yuan, G. AU - Wei, Z. AU - Yang, Y. PY - 2019 DA - 2019// TI - The global convergence of the Polak–Ribière–Polyak conjugate gradient algorithm under inexact line search for nonconvex functions JO - J. Comput. Appl. Math. VL - 362 UR - https://doi.org/10.1016/j.cam.2018.10.057 DO - 10.1016/j.cam.2018.10.057 ID - Yuan2019 ER -