default search action
Ctirad Matonoha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c6]Jan Kalina
, Ctirad Matonoha:
Robustness of Supervised Learning Based on Combined Centroids. ICAISC (2) 2021: 171-182 - [c5]Ctirad Matonoha, Alexej Moskovka
Minimization of p-Laplacian via the Finite Element Method in MATLAB. LSSC 2021: 533-540 - [i1]Ctirad Matonoha, Alexej Moskovka, Jan Valdman:
Minimization of p-Laplacian via the Finite Element Method in MATLAB. CoRR abs/2103.02125 (2021)
2010 – 2019
- 2017
- [j12]Stepán Papácek
Closed-form formulas vs. PDE based numerical solution for the FRAP data processing: Theoretical and practical comparison. Comput. Math. Appl. 73(8): 1673-1683 (2017) - [c4]Ctirad Matonoha
Disc vs. Annulus: On the Bleaching Pattern Optimization for FRAP Experiments. HPCSE 2017: 160-173 - [c3]Stepán Papácek
Modeling and Simulation of Microalgae Growth in a Couette-Taylor Bioreactor. HPCSE 2017: 174-187 - 2015
- [j11]Ctirad Matonoha
On the connection and equivalence of two methods for solving an ill-posed inverse problem based on FRAP data. J. Comput. Appl. Math. 290: 598-608 (2015) - [c2]Ctirad Matonoha
Parameter Identification Problem Based on FRAP Images: From Data Processing to Optimal Design of Photobleaching Experiments. HPCSE 2015: 186-195 - [c1]Stepán Papácek
FRAP & FLIP: Two Sides of the Same Coin? IWBBIO (2) 2015: 444-455 - 2013
- [j10]Stepán Papácek
Estimation of diffusivity of phycobilisomes on thylakoid membrane based on spatio-temporal FRAP images. Math. Comput. Model. 57(7-8): 1907-1912 (2013) - [j9]Michal Cervinka
On the computation of relaxed pessimistic solutions to MPECs. Optim. Methods Softw. 28(1): 186-206 (2013) - 2012
- [j8]Stepán Papácek
Modelling and simulation of photosynthetic microorganism growth: random walk vs. finite difference method. Math. Comput. Simul. 82(10): 2022-2032 (2012) - 2011
- [j7]Stepán Papácek
Growth impact of hydrodynamic dispersion in a Couette-Taylor bioreactor. Math. Comput. Model. 54(7-8): 1791-1795 (2011) - 2010
- [j6]Ladislav Luksan, Ctirad Matonoha, Jan Vlcek:
Primal interior point method for minimization of generalized minimax functions. Kybernetika 46(4): 697-721 (2010)
2000 – 2009
- 2009
- [j5]Ladislav Luksan, Ctirad Matonoha, Jan Vlcek:
Primal Interior-Point Method for Large Sparse Minimax Optimization. Kybernetika 45(5): 841-864 (2009) - [j4]Ladislav Luksan, Ctirad Matonoha
Algorithm 896: LSA: Algorithms for large-scale optimization. ACM Trans. Math. Softw. 36(3): 16:1-16:29 (2009) - 2007
- [j3]Ladislav Luksan, Ctirad Matonoha
Trust-region interior-point method for large sparse l 1 optimization. Optim. Methods Softw. 22(5): 737-753 (2007) - 2005
- [j2]Ladislav Luksan, Ctirad Matonoha
Interior point methods for large-scale nonlinear programming. Optim. Methods Softw. 20(4-5): 569-582 (2005) - 2004
- [j1]Ladislav Luksan, Ctirad Matonoha
Interior-point method for non-linear non-convex optimization. Numer. Linear Algebra Appl. 11(5-6): 431-453 (2004)
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-04-25 05:55 CEST 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: