![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Masoud Ahookhosh
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Susan Ghaderi
, Masoud Ahookhosh
, Adam Arany, Alexander Skupin
, Panagiotis Patrinos
, Yves Moreau
:
Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions. Appl. Math. Comput. 464: 128377 (2024) - [i4]Sajad Faramarzi, Farzan Haddadi, Sajjad Amini, Masoud Ahookhosh:
Matrix Completion via Nonsmooth Regularization of Fully Connected Neural Networks. CoRR abs/2403.10232 (2024) - 2022
- [j17]Masoud Ahookhosh
, Ronan M. T. Fleming
, Phan Tu Vuong
:
Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods. Optim. Methods Softw. 37(1): 113-149 (2022) - [j16]Puya Latafat
, Andreas Themelis
, Masoud Ahookhosh
, Panagiotis Patrinos
:
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity. SIAM J. Optim. 32(3): 2230-2262 (2022) - [j15]Le Thi Khanh Hien
, Duy Nhat Phan, Nicolas Gillis
, Masoud Ahookhosh
, Panagiotis Patrinos:
Block Bregman Majorization Minimization with Extrapolation. SIAM J. Math. Data Sci. 4(1): 1-25 (2022) - 2021
- [j14]Masoud Ahookhosh
, Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos
:
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization. Comput. Optim. Appl. 79(3): 681-715 (2021) - [j13]Masoud Ahookhosh
, Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos
:
A Block Inertial Bregman Proximal Algorithm for Nonsmooth Nonconvex Problems with Application to Symmetric Nonnegative Matrix Tri-Factorization. J. Optim. Theory Appl. 190(1): 234-258 (2021) - [j12]Masoud Ahookhosh
, Andreas Themelis
, Panagiotis Patrinos
:
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima. SIAM J. Optim. 31(1): 653-685 (2021) - [i3]Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis, Masoud Ahookhosh, Panagiotis Patrinos:
Block Alternating Bregman Majorization Minimization with Extrapolation. CoRR abs/2107.04395 (2021) - 2020
- [i2]Masoud Ahookhosh, Nicolas Gillis, Panagiotis Patrinos:
A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems. CoRR abs/2003.03963 (2020)
2010 – 2019
- 2019
- [j11]Masoud Ahookhosh
, Francisco J. Aragón Artacho
, Ronan M. T. Fleming
, Phan Tu Vuong:
Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity. Adv. Comput. Math. 45(5): 2771-2806 (2019) - [j10]Masoud Ahookhosh
:
Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity. Math. Methods Oper. Res. 89(3): 319-353 (2019) - [i1]Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos:
Multi-block Bregman proximal alternating linearized minimization and its application to sparse orthogonal nonnegative matrix factorization. CoRR abs/1908.01402 (2019) - 2017
- [j9]Masoud Ahookhosh
, Arnold Neumaier
:
An optimal subgradient algorithm for large-scale bound-constrained convex optimization. Math. Methods Oper. Res. 86(1): 123-147 (2017) - [j8]Masoud Ahookhosh
, Arnold Neumaier
:
Optimal subgradient algorithms for large-scale convex optimization in simple domains. Numer. Algorithms 76(4): 1071-1097 (2017) - [j7]Ahmad Kamandi
, Keyvan Amini
, Masoud Ahookhosh
:
An improved adaptive trust-region algorithm. Optim. Lett. 11(3): 555-569 (2017) - 2014
- [j6]Keyvan Amini
, Masoud Ahookhosh
, Hadi Nosratipour:
An inexact line search approach using modified nonmonotone strategy for unconstrained optimization. Numer. Algorithms 66(1): 49-78 (2014) - 2013
- [j5]Masoud Ahookhosh
, Hamid Esmaeili, Morteza Kimiaei
:
An effective trust-region-based approach for symmetric nonlinear systems. Int. J. Comput. Math. 90(3): 671-690 (2013) - [j4]Masoud Ahookhosh
, Keyvan Amini
, Somayeh Bahrami:
Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations. Numer. Algorithms 64(1): 21-42 (2013) - 2012
- [j3]Masoud Ahookhosh
, Keyvan Amini
:
An efficient nonmonotone trust-region method for unconstrained optimization. Numer. Algorithms 59(4): 523-540 (2012) - 2011
- [j2]Keyvan Amini
, Masoud Ahookhosh
:
Combination Adaptive Trust Region Method by Non-Monotone Strategy for unconstrained nonlinear Programming. Asia Pac. J. Oper. Res. 28(5): 585-600 (2011) - 2010
- [j1]Masoud Ahookhosh
, Keyvan Amini
:
A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems. Comput. Math. Appl. 60(3): 411-422 (2010)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint