A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems. - Masoud Ahookhosh; Keyvan Amini (Comput. Math. Appl., 2010)

Combination Adaptive Trust Region Method by Non-Monotone Strategy for unconstrained nonlinear Programming. - Keyvan Amini; Masoud Ahookhosh (Asia Pac. J. Oper. Res., 2011)

An efficient nonmonotone trust-region method for unconstrained optimization. - Masoud Ahookhosh; Keyvan Amini (Numer. Algorithms, 2012)

An effective trust-region-based approach for symmetric nonlinear systems. - Masoud Ahookhosh; Hamid Esmaeili; Morteza Kimiaei (Int. J. Comput. Math., 2013)

Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations. - Masoud Ahookhosh; Keyvan Amini; Somayeh Bahrami (Numer. Algorithms, 2013)

An inexact line search approach using modified nonmonotone strategy for unconstrained optimization. - Keyvan Amini; Masoud Ahookhosh; Hadi Nosratipour (Numer. Algorithms, 2014)

An optimal subgradient algorithm for large-scale bound-constrained convex optimization. - Masoud Ahookhosh; Arnold Neumaier (Math. Methods Oper. Res., 2017)

Optimal subgradient algorithms for large-scale convex optimization in simple domains. - Masoud Ahookhosh; Arnold Neumaier (Numer. Algorithms, 2017)

An improved adaptive trust-region algorithm. - Ahmad Kamandi; Keyvan Amini; Masoud Ahookhosh (Optim. Lett., 2017)

Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity. - Masoud Ahookhosh; Francisco J. Aragón Artacho; Ronan M. T. Fleming; Phan Tu Vuong (Adv. Comput. Math., 2019)

Multi-block Bregman proximal alternating linearized minimization and its application to sparse orthogonal nonnegative matrix factorization. - Masoud Ahookhosh; Le Thi Khanh Hien; Nicolas Gillis; Panagiotis Patrinos (CoRR, 2019)

Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity. - Masoud Ahookhosh (Math. Methods Oper. Res., 2019)

A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems. - Masoud Ahookhosh; Nicolas Gillis; Panagiotis Patrinos (CoRR, 2020)

Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization. - Masoud Ahookhosh; Le Thi Khanh Hien; Nicolas Gillis; Panagiotis Patrinos (Comput. Optim. Appl., 2021)

Block Alternating Bregman Majorization Minimization with Extrapolation. - Le Thi Khanh Hien; Duy Nhat Phan; Nicolas Gillis; Masoud Ahookhosh; Panagiotis Patrinos (CoRR, 2021)

A Block Inertial Bregman Proximal Algorithm for Nonsmooth Nonconvex Problems with Application to Symmetric Nonnegative Matrix Tri-Factorization. - Masoud Ahookhosh; Le Thi Khanh Hien; Nicolas Gillis; Panagiotis Patrinos (J. Optim. Theory Appl., 2021)

A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima. - Masoud Ahookhosh; Andreas Themelis; Panagiotis Patrinos (SIAM J. Optim., 2021)

Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods. - Masoud Ahookhosh; Ronan M. T. Fleming; Phan Tu Vuong (Optim. Methods Softw., 2022)

Block Bregman Majorization Minimization with Extrapolation. - Le Thi Khanh Hien; Duy Nhat Phan; Nicolas Gillis; Masoud Ahookhosh; Panagiotis Patrinos (SIAM J. Math. Data Sci., 2022)

Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity. - Puya Latafat; Andreas Themelis; Masoud Ahookhosh; Panagiotis Patrinos (SIAM J. Optim., 2022)

Matrix Completion via Nonsmooth Regularization of Fully Connected Neural Networks. - Sajad Faramarzi; Farzan Haddadi; Sajjad Amini; Masoud Ahookhosh (CoRR, 2024)

Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions. - Susan Ghaderi; Masoud Ahookhosh; Adam Arany; Alexander Skupin; Panagiotis Patrinos; Yves Moreau (Appl. Math. Comput., 2024)

High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. - Masoud Ahookhosh; Yurii E. Nesterov (Math. Program., 2024)

Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. - Masoud Ahookhosh; Yurii E. Nesterov (Math. Program., 2024)