default search action
Morteza Kimiaei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Andrea Brilli, Morteza Kimiaei, Giampaolo Liuzzi
, Stefano Lucidi:
Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms. J. Optim. Theory Appl. 203(1): 419-454 (2024) - [j17]Morteza Kimiaei
Effective matrix adaptation strategy for noisy derivative-free optimization. Math. Program. Comput. 16(3): 459-501 (2024) - [j16]Arnold Neumaier, Morteza Kimiaei
Globally linearly convergent nonlinear conjugate gradients without Wolfe line search. Numer. Algorithms 97(4): 1607-1633 (2024) - [j15]Arnold Neumaier, Morteza Kimiaei
An improvement of the Goldstein line search. Optim. Lett. 18(6): 1313-1333 (2024) - 2023
- [j14]Morteza Kimiaei
New Subspace Method for Unconstrained Derivative-Free Optimization. ACM Trans. Math. Softw. 49(4): 39:1-39:28 (2023) - 2022
- [j13]Morteza Kimiaei
LMBOPT: a limited memory method for bound-constrained optimization. Math. Program. Comput. 14(2): 271-318 (2022) - [j12]Morteza Kimiaei
Efficient unconstrained black box optimization. Math. Program. Comput. 14(2): 365-414 (2022) - [j11]Morteza Kimiaei
A new limited memory method for unconstrained nonlinear least squares. Soft Comput. 26(2): 465-490 (2022)
2010 – 2019
- 2019
- [j10]Keyvan Amini
A non-monotone pattern search approach for systems of nonlinear equations. Int. J. Comput. Math. 96(1): 33-50 (2019) - [j9]Morteza Kimiaei
Impulse noise removal by an adaptive trust-region method. Soft Comput. 23(22): 11901-11923 (2019) - 2018
- [j8]Hamid Esmaeili, Majid Rostami, Morteza Kimiaei
Combining line search and trust-region methods for ℓ1-minimization. Int. J. Comput. Math. 95(10): 1950-1972 (2018) - 2016
- [j7]Keyvan Amini
A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations. 4OR 14(2): 133-152 (2016) - [j6]Farzad Rahpeymaii, Morteza Kimiaei
A limited memory quasi-Newton trust-region method for box constrained optimization. J. Comput. Appl. Math. 303: 105-118 (2016) - [j5]Morteza Kimiaei
Impulse noise removal based on new hybrid conjugate gradient approach. Kybernetika 52(5): 791-823 (2016) - [j4]Hamid Esmaeili, Morteza Kimiaei
A trust-region method with improved adaptive radius for systems of nonlinear equations. Math. Methods Oper. Res. 83(1): 109-125 (2016) - [j3]Morteza Kimiaei
A trust-region approach with novel filter adaptive radius for system of nonlinear equations. Numer. Algorithms 73(4): 999-1016 (2016) - 2015
- [j2]Hamid Esmaeili, Morteza Kimiaei
An efficient adaptive trust-region method for systems of nonlinear equations. Int. J. Comput. Math. 92(1): 151-166 (2015) - 2013
- [j1]Masoud Ahookhosh
An effective trust-region-based approach for symmetric nonlinear systems. Int. J. Comput. Math. 90(3): 671-690 (2013)
Coauthor Index
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-12-26 01:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: