Of an Iterative Procedure for Solving the Optimization Problem into an Ellipsoid
On a devil’s staircase associated to the joint spectral radii of a family of pairs of matrices
The joint spectral radius of a finite set of real matrices is defined to be the maximum possible exponential rate of growth of products of matrices drawn from that set. In previous work with K. G. Hare and J. Theys we showed that for a certain one-parameter family of pairs of matrices, this maximum possible rate of growth is attained along Sturmian sequences with a certain characteristic ratio which depends continuously upon the parameter. In this note we answer some open questions from that paper...
On a dual network exterior point simplex type algorithm and its computational behavior
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, i.e....
On a dual network exterior point simplex type algorithm and its computational behavior∗
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a...
On a general convergence for Broyden like update method.
On a numerical method to approximate the solutions to bicriteria problems using a spline function
On a Numerical Treatment for the Curve-Tracing of the Homotopy Method.
On an iterative method for variational inequalities.
On an optimal setting of constant delays for the D-QSSA model reduction method applied to a class of chemical reaction networks
We develop and test a relatively simple enhancement of the classical model reduction method applied to a class of chemical networks with mass conservation properties. Both the methods, being (i) the standard quasi-steady-state approximation method, and (ii) the novel so-called delayed quasi-steady-state approximation method, firstly proposed by Vejchodský (2014), are extensively presented. Both theoretical and numerical issues related to the setting of delays are discussed. Namely, for one slightly...
On computer aided shape optimization
On Condition Numbers and the Distance to the Nearest Ill-posed Problem.
On extreme point fractional programming
On Finite Element Approximation in the L...-Norm of Variational Inequalities.
On first experiences with the implementation of a Newton based linear programming approach.
On fuzzy input data and the worst scenario method
In practice, input data entering a state problem are almost always uncertain to some extent. Thus it is natural to consider a set of admissible input data instead of a fixed and unique input. The worst scenario method takes into account all states generated by and maximizes a functional criterion reflecting a particular feature of the state solution, as local stress, displacement, or temperature, for instance. An increase in the criterion value indicates a deterioration in the featured quantity....
On Henrici's transformation in optimization
Henrici’s transformation is a generalization of Aitken’s -process to the vector case. It has been used for accelerating vector sequences. We use a modified version of Henrici’s transformation for solving some unconstrained nonlinear optimization problems. A convergence acceleration result is established and numerical examples are given.
On iterative methods for linearly constrained entropy maximization
On Khachian's Algorithm and Minimal Ellipsoids.
On maximizing a concave function subject to linear constraints by Newton's method
On multigrid for linear complementarity problems with application to American-style options.