Results 291 to 300 of about 4,586,223 (354)

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   +3 more sources

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   +3 more sources

Linear Equations and Linear Inequalities

2002
While Chapter 1 reviews general structural aspects of real vector spaces, we now discuss fundamental computational techniques for linear systems in this chapter. For convenience of the discussion, we generally assume that the coefficients of the linear systems are real numbers.
Walter Kern, Ulrich Faigle, Georg Still
openaire   +2 more sources

Bayesian Analysis of the Linear Model Subject to Linear Inequality Constraints

, 1978
This article considers the general linear model when the parameter space is subject to linear inequality constraints. A Bayesian analysis of this model is presented using a natural conjugate prior of the mixed type.
W. Davis
semanticscholar   +1 more source

Stability Theory for Linear Inequality Systems

SIAM Journal on Matrix Analysis and Applications, 1996
This paper develops a stability theory for (possibly infinite) linear inequality systems defined on a finite-dimensional space, analyzing certain continuity properties of the solution set mapping.
M. Goberna, M. López, M. Todorov
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

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 matrix inequalities

IEE Proceedings - Control Theory and Applications, 2003
Linear matrix inequalities (LMIs) have emerged as a powerful tool for numerically solving control problems that are difficult or impossible to solve analytically. The idea is to express a given problem as an optimisation problem with linear objective and semidefinite constraints, where the constraints involve symmetric matrices that are affine in the ...
openaire   +2 more sources

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

An Algorithm for the Solution of Linear Inequalities

IEEE Transactions on Computers, 1974
The problem of solving a system of linear inequalities is central to pattern classification where a solution to the system, consistent or not, is required. In this paper, an algorithm is developed using the method of conjugate gradients for function minimization.
G. Nagaraja, G. Krishna
openaire   +2 more sources