The paper presents an algorithm for solving nonlinear programming problems. The algorithm is based on the combination of interior and exterior point methods. The latter is also known as the primaldual nonlinear rescaling method. The paper shows that in certain cases when the interior point method (ipm) fails to achieve the solution with the high level of accuracy, the use of the exterior point ...

An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, four algorithms are compared on uniformly randomly generated test problems. The results are very encouraging for one of the competitive algorithms. In particular, a dual forest exterior point algorithm is on average up...

The paper is an attempt to represent a study of limit points, boundary points, exterior points, border, interior points and closure points in the common generalized topological space. This paper takes a look at the possibilities of an extended topological space and it also considers the new characterizations of dense set.

An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos [K. Paparrizos, An infeasible (exterior point) simplex algorithm for assignment problems, Math. Program. 51 (1991) 45–54]. This algorithm belongs to the category of forest algorithms and solves an n × n assignment problem in at most n(n−1) 2 iterations and in at most O(n3) time. In thi...

An automatic approach to the exterior orientation by using linear primitives such as rivers and roads, which are extracted from the image and match to the existing vector data, is presented in this paper. Because the automatic identifying line features is much easier than point features, so that the observations are increased significantly and the exterior orientation can be improved. Proposed ...

We introduce and study the primal-dual exterior point (PDEP) method for convex optimization problems. The PDEP is based on the Nonlinear Rescaling (NR) multipliers method with dynamic scaling parameters update. The NR method at each step alternates finding the unconstrained minimizer of the Lagrangian for the equivalent problem with both Lagrange multipliers and scaling parameters vectors updat...

We consider the problem of finding the nearest point (by Euclidean distance) in a simplicial cone to a given point, and develop an exterior penalty algorithm for it. Each iteration in the algorithm consists of a single Newton step following a reduction in the value of the penalty parameter. Proofs of convergence of the algorithm are given. Various other versions of exterior penalty algorithms f...

The Bruce Boyd site is an Early Woodland burial area on a sand knoll near Long Point, Lake Erie. Excavation uncovered several burials and offerings with cache blades, Meadowood points, trapezoidal gorgets, galena, copper beads, copper bracelets, iron pyrites and red ochre. The ceramics were cordmarked on both interior and exterior, some of them also showing punctates on the lip and exterior rim.

The requirements for interpolation of scattered data are high accuracy and high efficiency. In this paper, a piecewise bivariate Hermite interpolant satisfying these requirements is proposed. We firstly construct a triangulation mesh using the given scattered point set. Based on this mesh, the computational point (x, y) is divided into two types: interior point and exterior point. The value of ...