Kaya, KamerOztoprak, FigenBirbil, S. IlkerCemgil, A. TaylanSimsekli, UmutKuru, NurdanKoptagel, Hazal2024-07-182024-07-1820190926-60031573-2894https://doi.org/10.1007/s10589-018-00057-7https://hdl.handle.net/11411/7163We propose Hessian Approximated Multiple Subsets Iteration (HAMSI), which is a generic second order incremental algorithm for solving large-scale partially separable convex and nonconvex optimization problems. The algorithm is based on a local quadratic approximation, and hence, allows incorporating curvature information to speed-up the convergence. HAMSI is inherently parallel and it scales nicely with the number of processors. We prove the convergence properties of our algorithm when the subset selection step is deterministic. Combined with techniques for effectively utilizing modern parallel computer architectures, we illustrate that a particular implementation of the proposed method based on L-BFGS updates converges more rapidly than a parallel gradient descent when both methods are used to solve large-scale matrix factorization problems. This performance gain comes only at the expense of using memory that scales linearly with the total size of the optimization variables. We conclude that HAMSI may be considered as a viable alternative in many large scale problems, where first order methods based on variants of gradient descent are applicable.eninfo:eu-repo/semantics/openAccessLarge-Scale Unconstrained OptimizationSecond Order İnformationShared-Memory Parallel İmplementationBalanced ColoringBalanced StratificationMatrix FactorizationArticle2-s2.0-8505964869610.1007/s10589-018-00057-77053Q167572Q1WOS:000463792400006