Masoud Ahookhosh
Orcid: 0000-0003-4206-9789
According to our database1,
Masoud Ahookhosh
authored at least 22 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions.
Appl. Math. Comput., March, 2024
CoRR, 2024
2022
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity.
SIAM J. Optim., September, 2022
SIAM J. Math. Data Sci., 2022
Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods.
Optim. Methods Softw., 2022
2021
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima.
SIAM J. Optim., 2021
A Block Inertial Bregman Proximal Algorithm for Nonsmooth Nonconvex Problems with Application to Symmetric Nonnegative Matrix Tri-Factorization.
J. Optim. Theory Appl., 2021
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization.
Comput. Optim. Appl., 2021
2020
CoRR, 2020
2019
Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity.
Math. Methods Oper. Res., 2019
Multi-block Bregman proximal alternating linearized minimization and its application to sparse orthogonal nonnegative matrix factorization.
CoRR, 2019
Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity.
Adv. Comput. Math., 2019
2017
Optimal subgradient algorithms for large-scale convex optimization in simple domains.
Numer. Algorithms, 2017
An optimal subgradient algorithm for large-scale bound-constrained convex optimization.
Math. Methods Oper. Res., 2017
2014
An inexact line search approach using modified nonmonotone strategy for unconstrained optimization.
Numer. Algorithms, 2014
2013
Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations.
Numer. Algorithms, 2013
Int. J. Comput. Math., 2013
2012
Numer. Algorithms, 2012
2011
Combination Adaptive Trust Region Method by Non-Monotone Strategy for unconstrained nonlinear Programming.
Asia Pac. J. Oper. Res., 2011
2010
A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems.
Comput. Math. Appl., 2010