{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:50:22Z","timestamp":1778345422388,"version":"3.51.4"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T00:00:00Z","timestamp":1462492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10107-016-1021-7","type":"journal-article","created":{"date-parts":[[2016,5,6]],"date-time":"2016-05-06T19:53:52Z","timestamp":1462564432000},"page":"515-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":66,"title":["A Stochastic Successive Minimization Method for Nonsmooth Nonconvex Optimization with Applications to Transceiver Design in Wireless Communication Networks"],"prefix":"10.1007","volume":"157","author":[{"given":"Meisam","family":"Razaviyayn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maziar","family":"Sanjabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,6]]},"reference":[{"issue":"2","key":"1021_CR1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF02592150","volume":"75","author":"EL Plambeck","year":"1996","unstructured":"Plambeck, E.L., Fu, B.R., Robinson, S.M., Suri, R.: Sample-path optimization of convex stochastic performance functions. Math. Program. 75(2), 137\u2013176 (1996)","journal-title":"Math. Program."},{"issue":"3","key":"1021_CR2","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.21.3.513","volume":"21","author":"SM Robinson","year":"1996","unstructured":"Robinson, S.M.: Analysis of sample-path optimization. Math. Oper. Res. 21(3), 513\u2013528 (1996)","journal-title":"Math. Oper. Res."},{"key":"1021_CR3","doi-asserted-by":"crossref","unstructured":"Healy, K., Schruben, L.W.: Retrospective simulation response optimization. In: Proceedings of the 23rd Conference on Winter Simulation, pp. 901\u2013906. IEEE Computer Society (1991)","DOI":"10.1109\/WSC.1991.185703"},{"issue":"4","key":"1021_CR4","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0378-4754(90)90142-6","volume":"32","author":"RY Rubinstein","year":"1990","unstructured":"Rubinstein, R.Y., Shapiro, A.: Optimization of static simulation models by the score function method. Math. Comput. Simul. 32(4), 373\u2013392 (1990)","journal-title":"Math. Comput. Simul."},{"key":"1021_CR5","volume-title":"Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method","author":"RY Rubinstein","year":"1993","unstructured":"Rubinstein, R.Y., Shapiro, A.: Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method, vol. 346. Wiley, New York (1993)"},{"key":"1021_CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0927-0507(03)10006-0","volume":"10","author":"A Shapiro","year":"2003","unstructured":"Shapiro, A.: Monte carlo sampling methods. Handb. Oper. Res. Manag. Sci. 10, 353\u2013426 (2003)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"1021_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory, vol. 9. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"1021_CR8","doi-asserted-by":"crossref","unstructured":"Kim, S., Pasupathy, R., Henderson, S.: A guide to sample average approximation In: Fu, M.C. (ed.) Handbook of Simulation Optimization, pp. 207\u2013243. Springer, New York (2015)","DOI":"10.1007\/978-1-4939-1384-8_8"},{"key":"1021_CR9","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.Q.: A unified convergence analysis of block successive minimization methods for non-smooth optimization. arXiv preprint, arXiv:1209.2385 (2012)"},{"key":"1021_CR10","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"AL Yuille","year":"2003","unstructured":"Yuille, A.L., Rangarajan, A.: The concave\u2013convex procedure. Neural Comput. 15, 915\u2013936 (2003)","journal-title":"Neural Comput."},{"key":"1021_CR11","unstructured":"Borman, S.: The expectation maximization algorithm\u2014a short tutorial. Unpublished paper http:\/\/ftp.csd.uwo.ca\/faculty\/olga\/Courses\/Fall2006\/Papers\/EM_algorithm.pdf"},{"key":"1021_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B 39, 1\u201338 (1977)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"1021_CR13","volume-title":"A Modern Approach to Probability Theory","author":"BE Fristedt","year":"1996","unstructured":"Fristedt, B.E., Gray, L.F.: A Modern Approach to Probability Theory. Birkhuser, Boston (1996)"},{"key":"1021_CR14","volume-title":"Linear Operators. Part 1: General Theory","author":"N Dunford","year":"1958","unstructured":"Dunford, N., Schwartz, J.T.: Linear Operators. Part 1: General Theory. Interscience Publications, New York (1958)"},{"issue":"2\u20133","key":"1021_CR15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-006-0708-6","volume":"108","author":"F Bastin","year":"2006","unstructured":"Bastin, F., Cirillo, C., Toint, P.L.: Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Program. 108(2\u20133), 207\u2013234 (2006)","journal-title":"Math. Program."},{"key":"1021_CR16","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1109\/JSAC.2008.080904","volume":"26","author":"E Larsson","year":"2008","unstructured":"Larsson, E., Jorswieck, E.: Competition versus cooperation on the MISO interference channel. IEEE J. Sel. Areas Commun. 26, 1059\u20131069 (2008)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1021_CR17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10107-011-0469-8","volume":"129","author":"M Razaviyayn","year":"2011","unstructured":"Razaviyayn, M., Luo, Z.Q., Tseng, P., Pang, J.S.: A stackelberg game approach to distributed spectrum management. Math. Program. 129, 197\u2013224 (2011)","journal-title":"Math. Program."},{"key":"1021_CR18","doi-asserted-by":"crossref","unstructured":"Bengtsson, M., Ottersten, B.: Handbook of antennas in wireless communications. In: Godara, L.C. (ed.) Optimal and Suboptimal Transmit Beamforming, CRC, Boco Raton (2001)","DOI":"10.1201\/9781420042146.ch18"},{"key":"1021_CR19","doi-asserted-by":"crossref","unstructured":"Shi, C., Berry, R.A., Honig, M.L.: Local interference pricing for distributed beamforming in MIMO networks. In: Military Communications Conference, MILCOM, pp. 1\u20136 (2009)","DOI":"10.1109\/MILCOM.2009.5379907"},{"key":"1021_CR20","doi-asserted-by":"crossref","first-page":"3117","DOI":"10.1109\/TIT.2011.2120270","volume":"57","author":"SJ Kim","year":"2011","unstructured":"Kim, S.J., Giannakis, G.B.: Optimal resource allocation for MIMO ad hoc cognitive radio networks. IEEE Trans. Inf. Theory 57, 3117\u20133131 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1021_CR21","doi-asserted-by":"crossref","first-page":"4331","DOI":"10.1109\/TSP.2011.2147784","volume":"59","author":"Q Shi","year":"2011","unstructured":"Shi, Q., Razaviyayn, M., Luo, Z.Q., He, C.: An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel. IEEE Trans. Signal Process. 59, 4331\u20134340 (2011)","journal-title":"IEEE Trans. Signal Process."},{"key":"1021_CR22","doi-asserted-by":"crossref","first-page":"2896","DOI":"10.1109\/TIT.2012.2184909","volume":"58","author":"M Razaviyayn","year":"2012","unstructured":"Razaviyayn, M., Sanjabi, M., Luo, Z.Q.: Linear transceiver design for interference alignment: complexity and computation. IEEE Trans. Inf. Theory 58, 2896\u20132910 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1021_CR23","doi-asserted-by":"crossref","unstructured":"Scutari, G., Facchinei, F., Song, P., Palomar, D.P., Pang, J.S.: Decomposition by partial linearization: parallel optimization of multi-agent systems. arXiv preprint, arXiv:1302.0756 (2013)","DOI":"10.1109\/TSP.2013.2293126"},{"key":"1021_CR24","unstructured":"Scutari, G., Palomar, D.P., Facchinei, F., Pang, J.S.: Distributed dynamic pricing for mimo interfering multiuser systems: a unified approach. In: 2011 5th International Conference on Network Games, Control and Optimization (NetGCooP), pp. 1\u20135 (2011)"},{"key":"1021_CR25","unstructured":"Hong, M., Luo, Z.Q.: Signal processing and optimal resource allocation for the interference channel. arXiv preprint, arXiv:1206.5144 (2012)"},{"key":"1021_CR26","doi-asserted-by":"crossref","unstructured":"Wajid, I., Eldar, Y.C., Gershman, A.: Robust downlink beamforming using covariance channel state information. In: IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, pp. 2285\u20132288 (2009)","DOI":"10.1109\/ICASSP.2009.4960076"},{"key":"1021_CR27","doi-asserted-by":"crossref","unstructured":"Vucic, N., Boche, H.: Downlink precoding for multiuser MISO systems with imperfect channel knowledge. In: IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, pp. 3121\u20133124 (2008)","DOI":"10.1109\/ICASSP.2008.4518311"},{"key":"1021_CR28","doi-asserted-by":"crossref","unstructured":"Song, E., Shi, Q., Sanjabi, M., Sun, R., Luo, Z.Q.: Robust SINR-constrained MISO downlink beamforming: When is semidefinite programming relaxation tight? In: IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, pp. 3096\u20133099 (2011)","DOI":"10.1109\/ICASSP.2011.5946350"},{"key":"1021_CR29","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1109\/TSP.2010.2082537","volume":"59","author":"A Tajer","year":"2011","unstructured":"Tajer, A., Prasad, N., Wang, X.: Robust linear precoder design for multi-cell downlink transmission. IEEE Trans. Signal Process. 59, 235\u2013251 (2011)","journal-title":"IEEE Trans. Signal Process."},{"key":"1021_CR30","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/JSAC.2008.080817","volume":"26","author":"M Shenouda","year":"2008","unstructured":"Shenouda, M., Davidson, T.N.: On the design of linear transceivers for multiuser systems with channel uncertainty. IEEE J. Sel. Areas Commun. 26, 1015\u20131024 (2008)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1021_CR31","doi-asserted-by":"crossref","unstructured":"Li, W.C., Chang, T.H., Lin, C., Chi, C.Y.: Coordinated beamforming for multiuser miso interference channel under rate outage constraints. IEEE Trans. Signal Process. 61(5), 1087\u20131103 (2013)","DOI":"10.1109\/TSP.2012.2231080"},{"key":"1021_CR32","doi-asserted-by":"crossref","unstructured":"Negro, F., Ghauri, I., Slock, D.: Sum rate maximization in the noisy MIMO interfering broadcast channel with partial CSIT via the expected weighted MSE. In: International Symposium on Wireless Communication Systems, ISWCS, pp. 576\u2013580 (2012)","DOI":"10.1109\/ISWCS.2012.6328433"},{"key":"1021_CR33","doi-asserted-by":"crossref","unstructured":"Razaviyayn, M., Baligh, H., Callard, A., Luo, Z.Q.: Joint transceiver design and user grouping in a MIMO interfering broadcast channel. In: 45th Annual Conference on Information Sciences and Systems (CISS) pp. 1\u20136 (2011)","DOI":"10.1109\/CISS.2011.5766122"},{"key":"1021_CR34","doi-asserted-by":"crossref","first-page":"4331","DOI":"10.1109\/TSP.2011.2147784","volume":"59","author":"Q Shi","year":"2011","unstructured":"Shi, Q., Razaviyayn, M., Luo, Z.Q., He, C.: An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel. IEEE Trans. Signal Process. 59, 4331\u20134340 (2011)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"1021_CR35","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/TIT.2005.844072","volume":"51","author":"D Guo","year":"2005","unstructured":"Guo, D., Shamai, S., Verd\u00fa, S.: Mutual information and minimum mean-square error in Gaussian channels. IEEE Trans. Inf. Theory 51(4), 1261\u20131282 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1021_CR36","doi-asserted-by":"crossref","first-page":"2198","DOI":"10.1109\/26.974266","volume":"49","author":"H Sampath","year":"2001","unstructured":"Sampath, H., Stoica, P., Paulraj, A.: Generalized linear precoder and decoder design for MIMO channels using the weighted MMSE criterion. IEEE Trans. Commun. 49(12), 2198\u20132206 (2001)","journal-title":"IEEE Trans. Commun."},{"issue":"2","key":"1021_CR37","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/JSAC.2013.130211","volume":"31","author":"M Hong","year":"2013","unstructured":"Hong, M., Sun, R., Baligh, H., Luo, Z.Q.: Joint base station clustering and beamformer design for partial coordinated transmission in heterogeneous networks. IEEE J. Sel. Areas Commun. 31(2), 226\u2013240 (2013)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1021_CR38","unstructured":"3GPP TR 36.814. In: http:\/\/www.3gpp.org\/ftp\/specs\/archive\/36_series\/36.814\/"},{"issue":"1","key":"1021_CR39","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.automatica.2011.09.043","volume":"48","author":"F Yousefian","year":"2012","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: On stochastic gradient and subgradient methods with adaptive steplength sequences. Automatica 48(1), 56\u201367 (2012)","journal-title":"Automatica"},{"key":"1021_CR40","doi-asserted-by":"crossref","unstructured":"Razaviyayn, M., Sanjabi, M., Luo, Z.Q.: A stochastic weighted MMSE approach to sum rate maximization for a MIMO interference channel. In: IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp. 325\u2013329 (2013)","DOI":"10.1109\/SPAWC.2013.6612065"},{"issue":"1","key":"1021_CR41","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/JSTSP.2007.914876","volume":"2","author":"ZQ Luo","year":"2008","unstructured":"Luo, Z.Q., Zhang, S.: Dynamic spectrum management: complexity and duality. IEEE J. Sel. Top. Signal Process. 2(1), 57\u201373 (2008)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1021_CR42","volume-title":"Weighted Sum-Rate Maximization in Wireless Networks: A Review","author":"PC Weeraddana","year":"2012","unstructured":"Weeraddana, P.C., Codreanu, M., Latva-aho, M., Ephremides, A., Fischione, C.: Weighted Sum-Rate Maximization in Wireless Networks: A Review. Now Publishers, Hanover (2012)"},{"issue":"12","key":"1021_CR43","doi-asserted-by":"crossref","first-page":"4792","DOI":"10.1109\/T-WC.2008.070851","volume":"7","author":"SS Christensen","year":"2008","unstructured":"Christensen, S.S., Agarwal, R., Carvalho, E., Cioffi, J.M.: Weighted sum-rate maximization using weighted MMSE for MIMO-BC beamforming design. IEEE Trans. Wirel. Commun. 7(12), 4792\u20134799 (2008)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"1021_CR44","doi-asserted-by":"crossref","unstructured":"Schmidt, D.A., Shi, C., Berry, R.A., Honig, M.L., Utschick, W.: Minimum mean squared error interference alignment. In: Forty-Third Asilomar Conference on Signals, Systems and Computers, pp. 1106\u20131110 (2009)","DOI":"10.1109\/ACSSC.2009.5470055"},{"key":"1021_CR45","doi-asserted-by":"crossref","unstructured":"Negro, F., Shenoy, S.P., Ghauri, I., Slock, D.T.: On the MIMO interference channel. In: Information Theory and Applications Workshop (ITA), 2010, pp. 1\u20139 (2010)","DOI":"10.1109\/ITA.2010.5454085"},{"key":"1021_CR46","doi-asserted-by":"crossref","unstructured":"Shin, J., Moon, J.: Weighted sum rate maximizing transceiver design in MIMO interference channel. In: Global Telecommunications Conference (GLOBECOM), pp. 1\u20135 (2011)","DOI":"10.1109\/GLOCOM.2011.6134569"},{"key":"1021_CR47","doi-asserted-by":"crossref","unstructured":"Razaviyayn, M., Baligh, H., Callard, A., Luo, Z.Q.: Joint transceiver design and user grouping in a MIMO interfering broadcast channel. In: 45th Annual Conference on Information Sciences and Systems (CISS), pp. 1\u20136 (2011)","DOI":"10.1109\/CISS.2011.5766122"},{"key":"1021_CR48","first-page":"9","volume":"5","author":"M Aharon","year":"2005","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: design of dictionaries for sparse representation. Proc. SPARS 5, 9\u201312 (2005)","journal-title":"Proc. SPARS"},{"issue":"2","key":"1021_CR49","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1162\/089976600300015826","volume":"12","author":"MS Lewicki","year":"2000","unstructured":"Lewicki, M.S., Sejnowski, T.J.: Learning overcomplete representations. Neural Comput. 12(2), 337\u2013365 (2000)","journal-title":"Neural Comput."},{"key":"1021_CR50","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11, 19\u201360 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"1021_CR51","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena-Scientific, Belmont (1999)","edition":"2"},{"key":"1021_CR52","doi-asserted-by":"crossref","unstructured":"Razaviyayn, M., Tseng, H.W., Luo, Z.Q.: Dictionary learning for sparse representation: Complexity and algorithms. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5247\u20135251 (2014)","DOI":"10.1109\/ICASSP.2014.6854604"},{"key":"1021_CR53","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"1021_CR54","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23(3), 462\u2013466 (1952)","journal-title":"Ann. Math. Stat."},{"issue":"4","key":"1021_CR55","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1021_CR56","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TAC.2012.2215413","volume":"58","author":"J Koshal","year":"2013","unstructured":"Koshal, J., Nedi\u0107, A., Shanbhag, U.V.: Regularized iterative stochastic approximation methods for stochastic variational inequality problems. IEEE Trans. Autom. Control 58(3), 594\u2013609 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1021_CR57","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"AS Nemirovsky","year":"1983","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"1021_CR58","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1214\/aoms\/1177728716","volume":"25","author":"KL Chung","year":"1954","unstructured":"Chung, K.L.: On a stochastic approximation method. Ann. Math. Stat. 25, 463\u2013483 (1954)","journal-title":"Ann. Math. Stat."},{"issue":"1\u20132","key":"1021_CR59","first-page":"1","volume":"9","author":"Y Ermoliev","year":"1983","unstructured":"Ermoliev, Y.: stochastic quasigradient methods and their application to system optimization. Stoch. Int. J. Probab. Stoch. Process. 9(1\u20132), 1\u201336 (1983)","journal-title":"Stoch. Int. J. Probab. Stoch. Process."},{"issue":"3","key":"1021_CR60","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/PGEC.1967.264666","volume":"16","author":"S Amari","year":"1967","unstructured":"Amari, S.: A theory of adaptive pattern classifiers. IEEE Trans. Electron. Comput. 16(3), 299\u2013307 (1967)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"1021_CR61","doi-asserted-by":"crossref","unstructured":"Wijnhoven, R., With, P.H.N.D.: Fast training of object detection using stochastic gradient descent. In: Proceedings of IEEE International Conference on Pattern Recognition (ICPR), pp. 424\u2013427 (2010)","DOI":"10.1109\/ICPR.2010.112"},{"issue":"6","key":"1021_CR62","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1109\/72.883426","volume":"11","author":"L Grippo","year":"2000","unstructured":"Grippo, L.: Convergent on-line algorithms for supervised learning in neural networks. IEEE Trans. Neural Netw. 11(6), 1284\u20131299 (2000)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"2","key":"1021_CR63","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1080\/10556789408805581","volume":"4","author":"OL Mangasarian","year":"1994","unstructured":"Mangasarian, O.L., Solodov, M.V.: Serial and parallel backpropagation convergence via nonmonotone perturbed minimization. Optim. Methods Softw. 4(2), 103\u2013116 (1994)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1021_CR64","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1162\/neco.1991.3.2.226","volume":"3","author":"ZQ Luo","year":"1991","unstructured":"Luo, Z.Q.: On the convergence of the LMS algorithm with adaptive learning rate for linear feedforward networks. Neural Comput. 3(2), 226\u2013245 (1991)","journal-title":"Neural Comput."},{"issue":"2","key":"1021_CR65","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1080\/10556789408805580","volume":"4","author":"ZQ Luo","year":"1994","unstructured":"Luo, Z.Q., Tseng, P.: Analysis of an approximate gradient projection method with applications to the backpropagation algorithm. Optim. Methods Softw. 4(2), 85\u2013101 (1994)","journal-title":"Optim. Methods Softw."},{"key":"1021_CR66","doi-asserted-by":"crossref","unstructured":"Bottou, L.: Online learning and stochastic approximations. In: On-Line Learning in Neural Networks, vol. 17(9) (1998)","DOI":"10.1017\/CBO9780511569920.003"},{"issue":"4","key":"1021_CR67","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1137\/S1052623495287022","volume":"7","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P.: A new class of incremental gradient methods for least squares problems. SIAM J. Optim. 7(4), 913\u2013926 (1997)","journal-title":"SIAM J. Optim."},{"key":"1021_CR68","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods, 2nd edn. Athena-Scientific, Belmont (1999)","edition":"2"},{"issue":"9","key":"1021_CR69","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TAC.1986.1104412","volume":"31","author":"J Tsitsiklis","year":"1986","unstructured":"Tsitsiklis, J., Bertsekas, D.P., Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Autom. Control 31(9), 803\u2013812 (1986)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1021_CR70","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02591967","volume":"27","author":"DP Bertsekas","year":"1983","unstructured":"Bertsekas, D.P.: Distributed asynchronous computation of fixed points. Math. Program. 27(1), 107\u2013120 (1983)","journal-title":"Math. Program."},{"issue":"2","key":"1021_CR71","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BF02742069","volume":"34","author":"YM Ermol\u2019ev","year":"1998","unstructured":"Ermol\u2019ev, Y.M., Norkin, V.I.: Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization. Cybern. Syst. Anal. 34(2), 196\u2013215 (1998)","journal-title":"Cybern. Syst. Anal."},{"issue":"3","key":"1021_CR72","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1137\/S1052623497331063","volume":"10","author":"DP Bertsekas","year":"2000","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Gradient convergence in gradient methods with errors. SIAM J. Optim. 10(3), 627\u2013642 (2000)","journal-title":"SIAM J. Optim."},{"key":"1021_CR73","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.P.: Incremental gradient, subgradient, and proximal methods for convex optimization: a survey. In: Optimization for Machine Learning 2010, pp. 1\u201338 (2011)","DOI":"10.7551\/mitpress\/8996.003.0006"},{"issue":"2","key":"1021_CR74","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/S1052623495294797","volume":"8","author":"P Tseng","year":"1998","unstructured":"Tseng, P.: An incremental gradient(-projection) method with momentum term and adaptive stepsize rule. SIAM J. Optim. 8(2), 506\u2013531 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1021_CR75","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10994-006-8365-9","volume":"65","author":"AP George","year":"2006","unstructured":"George, A.P., Powell, W.B.: Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming. Mach. Learn. 65(1), 167\u2013198 (2006)","journal-title":"Mach. Learn."},{"issue":"5","key":"1021_CR76","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1287\/opre.1110.0970","volume":"59","author":"M Broadie","year":"2011","unstructured":"Broadie, M., Cicek, D., Zeevi, A.: General bounds and finite-time improvement for the Kiefer\u2013Wolfowitz stochastic approximation algorithm. Oper. Res. 59(5), 1211\u20131224 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"1021_CR77","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120(1), 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"1021_CR78","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao, L.: Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res. 11, 2543\u20132596 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"1021_CR79","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for $$\\ell _1$$ \u2113 1 -regularized loss minimization. J. Mach. Learn. Res. 12, 1865\u20131892 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1021_CR80","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1090\/S0002-9947-1965-0192542-5","volume":"120","author":"DL Fisk","year":"1965","unstructured":"Fisk, D.L.: Quasi-martingales. Trans. Am. Math. Soc. 120, 369\u2013389 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"1021_CR81","volume-title":"Asymptotic Statistics","author":"AW Vaart Van der","year":"2000","unstructured":"Van der Vaart, A.W.: Asymptotic Statistics, vol. 3. Cambridge University Press, Cambridge (2000)"},{"key":"1021_CR82","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1090\/S0002-9947-1955-0076206-8","volume":"80","author":"E Hewitt","year":"1955","unstructured":"Hewitt, E., Savage, L.J.: Symmetric measures on cartesian products. Trans. Am. Math. Soc. 80, 470\u2013501 (1955)","journal-title":"Trans. Am. Math. Soc."},{"key":"1021_CR83","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1021-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1021-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1021-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T01:25:18Z","timestamp":1748913918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1021-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,6]]},"references-count":83,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["1021"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1021-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,6]]}}}