Results 191 to 200 of about 5,434,968 (247)

Zhang Neural Network for Online Solution of Time-Varying Linear Matrix Inequality Aided With an Equality Conversion

IEEE Transactions on Neural Networks and Learning Systems, 2014
In this paper, for online solution of time-varying linear matrix inequality (LMI), such an LMI is first converted to a time-varying matrix equation by introducing a time-varying matrix, of which each element is greater than or equal to zero.
Dongsheng Guo, Yunong Zhang
semanticscholar   +1 more source

Algorithms for Nonlinear Least Squares with Linear Inequality Constraints

, 1985
Two algorithms for solving nonlinear least squares problems with general linear inequality constraints are described. At each step, the problem is reduced to an unconstrained linear least squares problem in the subspace defined by the active constraints,
Stephen J. Wright, J. Holt
semanticscholar   +1 more source

On stochastic linear inequalities

Trabajos de Estadistica, 1959
The author, in this unorthodox paper, discusses come actual problems of theory and methods of linear programming. He defines a compound matrix as a common property to all cases ofmatrix games: games theory. input-output analysis, theory of statistical decision and others; namely, mathematical programming.
openaire   +2 more sources

Error Bounds for Abstract Linear Inequality Systems

SIAM Journal on Optimization, 2002
In this paper we study error bounds of the abstract linear inequality system (A,C,b): $Ax \leqslant b$, where A is a bounded linear operator from a Banach space X to a Banach space Y partially ordered by a closed convex cone C.
K. Ng, W. Yang
semanticscholar   +1 more source

LINEAR EQUATIONS AND INEQUALITIES

2017
As we have observed, the constraints of a meaningful linear program must include at least one linear inequality, but otherwise they may be composed of linear equations, linear inequalities, or some of each.
Richard W. Cottle, Mukund N. Thapa
openaire   +2 more sources

Linear Differential Inequalities

SIAM Journal on Mathematical Analysis, 1978
A notion of generalized zero with respect to a linear differential operator $L_n $ for a function f at a singular point of the operator was introduced by Levin and further considered by Willett. This involved a comparison of f with certain solutions of $L_n y = 0$ near the singular point. It is shown that the role of these solutions may be fulfilled by
openaire   +2 more sources

Linear Equations and Inequalities

1993
Equations and inequalities in integer variables arise naturally in the dependence analysis of a program, when we try to analyze the mem- ory reference pattern. The equations are created by matching the corresponding subscripts of instances of two subscripted variables that are elements of the same array.
openaire   +2 more sources

The Relaxation Method for Linear Inequalities

Canadian Journal of Mathematics, 1954
Let A be a closed set of points in the n-dimensional euclidean space En. If p and p1 are points of En such that1.1then p1 is said to be point-wise closer than p to the set A. If p is such that there is no point p1 which is point-wise closer than p to A, then p is called a closest point to the set A.
I. J. Schoenberg, T. S. Motzkin
openaire   +2 more sources

Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping

SIAM Journal on Optimization, 1997
This paper deals with the upper semicontinuity of the solution set mapping for linear inequality systems, complementing a previous work on lower semicontinuity and related stability concepts.
M. Goberna, M. López, M. Todorov
semanticscholar   +1 more source

Testing for and against a set of linear inequality constraints in a multinomial setting

, 1995
There are numerous situations in categorical data analysis where one wishes to test hypotheses involving a set of linear inequality constraints placed upon the cell probabilities.
H. Barmi, R. Dykstra
semanticscholar   +1 more source