On Multi-Grid Methods for Variational Inequalities.
On Newton's Method.
On Newton's polygons, Gröbner bases and series expansions of perturbed polynomial programs
In this note we consider a perturbed mathematical programming problem where both the objective and the constraint functions are polynomial in all underlying decision variables and in the perturbation parameter ε. Recently, the theory of Gröbner bases was used to show that solutions of the system of first order optimality conditions can be represented as Puiseux series in ε in a neighbourhood of ε = 0. In this paper we show that the determination of the branching order and the order of the pole (if...
On numerical solution of a variational inequality of the 4th order by finite element method
The problem of a thin elastic plate, deflection of which is limited below by a rigid obstacle is solved. Using Ahlin's and Ari-Adini's elements on rectangles, the convergence is established and SOR method with constraints is proposed for numerical solution.
On numerical solution of optimal control problems with nonsmooth objectives: Application to economic models
On numerical solution of weight minimization of elastic bodies weakly supporting tension
Shape optimization of a two-dimensional elastic body is considered, provided the material is weakly supporting tension. The problem generalizes that of a masonry dam subjected to its weight and to the hydrostatic pressure. A part of the boundary has to be found so as to minimize a given cost functional. The numerical realization using a penalty method and finite element technique is presented. Some typical results are shown.
On optimal methods in numerical analysis
Round-off error analysis of the gradient method.
On optimizing a maximin nonlinear function subject to replicated quasi-arborescence-like constraints.
In this paper we present the motivation for using the Truncated Newton method in an algorithm that maximises a non-linear function with additional maximin-like arguments subject to a network-like linear system of constraints. The special structure of the network (so-termed replicated quasi-arborescence) allows to introduce the new concept of independent superbasic sets and, then, using second-order information about the objective function without too much computer effort and storage.
On Orthogonal Linear ...1 Approximation.
On parameter estimation in an in vitro compartmental model for drug-induced enzyme production in pharmacotherapy
A pharmacodynamic model introduced earlier in the literature for in silico prediction of rifampicin-induced CYP3A4 enzyme production is described and some aspects of the involved curve-fitting based parameter estimation are discussed. Validation with our own laboratory data shows that the quality of the fit is particularly sensitive with respect to an unknown parameter representing the concentration of the nuclear receptor PXR (pregnane X receptor). A detailed analysis of the influence of that parameter...
On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method
For a linear complementarity problem with inconsistent system of constraints a notion of quasi-solution of Tschebyshev type is introduced. It’s shown that this solution can be obtained automatically by Lemke’s method if the constraint matrix of the original problem is copositive plus or belongs to the intersection of matrix classes P 0 and Q 0.
On second–order Taylor expansion of critical values
Studying a critical value function in parametric nonlinear programming, we recall conditions guaranteeing that is a function and derive second order Taylor expansion formulas including second-order terms in the form of certain generalized derivatives of . Several specializations and applications are discussed. These results are understood as supplements to the well–developed theory of first- and second-order directional differentiability of the optimal value function in parametric optimization....
On solution to an optimal shape design problem in 3-dimensional linear magnetostatics
In this paper we present theoretical, computational, and practical aspects concerning 3-dimensional shape optimization governed by linear magnetostatics. The state solution is approximated by the finite element method using Nédélec elements on tetrahedra. Concerning optimization, the shape controls the interface between the air and the ferromagnetic parts while the whole domain is fixed. We prove the existence of an optimal shape. Then we state a finite element approximation to the optimization...
On Solving the Maximum Betweenness Problem Using Genetic Algorithms
In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For those...
On solving the Plateau problem in parametric form.
On some machine sequencing problems (II)
On stable least squares solution to the system of linear inequalities
The system of inequalities is transformed to the least squares problem on the positive ortant. This problem is solved using orthogonal transformations which are memorized as products. Author’s previous paper presented a method where at each step all the coefficients of the system were transformed. This paper describes a method applicable also to large matrices. Like in revised simplex method, in this method an auxiliary matrix is used for the computations. The algorithm is suitable for unstable...
On the acceleration of adaptation processes by two-step principles
On the Accuracy of Regularized Solutions to Quadratic Minimization Problems on a Half-Space, in Case of a Normally Solvable Operator
On the application of parallel architectures to a class of operations research problems