Path-based incremental target level algorithm on Riemannian manifolds

References

• Shi Q, He C. A new incremental optimization algorithm for ML-based source localization in sensor networks. IEEE Signal Proc Lett. 2008;15:45–48. doi: 10.1109/LSP.2007.911180
   Web of Science ®Google Scholar
• Sharma S, Teneketzis D. An externalities-based decentralized optimal power allocation algorithm for wireless networks. IEEE ACM Trans Netw. 2009;17(6):1819–1831. doi: 10.1109/TNET.2009.2020162
   Web of Science ®Google Scholar
• Wei E, Ozdaglar A, Jadbabaie A. A distributed newton method for network utility maximization – part II: convergence. IEEE T Automat Contr. 2013;58(9):2176–2188. doi: 10.1109/TAC.2013.2253223
   Web of Science ®Google Scholar
• Iiduka H. Fixed-point optimization algorithms for distributed optimization in networked systems. SIAM J Optim. 2013;23(1):1–26. doi: 10.1137/120866877
   Web of Science ®Google Scholar
• Bedi AS, Rajawat K. Asynchronous incremental stochastic dual descent algorithm for network resource allocation. IEEE T Signal Proces. 2018;66(9):2229–2244. doi: 10.1109/TSP.2018.2807423
   Web of Science ®Google Scholar
• Kibardin VM. Decomposition into functions in the minimization problem. Automat Rem Contr+. 1980;40:1311–1323.
   Web of Science ®Google Scholar
• Nedić A, Bertsekas DP. Incremental subgradient methods for nondifferentiable optimization. SIAM J Optim. 2001;12:109–138. doi: 10.1137/S1052623499362111
   Web of Science ®Google Scholar
• Nedić A, Bertsekas DP. Convergence rate of incremental subgradient algorithms. Stoch Optim: Algorithms Appl. 2001;54:223–264.
   Google Scholar
• Kiwiel K. Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J Optim. 2004;14(3):807–840. doi: 10.1137/S1052623400376366
   Web of Science ®Google Scholar
• Johansson B, Rabi M, Johansson M. A randomized incremental subgradient method for distributed optimization in networked systems. SIAM J Optim. 2009;20(3):1157–1170. doi: 10.1137/08073038X
   Web of Science ®Google Scholar
• Ram SS, Nedić A, Veeravalli VV. Incremental stochastic subgradient slgorithms for convex optimization. SIAM J Optim. 2009;20:691–717. doi: 10.1137/080726380
   Web of Science ®Google Scholar
• Bertsekas D. Incremental proximal methods for large scale convex optimization. Math Program. 2011;129(2):163–195. doi: 10.1007/s10107-011-0472-0
   Web of Science ®Google Scholar
• Cruz J, Millán R. A direct splitting method for nonsmooth variational inequalities. J Optim Theory Appl. 2014;161(3):728–737. doi: 10.1007/s10957-013-0478-2
   Web of Science ®Google Scholar
• Iiduka H. Incremental subgradient method for nonsmooth convex optimization with fixed point constraints. Optim Methods Softw. 2016;31(5):1–21. doi: 10.1080/10556788.2016.1175002
   Web of Science ®Google Scholar
• Goffin J, Kiwiel K. Convergence of a simple subgradient level method. Math Program. 1999;85(1):207–211. doi: 10.1007/s101070050053
   Web of Science ®Google Scholar
• Zhang P. Path-based incremental target level algorithm for nondifferentiable optimization. Fifth International Workshop on Chaos-Fractals Theories and Applications. IEEE Computer Society; 2012. p. 123–126.
   Google Scholar
• Li C, Mordukhovich BS, Wang JH, et al. Weak sharp minima on Riemannian manifolds. SIAM J Optim. 2011;21(4):1523–1560. doi: 10.1137/09075367X
   Web of Science ®Google Scholar
• Udriste C. Convex functions and optimization algorithms on Riemannian manifolds. Vol. 297, Mathematics and its applications. Dordrecht: Kluwer Academic; 1994.
   Google Scholar
• Neto JXDC, Ferreira OP, Pérez LRL, et al. Convex-and monotone-transformable mathematical programming problems and a proximal-like point method. J Glob Optim. 2006;35:53–69. doi: 10.1007/s10898-005-6741-9
   Web of Science ®Google Scholar
• Colao V, López G, Marino G, et al. Equilibrium problems in Hadamard manifolds. J Math Anal Appl. 2012;388:61–77. doi: 10.1016/j.jmaa.2011.11.001
   Web of Science ®Google Scholar
• Ferreira OP, Iusem AN, Németh SZ. Concepts and techniques of optimization on the sphere. TOP. 2014;22:1148–1170. doi: 10.1007/s11750-014-0322-3
   Web of Science ®Google Scholar
• Ferreira OP, Oliveira PR. Subgradient algorithm on Riemannian manifolds. J Optim Theory Appl. 1998;97:93–104. doi: 10.1023/A:1022675100677
   Web of Science ®Google Scholar
• Ferreira OP. Proximal subgradient and a characterization of Lipschitz function on Riemannian manifolds. J Math Anal Appl. 2006;313:587–597. doi: 10.1016/j.jmaa.2005.08.049
   Web of Science ®Google Scholar
• Bento GC, CruzNeto JX. A subgradient method for multiobjective optimization on Riemannian manifolds. J Optim Theory Appl. 2013;159:125–137. doi: 10.1007/s10957-013-0307-7
   Web of Science ®Google Scholar
• Grohs P, Hosseini S. ϵ-subgradient algorithms for locally lipschitz functions on Riemannian manifolds. Adv Comput Math. 2016;42(2):333–360. doi: 10.1007/s10444-015-9426-z
   Web of Science ®Google Scholar
• Bento GC, Melo JG. Subgradient method for convex feasibility on Riemannian manifolds. J Optim Theory Appl. 2012;152:773–785. doi: 10.1007/s10957-011-9921-4
   Web of Science ®Google Scholar
• Wang XM, Li C, Wang JH, et al. Linear convergence of subgradient algorithm for convex feasibility on Riemannian manifold. SIAM J Optim. 2015;25(4):2334–2358. doi: 10.1137/14099961X
   Web of Science ®Google Scholar
• Wang XM, Li C, Yao JC. Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures. J Optim Theory Appl. 2015;164:202–217. doi: 10.1007/s10957-014-0568-9
   Web of Science ®Google Scholar
• Bento GC, Ferreira OP, Melo JG. Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds. J Optim Theory Appl. 2017;173:548–562. doi: 10.1007/s10957-017-1093-4
   Web of Science ®Google Scholar
• Ferreira OP, Louzeiro MS, Prudente LF. Iteration-complexity of the subgradient method on Riemannian manifolds with lower bouneded curvature. Optimization. 2019;68(4):713–729. doi: 10.1080/02331934.2018.1542532
   Web of Science ®Google Scholar
• Wang XM. Subgradient algorithms on Riemannian manifolds of lower bounded curvatures. Optimization. 2018;67(1):179–194. doi: 10.1080/02331934.2017.1387548
   Web of Science ®Google Scholar
• Brännlund U. On relaxation methods for monsmooth convex optimization [PhD thesis]. Stockholm: Department of Mathematics, Royal Institute of Technology; 1993.
   Google Scholar
• Zhang P, Bao G. An incremental subgradient method on riemannian manifolds. J Optim Theory and Appl. 2018;176(3):711–727. doi: 10.1007/s10957-018-1224-6
   Web of Science ®Google Scholar
• DoCarmo MP. Riemannian geometry. Boston (MA): Birkhäuser Boston; 1992.
   Google Scholar
• Sakai T. Riemannian geometry. Translations of mathematical monographs. Providence (RI): American Mathematical Society; 1996.
   Google Scholar
• Alber YI, Iusem AN, Solodov MV. On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Math Program. 1998;81:23–35.
   Web of Science ®Google Scholar
• Knopp K. Theory and application of infinite series. New York: Hafner Publishing Company; 1990.
   Google Scholar
• Afsari B, Tron R, Vidal R. On the convergence of gradient descent for finding the Riemannian center of mass. SIAM J Control Optim. 2013;51(3):2230–2260. doi: 10.1137/12086282X
   Web of Science ®Google Scholar