Sanjo Zlobec (1986)
Aplikace matematiky
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.
G. Chavent, K. Kunisch (1993)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Papáček, Štěpán, Lynnyk, Volodymyr, Rehák, Branislav (2021)
Programs and Algorithms of Numerical Mathematics
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...
Jacques Gauvin, Pierre Parent, Gilles Savard (1986)
RAIRO - Operations Research - Recherche Opérationnelle
Miguel Angel Goberna Torrent, Marco A. López Cerdá, Jesús T. Pastor Ciurana (1982)
Trabajos de Estadística e Investigación Operativa
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...
Jean Bovet (1985)
RAIRO - Operations Research - Recherche Opérationnelle
M. Minoux (1975)
RAIRO - Operations Research - Recherche Opérationnelle
Noor, Muhammad Aslam, Noor, Khalida Inayat, Al-Said, Eisa (2011)
Journal of Inequalities and Applications [electronic only]
Udrişte, Constantin (1996)
Balkan Journal of Geometry and its Applications (BJGA)
Udrişte, Constantin (1996)
Balkan Journal of Geometry and its Applications (BJGA)
Lukšan, Ladislav, Matonoha, Ctirad, Vlček, Jan (2010)
Programs and Algorithms of Numerical Mathematics
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.
J.W. Schmidt, W. Hess (1984)
Elemente der Mathematik
Werner Sautter (1973)
Numerische Mathematik
Jean-Michel Morel, Sergio Solimini (1988)
Revista Matemática de la Universidad Complutense de Madrid
R. Tichatschke (1985)
Banach Center Publications
Kazufumi Ito, Karl Kunisch (2003)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
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...
Kazufumi Ito, Karl Kunisch (2010)
ESAIM: Mathematical Modelling and Numerical Analysis
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...
Pilipchuk, L. A., Vishnevetskaya, T. S., Pesheva, Y. H. (2013)
Mathematica Balkanica New Series
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...
Osborne, M.R. (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Ivan Hlaváček (1994)
Applications of Mathematics
A model shape optimal design in is solved by means of the penalty method with extrapolation, which enables to obtain high order approximations of both the state function and the boundary flux, thus offering a reliable gradient for the sensitivity analysis. Convergence of the proposed method is proved for certain subsequences of approximate solutions.