Displaying similar documents to “Verification of functional a posteriori error estimates for obstacle problem in 1D”

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...

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...

Reference points based recursive approximation

Martina Révayová, Csaba Török (2013)

Kybernetika

Similarity:

The paper studies polynomial approximation models with a new type of constraints that enable to get estimates with significant properties. Recently we enhanced a representation of polynomials based on three reference points. Here we propose a two-part cubic smoothing scheme that leverages this representation. The presence of these points in the model has several consequences. The most important one is the fact that by appropriate location of the reference points the resulting approximant...