Bemerkungen zur Optimierung eines gewissen Iterationsverfahrens
Bilevel Approach of a Decomposed Topology Optimization Problem
In topology optimization problems, we are often forced to deal with large-scale numerical problems, so that the domain decomposition method occurs naturally. Consider a typical topology optimization problem, the minimum compliance problem of a linear isotropic elastic continuum structure, in which the constraints are the partial differential equations of linear elasticity. We subdivide the partial differential equations into two subproblems posed...
Bilinear programming
Biochemical network of drug-induced enzyme production: Parameter estimation based on the periodic dosing response measurement
The well-known bottleneck of systems pharmacology, i. e., systems biology applied to pharmacology, refers to the model parameters determination from experimentally measured datasets. This paper represents the development of our earlier studies devoted to inverse (ill-posed) problems of model parameters identification. The key feature of this research is the introduction of control (or periodic forcing by an input signal being a drug intake) of the nonlinear model of drug-induced enzyme production...
Bounds for aggregated solid transportation problem and an improved disaggregation method
Brève communication. Performance du gradient réduit généralisé avec une méthode quasi newtonienne pour la programmation non linéaire
Brève communication. Résolution numérique d'inégalités variationnelles
Bundle-based decomposition : conditions for convergence
CAPS in Z(2,n)
We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.
Caracterización algebraica de las aristas infinitas en el conjunto dual factible de un PSI-lineal.
Las propiedades geométricas del conjunto factible del dual de un problema semiinfinito lineal son análogas a las correspondientes para el caso finito. En este trabajo mostramos cómo, a partir de la caracterización algebraica de vértices y direcciones extremas, se consigue la correspondiente para aristas infinitas, estableciéndose así las bases para una extensión del método simplex a programas semiinfinitos lineales.
Certain remarks on a class of evolution quasi-variational inequalities.
Cholesky-like factorizations of skew-symmetric matrices.
Classification of relative minima singularities
Combinatorial properties of Fourier-Motzkin elimination.
Combined trust region methods for nonlinear least squares
Commande optimale d'un modèle économétrique du Canada
Comment construire un graphe PERT minimal
Common solutions of an iterative scheme for variational inclusions, equilibrium problems, and fixed point problems.
Comparaison expérimentale d'algorithmes pour les problèmes de recouvrement et de maximisation d'une fonction pseudo-booléenne
Computational aspects of DYNAMICO : a model of trade and development in the world economy