A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming

Xun Qian, Lizhi Liao*, Jie Sun

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

1 Citation (Scopus)
29 Downloads (Pure)


The affine scaling algorithm is one of the earliest interior point methods developed for linear programming. This algorithm is simple and elegant in terms of its geometric interpretation, but it is notoriously difficult to prove its convergence. It often requires additional restrictive conditions such as nondegeneracy, specific initial solutions, and/or small step length to guarantee its global convergence. This situation is made worse when it comes to applying the affine scaling idea to the solution of semidefinite optimization problems or more general convex optimization problems. In (Math Program 83(1–3):393–406, 1998), Muramatsu presented an example of linear semidefinite programming, for which the affine scaling algorithm with either short or long step converges to a non-optimal point. This paper aims at developing a strategy that guarantees the global convergence for the affine scaling algorithm in the context of linearly constrained convex semidefinite optimization in a least restrictive manner. We propose a new rule of step size, which is similar to the Armijo rule, and prove that such an affine scaling algorithm is globally convergent in the sense that each accumulation point of the sequence generated by the algorithm is an optimal solution as long as the optimal solution set is nonempty and bounded. The algorithm is least restrictive in the sense that it allows the problem to be degenerate and it may start from any interior feasible point.

Original languageEnglish
Pages (from-to)1-19
Number of pages19
JournalMathematical Programming
Issue number1-2
Early online date28 Jul 2018
Publication statusPublished - Jan 2020

Scopus Subject Areas

  • Software
  • Mathematics(all)

User-Defined Keywords

  • Affine scaling
  • Convex semidefinite programming
  • Interior point method


Dive into the research topics of 'A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming'. Together they form a unique fingerprint.

Cite this