default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarat S. Mukhametzhanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Alberto Falcone
, Alfredo Garro, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev:
Advantages of the usage of the Infinity Computer for reducing the Zeno behavior in hybrid system models. Soft Comput. 27(12): 8189-8208 (2023)- 2022
- [j14]Alberto Falcone, Alfredo Garro, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev:
Simulation of hybrid systems under Zeno behavior using numerical infinitesimals. Commun. Nonlinear Sci. Numer. Simul. 111: 106443 (2022) - [j13]Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov:
A Generator of Multiextremal Test Classes With Known Solutions for Black-Box-Constrained Global Optimization. IEEE Trans. Evol. Comput. 26(6): 1261-1270 (2022) - [i2]Marat S. Mukhametzhanov:
High Precision Differentiation Techniques for Data-Driven Solution of Nonlinear PDEs by Physics-Informed Neural Networks. CoRR abs/2210.00518 (2022) - 2021
- [j12]Alberto Falcone, Alfredo Garro, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev:
A Simulink-based software solution using the Infinity Computer methodology for higher order differentiation. Appl. Math. Comput. 409: 125606 (2021) - [j11]Yaroslav D. Sergeyev, Maria Chiara Nasso, Marat S. Mukhametzhanov, Dmitri E. Kvasov:
Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives. J. Comput. Appl. Math. 383: 113134 (2021) - [j10]Felice Iavernaro, Francesca Mazzia, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev:
Computation of higher order Lie derivatives on the Infinity Computer. J. Comput. Appl. Math. 383: 113135 (2021) - [j9]Roberto Cavoretto, Alessandra De Rossi, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev:
On the search of the shape parameter in radial basis functions using univariate global optimization methods. J. Glob. Optim. 79(2): 305-327 (2021) - 2020
- [j8]Alberto Falcone, Alfredo Garro, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev:
Representation of grossone-based arithmetic in simulink for scientific computing. Soft Comput. 24(23): 17525-17539 (2020)
2010 – 2019
- 2019
- [c3]Alberto Falcone, Alfredo Garro, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev:
A Simulink-Based Infinity Computer Simulator and Some Applications. NUMTA (2) 2019: 362-369 - [c2]Dmitri E. Kvasov, Marat S. Mukhametzhanov, Maria Chiara Nasso, Yaroslav D. Sergeyev:
On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods. NUMTA (2) 2019: 413-421 - 2018
- [j7]Dmitri E. Kvasov, Marat S. Mukhametzhanov:
Metaheuristic vs. deterministic global optimization algorithms: The univariate case. Appl. Math. Comput. 318: 245-259 (2018) - [j6]Manlio Gaudioso, Giovanni Giallombardo, Marat S. Mukhametzhanov:
Numerical infinitesimals in a variable metric method for convex nonsmooth optimization. Appl. Math. Comput. 318: 312-320 (2018) - [j5]Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov:
On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales. Commun. Nonlinear Sci. Numer. Simul. 59: 319-330 (2018) - [i1]Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov:
On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales. CoRR abs/1801.05306 (2018) - 2017
- [j4]Pierluigi Amodio, Felice Iavernaro, Francesca Mazzia, Marat S. Mukhametzhanov, Yaroslav D. Sergeyev:
A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic. Math. Comput. Simul. 141: 24-39 (2017) - [j3]Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov:
Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms. Math. Comput. Simul. 141: 96-109 (2017) - [c1]Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov:
Emmental-Type GKLS-Based Multiextremal Smooth Test Problems with Non-linear Constraints. LION 2017: 383-388 - 2016
- [j2]Yaroslav D. Sergeyev, Marat S. Mukhametzhanov, Francesca Mazzia, Felice Iavernaro, Pierluigi Amodio:
Numerical Methods for Solving Initial Value Problems on the Infinity Computer. Int. J. Unconv. Comput. 12(1): 3-23 (2016) - [j1]Yaroslav D. Sergeyev, Marat S. Mukhametzhanov, Dmitri E. Kvasov, Daniela Lera:
Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization. J. Optim. Theory Appl. 171(1): 186-208 (2016) - [p1]Yaroslav D. Sergeyev, Dmitri E. Kvasov, Marat S. Mukhametzhanov:
On the Least-Squares Fitting of Data by Sinusoids. Advances in Stochastic and Deterministic Global Optimization 2016: 209-226
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 2025-01-21 00:05 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:
