The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Uniformly accurate quantile bounds via the truncated moment generating function: the symmetric case.”

On the number of abelian groups of a given order (supplement)

Hong-Quan Liu (1993)

Acta Arithmetica

Similarity:

1. Introduction. The aim of this paper is to supply a still better result for the problem considered in [2]. Let A(x) denote the number of distinct abelian groups (up to isomorphism) of orders not exceeding x. We shall prove Theorem 1. For any ε > 0, A ( x ) = C ₁ x + C ₂ x 1 / 2 + C ₃ x 1 / 3 + O ( x 50 / 199 + ε ) , where C₁, C₂ and C₃ are constants given on page 261 of [2]. Note that 50/199=0.25125..., thus improving our previous exponent 40/159=0.25157... obtained in [2]. To prove Theorem 1, we shall proceed along the line of approach presented...

The existence of limit cycle for perturbed bilinear systems

Hanen Damak, Mohamed Ali Hammami, Yeong-Jeu Sun (2012)

Kybernetika

Similarity:

In this paper, the feedback control for a class of bilinear control systems with a small parameter is proposed to guarantee the existence of limit cycle. We use the perturbation method of seeking in approximate solution as a finite Taylor expansion of the exact solution. This perturbation method is to exploit the “smallness” of the perturbation parameter ε to construct an approximate periodic solution. Furthermore, some simulation results are given to illustrate the existence of a limit...

Full-Newton step infeasible interior-point algorithm for SDO problems

Hossein Mansouri (2012)

Kybernetika

Similarity:

In this paper we propose a primal-dual path-following interior-point algorithm for semidefinite optimization. The algorithm constructs strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Each main step of the algorithm consists of a feasibility step and several centering steps. At each iteration, we use only full-Newton step. Moreover, we use a more natural feasibility step, which targets at the μ + -center. The iteration bound of the algorithm...

Goffin's algorithm for zonotopes

Michal Černý (2012)

Kybernetika

Similarity:

The Löwner-John ellipse of a full-dimensional bounded convex set is a circumscribed ellipse with the property that if we shrink it by the factor n (where n is dimension), we obtain an inscribed ellipse. Goffin’s algorithm constructs, in polynomial time, a tight approximation of the Löwner-John ellipse of a polyhedron given by facet description. In this text we adapt the algorithm for zonotopes given by generator descriptions. We show that the adapted version works in time polynomial...

Two-player knock 'em down.

Fill, James Allen, Wilson, David B. (2008)

Electronic Journal of Probability [electronic only]

Similarity: