Results 251 to 260 of about 110,736 (292)

Numerical Methods and the Bending of Ellipsoidal Shells

Journal of the Society for Industrial and Applied Mathematics, 1961
Introduction. Ellipsoidal shells of revolution are used in many industries, e.g., missile, nuclear, chemical; and it might be thought that their stress analysis was relatively routine. This is not the case, however, if they are subjected to edge bending loads, a condition occurring frequently in practice, especially in conjunction with uniform internal
Galletly, G. D., Kyner, W. T., Moller, C. E.   +2 more
openaire   +2 more sources

Lagrangian Transformation and Interior Ellipsoid Methods

2021
The NR approach produced a number of multipliers methods, which are primal exterior and dual interior.
openaire   +1 more source

Two-Ellipsoidal Inhomogeneities by the Equivalent Inclusion Method

Journal of Applied Mechanics, 1975
The problem of two ellipsoidal inhomogeneities in an infinitely extended isotropic matrix is treated by the equivalent inclusion method. The matrix is subjected to an applied strain field in the form of a polynomial of degree M in the position coordinates xi.
Moschovidis, Z. A., Mura, T.
openaire   +1 more source

Karmarkar's algorithm and the ellipsoid method

Operations Research Letters, 1987
We show that Karmarkar's algorithm and the ellipsoid method are closely related. At each iteration, the potential function used to measure convergence of the primal solutions in Karmarkar's algorithm correctly characterizes the logarithmic volume of an ellipsoid that contains all of the optimal dual solutions.
openaire   +2 more sources

On equivalence of major relaxation methods for minimum ellipsoid covering intersection of ellipsoids

Automatica, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Zhiguo, Shen, Xiaojing, Zhu, Yunmin   +2 more
openaire   +2 more sources

On the ellipsoid method

1988
The authors give a simple, elementary and self-contained description of the ellipsoid method for solving linear programming problems.
Klafszky, Emil, Terlaky, Tamás
openaire   +2 more sources

The Method of Contracting Ellipsoids,

1980
Abstract : The details of 'Khachian's Algorithm,' or the 'Russian Algorithm, are derived. Previously reported results based on 'deep cuts' are verified, and a proof of the polynomial convergence properties is sketched. (Author)
openaire   +1 more source

Method of ellipsoids, its generalizations and applications

Cybernetics, 1983
The method of ellipsoids for solving systems of linear inequalities [\textit{L. G. Khachiyan}, Sov. Math., Dokl. 20, 191-194 (1979; Zbl 0414.90086)] is closely related to the ''modified center of gravity method (MCGM) for convex programming proposed by \textit{D. B. Yudin} and \textit{A. S. Nemirovskij} [Ehkon. Mat.
Gershovich, V. I., Shor, N. Z.
openaire   +1 more source

Can the Ellipsoid Method be Efficient?

1984
We present a volume independent proof of convergence for the ellipsoid method. This proof serves as an explanation for the instability of the algorithm. We give an example where the method generates a sequence of increasingly ill-conditioned matrices. A rank-two update formula is derived to improve stability.
Bernhard Korte, Rainer Schrader
openaire   +1 more source

The Generalized Ellipsoid Method and Its Implementation

2020
We consider an algorithm with space dilation. For a certain choice of the dilation coefficient, this is a method of outer approximation of semi-ellipsoids by ellipsoids with monotonous decrease in their volume. It is shown that the Yudin-Nemirovski-Shor ellipsoid method is a specific case.
Petro Stetsyuk, Andreas Fischer, Olga Khomyak   +2 more
openaire   +1 more source