We consider algorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate the relative positions of the points. Problems of this flavor arise in a variety of contexts. The particular motivating example that inspired this work comes from molecular biology; the points are markers on a chromoso...

A large number of problems in transportation, communications and manufacturing can be modelled as network ow problems. In these problems one seeks to nd the most e cient, or optimal, way to move ow (e.g. materials, information, buses, electrical currents) on a network (e.g. postal network, computer network, transportation grid, power grid). Many of these optimization problems are special classe...

An algorithm for solving linear programming problems can be used as a subroutine in methods for more complicated problems. Such methods usually involve solving a sequence of related linear programming problems, where the solution to one linear program is close to the solution to the next, that is, it provides a warm start for the next linear program. The branch and cut method for solving intege...

We present inexact accelerated proximal point algorithms for minimizing a proper lower semicontinuous and convex function. We carry on a convergence analysis under different types of errors in the evaluation of the proximity operator, and we provide corresponding convergence rates for the objective function values. The proof relies on a generalization of the strategy proposed in [14] for genera...

fehlt noch

Spend your few moment to read a book even only few pages. Reading book is not obligation and force for everybody. When you don't want to read, you can get punishment from the publisher. Read a book becomes a choice of your different characteristics. Many people with reading habit will always be enjoyable to read, or on the contrary. For some reasons, this interior point algorithms theory and an...

In this paper the abstract of the thesis ”New Interior Point Algorithms in Linear Programming” is presented. The purpose of the thesis is to elaborate new interior point algorithms for solving linear optimization problems. The theoretical complexity of the new algorithms are calculated. We also prove that these algorithms are polynomial. The thesis is composed of seven chapters. In the first ch...

Given a label shape L and a set of n points in the plane, the 2-label point-labeling problem consists of placing 2n non-intersecting translated copies of L of maximum size such that each point touches two unique copies—its labels. In this paper we give new and simple approximation algorithms for L an axis-parallel square or a circle. For squares we improve the best previously known approximatio...