Results 241 to 250 of about 110,756 (290)

Online learning by ellipsoid method

Proceedings of the 26th Annual International Conference on Machine Learning, 2009
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classification hypotheses that are consistent with all the training examples received so far.
Liu Yang, Rong Jin, Jieping Ye
openaire   +1 more source

The Ellipsoid Method

2013
In this chapter we describe an algorithm, known as the ellipsoid method, that finds a solution to a given system of linear inequalities. Its complexity analysis can also be done in terms of Open image in new window , but in exchange for a loss of simplicity, we obtain bounds linear in Open image in new window (instead of the quadratic dependence in ...
Peter Bürgisser, Felipe Cucker
openaire   +1 more source

The Ellipsoid Method

1988
In 1979 a note of L. G. Khachiyan indicated how an algorithm, the so-called ellipsoid method, originally devised for nonlinear nondifferentiable optimization, can be modified in order to check the feasibility of a system of linear inequalities in polynomial time.
Martin Grötschel, László Lovász, Alexander Schrijver   +2 more
openaire   +1 more source

An Approximate Method of Ellipsoids

Cybernetics and Systems Analysis, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Ellipsoidal methods for dynamics and control. Part I

Journal of Mathematical Sciences, 2006
The system that operates in the absence of uncertainty is considered. Methods that allow one to represent trajectory tubes for control systems by parametrized varieties of ellipsoid-valued tubes are proposed. They allow one to obtain external and internal approximation of the multivalued solution functions with any desired accuracy.
P. Varaiya, A. B. Kurzhanski, A. B. Kurzhanski   +2 more
openaire   +1 more source

Variable metric relaxation methods, part II: The ellipsoid method

Mathematical Programming, 1984
[For part I see Tech. Rep. SOL 81-16, Systems Optimization Laboratory, Oper. Res. Dept., Stanford Univ. (1981).] The deepest, or least shallow, cut ellipsoid method is a polynomial (time and space) method which finds an ellipsoid, representable by polynomial space integers, such that the maximal ellipsoidal distance relaxation method using this fixed ...
openaire   +2 more sources

Die Ellipsoid-Methode von Chatschijan

1987
Das Verfahren von Chatschijan arbeitet mit einer Folge von Ellipsoiden fallenden Volumens, die die moglichen Optimalpunkte einer linearen Optimierungsaufgabe sukzessive einschliesen. Die Grundidee des Verfahrens wird erlautert an einem Verfahren zur Ermittlung zulassiger Punkte.
Ernst-Peter Beisel, Manfred Mendel
openaire   +1 more source

Minimax estimation methods under ellipsoidal constraints

Automation and Remote Control, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mamaev, A. A., Semenikhin, K. V.
openaire   +1 more source

Attractive Ellipsoid Method with Adaptation

2014
This chapter deals with the development of a state estimator and adaptive controller based on the attractive ellipsoid method (AEM) for a class of uncertain nonlinear systems having “quasi-Lipschitz” nonlinearities as well as external perturbations.
Alexander Poznyak, Andrey Polyakov, Vadim Azhmyakov   +2 more
openaire   +1 more source

On a Variant of the Ellipsoid Method: Using Simplices instead of Ellipsoids

1996
The ellipsoid method finds an optimal solution (if one exists) of a linear programming problem. Khachiyan showed that the running time of the algorithm is bounded from above by a fixed polynomial in the size of the data. From a theoretical point of view this result was very important.
Faigle, U., Hunting, Marcel Martinus Gerardus, Kern, Walter   +2 more
openaire   +3 more sources