Variable splitting

In applied mathematics and computer science, variable splitting is a decomposition method that relaxes a set of constraints.

Details

When the variable x appears in two sets of constraints, it is possible to substitute the new variables x1 in the first constraints and x2 in the second, and then join the two variables with a new "linking" constraint,[1] which requires that

x1=x2.

This new linking constraint can be relaxed with a Lagrange multiplier; in many applications, a Lagrange multiplier can be interpreted as the price of equality between x1 and x2 in the new constraint.

For many problems, when the equality of the split variables is relaxed, then the system is decomposed, and each subsystem can be solved independently, at substantial reduction of computing time and memory storage. A solution to the relaxed problem (with variable splitting) provides an approximate solution to the original problem: further, the approximate solution to the relaxed problem provides a "warm start", a good initialization of an iterative method for solving the original problem (having only the x variable).

This was first introduced by Kurt O. Jörnsten, Mikael Näsberg, Per A. Smeds in 1985. At the same time, M. Guignard and S. Kim introduced the same idea under the name Lagrangean Decomposition (their papers appeared in 1987). The original references are (1) Variable Splitting: A New Lagrangean Relaxation Approach to Some Mathematical Programming Models Authors Kurt O. Jörnsten, Mikael Näsberg, Per A. Smeds Volumes 84-85 of LiTH MAT R.: Matematiska InstitutionenPublisher University of Linköping, Department of Mathematics, 1985 Length 52 pages and (2) Lagrangean Decomposition: A Model Yielding Stronger Bounds, Authors Monique Guignard and Siwhan Kim, Mathematical Programming, 39(2), 1987, pp. 215-228.


[1][2][3]

Notes

  1. 1 2 Vanderbei (1991)
  2. ↑ Alvarado (1990)
  3. ↑ Adlers & Björck (2000) Reprinted as Appendix A, in Mikael Adlers, 2000, Topics in Sparse Least Squares Problems, Linkoping Studies in Science and Technology", Linkoping University, Sweden.

Bibliography

  • Adlers, Mikael; Björck, Åke (2000). "Matrix stretching for sparse least squares problems". Numerical Linear Algebra with Applications. John Wiley & Sons, Ltd. 7 (2): 51–65. doi:10.1002/(SICI)1099-1506(200003)7:2. ISSN 1099-1506.
  • Alvarado, Fernando (1997). "Matrix enlarging methods and their application". BIT Numerical Mathematics. 37 (3): 473–505. doi:10.1007/BF02510237.
  • Grcar, Joseph (1990). Matrix stretching for linear equations (Technical report). Sandia National Laboratories. arXiv:1203.2377. Bibcode:2012arXiv1203.2377G. SAND90-8723.
  • Vanderbei, Robert J. (July 1991). "Splitting dense columns in sparse linear systems". Linear Algebra and its Applications. 152: 107–117. doi:10.1016/0024-3795(91)90269-3. ISSN 0024-3795.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.