We consider the infeasible primal-dual algorithm for smooth convex programming recently introduced by Vial [15]. We show, under mild assumptions, that a "SUMT" or "long-step path following" version of the algorithm is globally convergent. The stepiength on each iteration is based on a merit function which is a modification of the potential function proposed by Vial.
No takes yet. Share an insight, caveat, or question.
Anstreicher et al. (1994) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: