Ratio rewards in networks
Reconstruction of map projection, its inverse and re-projection
This paper focuses on the automatic recognition of map projection, its inverse and re-projection. Our analysis leads to the unconstrained optimization solved by the hybrid BFGS nonlinear least squares technique. The objective function is represented by the squared sum of the residuals. For the map re-projection the partial differential equations of the inverse transformation are derived. They can be applied to any map projection. Illustrative examples of the stereographic and globular Nicolosi projections...
Regions of stability for ill-posed convex programs: An addendum
The marginal value formula in convex optimization holds in a more restrictive region of stability than that recently claimed in the literature. This is due to the fact that there are regions of stability where the Lagrangian multiplier function is discontinuous even for linear models.
Regularization in state space
Regulatory network of drug-induced enzyme production: parameter estimation based on the periodic dosing response measurement
The common goal of systems pharmacology, i.e. systems biology applied to the field of pharmacology, is to rely less on trial and error in designing an input-output systems, e.g. therapeutic schedules. In this paper we present, on the paradigmatic example of a regulatory network of drug-induced enzyme production, the further development of the study published by Duintjer Tebbens et al. (2019) in the Applications of Mathematics. Here, the key feature is that the nonlinear model in form of an ODE system...
Répartition optimale de la puissance dans une centrale hydraulique à réserve pompée
Representación finita de sistemas de infinitas inecuaciones.
Dado un Problema de Programación Semi-Infinita, si se puede obtener una representación finita del conjunto factible, pueden aplicarse para resolver el problema los métodos de programación con restricciones finitas.En la primera parte se caracterizan los sistemas lineales infinitos que pueden ser reducidos a un sistema finito equivalente, dándose además condiciones suficientes y métodos para efectuar tal reducción. En la segunda parte se establecen diferentes procedimientos de obtención de la representación...
Représentation de matrices euclidiennes en vue de leur génération aléatoire
Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux
Resolvent iterative methods for solving system of extended general variational inclusions.
Riemannian convexity.
Riemannian convexity in programming. II.
Robust preconditioners for the matrix free truncated Newton method
New positive definite preconditioners for the matrix free truncated Newton method are given. Corresponding algorithms are described in detail. Results of numerical experiments that confirm the efficiency and robustness of the preconditioned truncated Newton method are reported.
Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation.
Schwankungsbereiche linearer Optimierungsaufgaben.
Segmentation of images by variational methods: a constructive approach.
Semi-infinite programming problems
Semi–smooth Newton methods for variational inequalities of the first kind
Semi–smooth Newton methods are analyzed for a class of variational inequalities in infinite dimensions. It is shown that they are equivalent to certain active set strategies. Global and local super-linear convergence are proved. To overcome the phenomenon of finite speed of propagation of discretized problems a penalty version is used as the basis for a continuation procedure to speed up convergence. The choice of the penalty parameter can be made on the basis of an estimate for the penalized...
Semi–Smooth Newton Methods for Variational Inequalities of the First Kind
Semi–smooth Newton methods are analyzed for a class of variational inequalities in infinite dimensions. It is shown that they are equivalent to certain active set strategies. Global and local super-linear convergence are proved. To overcome the phenomenon of finite speed of propagation of discretized problems a penalty version is used as the basis for a continuation procedure to speed up convergence. The choice of the penalty parameter can be made on the basis of an L∞ estimate for the penalized...
Sensor Location Problem for a Multigraph
MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35We introduce sparse linear underdetermined systems with embedded network structure. Their structure is inherited from the non-homogeneous network ow programming problems with nodes of variable intensities. One of the new applications of the researched underdetermined systems is the sensor location problem (SLP) for a multigraph. That is the location of the minimum number of sensors in the nodes of the multigraph, in order to determine the arcs ow...