Interior point method

Algorithm

Engineering

Biology

Proximal Gradient Methods

Linear programming

Applied mathematics

Literature

Convergence (economics)

Telecommunications

Economics

Computer science

Mathematical optimization

Bregman divergence

Computer network

Mechanical engineering

Genetics

Sequence (biology)

Mathematics

Rate of convergence

Path (computing)

Geometry

Point (geometry)

Programming language

Limiting

Economic growth

Channel (broadcasting)

Dual (grammatical number)

Convex optimization

Regular polygon

Optimization methods & software

In this article, we consider the proximal point method with Bregman distance applied to linear programming problems, and study the dual sequence obtained from the optimal multipliers of the linear constraints of each subproblem. We establish the convergence of this dual sequence, as well as convergence rate results for the primal sequence, for a suitable family of Bregman distances. These results are obtained by studying first the limiting behavior of a certain perturbed dual path and then the behavior of the dual and primal paths.

Dual convergence of the proximal point method with Bregman distances for linear programming