Our algorithms have the property that all the iterates can be kept in a neighborhood of the central path without using any centering in the search directions.

Using an idea of Mizuno and Nagasawa and new potential functions we establish a framework for primal-dual algorithms that keep a potential function fixed. We ...

Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices · A new warmstarting strategy for the primal-dual column ...

Our algorithms have the property that all the iterates can be kept in a neighborhood of the central path without using any centering in the search directions.

eCommons · Home · College of Engineering · Operations Research and Information Engineering · ORIE Technical Reports · Constant Potential Primal-Dual Algorithms: ...

primal–dual potential reduction algorithm that use the primal–dual affine ... Tunçel, “Constant potential primal–dual algorithms: a framework,”. Math. Prog ...

Missing: Constant potential

We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. The algorithms are of the primal-dual type.

This work is first motivated by the fact that a primal- dual formulation of the quadratic penalty provides a better framework than the standard primal form.

Jan 23, 2024 · In the paper, we have presented and systematically used a primal-dual framework to design competitive algorithms for problems with non-convex ...