Affine scaling

Short description: Algorithm for solving linear programming problems

The affine scaling method is an interior point method, meaning that it forms a trajectory of points strictly inside the feasible region of a linear program (as opposed to the simplex algorithm, which walks the corners of the feasible region).

In mathematical optimization, affine scaling is an algorithm for solving linear programming problems. Specifically, it is an interior point method, discovered by Soviet mathematician I. I. Dikin in 1967 and reinvented in the United States in the mid-1980s.

History

Affine scaling has a history of multiple discovery. It was first published by I. I. Dikin at Energy Systems Institute of Russian Academy of Sciences (Siberian Energy Institute, USSR Academy of Sc. at that time) in the 1967 Doklady Akademii Nauk SSSR, followed by a proof of its convergence in 1974. Dikin's work went largely unnoticed until the 1984 discovery of Karmarkar's algorithm, the first practical polynomial time algorithm for linear programming. The importance and complexity of Karmarkar's method prompted mathematicians to search for a simpler version.

Several groups then independently came up with a variant of Karmarkar's algorithm. E. R. Barnes at IBM, a team led by R. J. Vanderbei at AT&T, and several others replaced the projective transformations that Karmarkar used by affine ones. After a few years, it was realized that the "new" affine scaling algorithms were in fact reinventions of the decades-old results of Dikin. Of the re-discoverers, only Barnes and Vanderbei et al. managed to produce an analysis of affine scaling's convergence properties. Karmarkar, who had also came with affine scaling in this timeframe, mistakenly believed that it converged as quickly as his own algorithm.

Algorithm

Affine scaling works in two phases, the first of which finds a feasible point from which to start optimizing, while the second does the actual optimization while staying strictly inside the feasible region.

Both phases solve linear programs in equality form, viz.

minimize c ⋅ x

subject to Ax = b, x ≥ 0.

These problems are solved using an iterative method, which conceptually proceeds by plotting a trajectory of points strictly inside the feasible region of a problem, computing projected gradient descent steps in a re-scaled version of the problem, then scaling the step back to the original problem. The scaling ensures that the algorithm can continue to do large steps even when the point under consideration is close to the feasible region's boundary.

Formally, the iterative method at the heart of affine scaling takes as inputs A, b, c, an initial guess x⁰ > 0 that is strictly feasible (i.e., Ax⁰ = b), a tolerance ε and a stepsize β. It then proceeds by iterating

• Let D_k be the diagonal matrix with x^k on its diagonal.
• Compute a vector of dual variables:

  [math]\displaystyle{ w^k = (A D_k^2 A^\operatorname{T})^{-1} A D_k^2 c. }[/math]

• Compute a vector of reduced costs, which measure the slackness of inequality constraints in the dual:

  [math]\displaystyle{ r^k = c - A^\operatorname{T} w^k. }[/math]

• If [math]\displaystyle{ r^k \gt 0 }[/math] and [math]\displaystyle{ \mathbf{1}^\operatorname{T} D_k r^k \lt \varepsilon }[/math], the current solution x^k is ε-optimal.
• If [math]\displaystyle{ -D_k r^k \ge 0 }[/math], the problem is unbounded.
• Update [math]\displaystyle{ x^{k+1} = x^k - \beta \frac{D_k^2 r^k}{\|D_k r^k\|} }[/math]

Initialization

Phase I, the initialization, solves an auxiliary problem with an additional variable u and uses the result to derive an initial point for the original problem. Let x⁰ be an arbitrary, strictly positive point; it need not be feasible for the original problem. The infeasibility of x⁰ is measured by the vector

[math]\displaystyle{ v = b - Ax^0 }[/math].

If v = 0, x⁰ is feasible. If it is not, phase I solves the auxiliary problem

minimize u

subject to Ax + uv = b, x ≥ 0, u ≥ 0.

This problem has the right form for solution by the above iterative algorithm, and

[math]\displaystyle{ \begin{pmatrix} x^0 \\ 1 \end{pmatrix} }[/math]

is a feasible initial point for it. Solving the auxiliary problem gives

[math]\displaystyle{ \begin{pmatrix} x^* \\ u^* \end{pmatrix} }[/math].

If u^* = 0, then x^* ≥0 is feasible in the original problem (though not necessarily strictly interior), while if u^* > 0, the original problem is infeasible.

Analysis

While easy to state, affine scaling was found hard to analyze. Its convergence depends on the step size, β. For step sizes β ≤ 2/3, Vanderbei's variant of affine scaling has been proven to converge, while for β > 0.995, an example problem is known that converges to a suboptimal value. Other variants of the algorithm have been shown to exhibit chaotic behavior even on small problems when β > 2/3.

Further reading

• Adler, Ilan; Monteiro, Renato D. C. (1991). "Limiting behavior of the affine scaling continuous trajectories for linear programming problems". Mathematical Programming 50 (1–3): 29–51. doi:10.1007/bf01594923. http://www2.isye.gatech.edu/~monteiro/publications/tech_reports/waffine.pdf. 
• Saigal, Romesh (1996). "A simple proof of a primal affine scaling method". Annals of Operations Research 62: 303–324. doi:10.1007/bf02206821. http://deepblue.lib.umich.edu/bitstream/handle/2027.42/44263/10479_2005_Article_BF02206821.pdf. 
• Tseng, Paul; Luo, Zhi-Quan (1992). "On the convergence of the affine-scaling algorithm". Mathematical Programming 56 (1–3): 301–319. doi:10.1007/bf01580904. http://dspace.mit.edu/bitstream/handle/1721.1/3161/P-1920-20783110.pdf. 

External links

• "15.093 Optimization Methods, Lecture 21: The Affine Scaling Algorithm". 2009. http://ocw.mit.edu/courses/sloan-school-of-management/15-093j-optimization-methods-fall-2009/lecture-notes/MIT15_093J_F09_lec21.pdf. 
• Mitchell, John (November 2010). "Interior Point Methods". Rensselaer Polytechnic Institute. http://homepages.rpi.edu/~mitchj/handouts/interior_html/interior.html. 
• "Lecture 6: Interior point method". http://ocw.nctu.edu.tw/course/lp992/Lecture6.pdf.