On the optimal initial conditions for an inverse problem of model parameter estimation
Matonoha, Ctirad; Papáček, Š.
2017 - anglický Plné texty jsou dostupné v digitálním repozitáři Akademie Věd. On the optimal initial conditions for an inverse problem of model parameter estimation

Matonoha, Ctirad; Papáček, Š.
Ústav informatiky, 2017

A Generalized Limited-Memory BNS Method Based on the Block BFGS Update
Vlček, Jan; Lukšan, Ladislav
2017 - anglický A block version of the BFGS variable metric update formula is investigated. It satisfies the quasi-Newton conditions with all used difference vectors and gives the best improvement of convergence in some sense for quadratic objective functions, but it does not guarantee that the direction vectors are descent for general functions. To overcome this difficulty and utilize the advantageous properties of the block BFGS update, a block version of the limited-memory BNS method for large scale unconstrained optimization is proposed. The algorithm is globally convergent for convex sufficiently smooth functions and our numerical experiments indicate its efficiency. Klíčová slova: unconstrained minimization; block variable metric methods; limited-memory methods; the BFGS update; global convergence; numerical results Plné texty jsou dostupné v digitálním repozitáři Akademie Věd. A Generalized Limited-Memory BNS Method Based on the Block BFGS Update

A block version of the BFGS variable metric update formula is investigated. It satisfies the quasi-Newton conditions with all used difference vectors and gives the best improvement of convergence in ...

Vlček, Jan; Lukšan, Ladislav
Ústav informatiky, 2017

The IINC System under the ROOT Environment
Jiřina, Marcel
2017 - anglický Klíčová slova: IINC; data separation; classification; multivariate data; distance; metric Plné texty jsou dostupné v digitálním repozitáři Akademie Věd. The IINC System under the ROOT Environment

Jiřina, Marcel
Ústav informatiky, 2017

The use of sequential quadratic programming for solving reachability problems
Kuřátko, Jan
2017 - anglický Plné texty jsou dostupné v digitálním repozitáři Akademie Věd. The use of sequential quadratic programming for solving reachability problems

Kuřátko, Jan
Ústav informatiky, 2017

Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization
Vlček, Jan; Lukšan, Ladislav
2017 - anglický Klíčová slova: unconstrained minimization; block variable metric methods; limited-memory methods; the BFGS update; global convergence; numerical results Plné texty jsou dostupné v digitálním repozitáři NUŠL Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization

Vlček, Jan; Lukšan, Ladislav
Ústav informatiky, 2017

Nondeterministic Computations for Which Space is More Powerful than Time
Wiedermann, Jiří
2016 - anglický Klíčová slova: nondeterministic computation; crossing sequences; complexity Plné texty jsou dostupné v digitálním repozitáři NUŠL Nondeterministic Computations for Which Space is More Powerful than Time

Wiedermann, Jiří
Ústav informatiky, 2016

A Block Version of the BNS Limited-Memory Variable Metric Method for Unconstrained Minimization
Vlček, Jan; Lukšan, Ladislav
2016 - anglický Klíčová slova: unconstrained minimization; block variable metric methods; limited-memory methods; the BFGS update; global convergence; numerical results Plné texty jsou dostupné v digitálním repozitáři NUŠL A Block Version of the BNS Limited-Memory Variable Metric Method for Unconstrained Minimization

Vlček, Jan; Lukšan, Ladislav
Ústav informatiky, 2016

Maximum Likelihood Estimation of Diagonal Covariance Matrix
Turčičová, Marie; Mandel, Jan; Eben, Kryštof
2016 - anglický Klíčová slova: maximum likelihood estimation; parametric model; Fisher information; delta method Plné texty jsou dostupné v digitálním repozitáři NUŠL Maximum Likelihood Estimation of Diagonal Covariance Matrix

Turčičová, Marie; Mandel, Jan; Eben, Kryštof
Ústav informatiky, 2016

Cut Languages in Rational Bases
Šíma, Jiří; Savický, Petr
2016 - anglický We introduce a so-called cut language which contains the representations of numbers in a rational base that are less than a given threshold. The cut languages can be used to refine the analysis of neural net models between integer and rational weights. We prove a necessary and sufficient condition when a cut language is regular, which is based on the concept of a quasi-periodic power series. We show that any cut language with a rational threshold is context-sensitive while examples of non-context-free cut languages are presented. Klíčová slova: cut language; rational base; quassi-periodic power series Plné texty jsou dostupné v digitálním repozitáři NUŠL Cut Languages in Rational Bases

We introduce a so-called cut language which contains the representations of numbers in a rational base that are less than a given threshold. The cut languages can be used to refine the analysis of ...

Šíma, Jiří; Savický, Petr
Ústav informatiky, 2016

Interval Matrices: Regularity Yields Singularity
Rohn, Jiří
2016 - anglický It is proved that regularity of an interval matrix implies singularity of two related interval matrices. Klíčová slova: interval matrix; regularity; singularity Plné texty jsou dostupné v digitálním repozitáři NUŠL Interval Matrices: Regularity Yields Singularity

It is proved that regularity of an interval matrix implies singularity of two related interval matrices.

Rohn, Jiří
Ústav informatiky, 2016