# A quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems

@article{Galabova2018AQP, title={A quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems}, author={I. L. Galabova and J. A. Julian Hall}, journal={arXiv: Optimization and Control}, year={2018} }

This paper provides the first meaningful documentation and analysis of an established technique which aims to obtain an approximate solution to linear programming problems prior to applying the primal simplex method. The underlying algorithm is a penalty method with naive approximate minimization in each iteration. During initial iterations an approach similar to augmented Lagrangian is used. Later the technique corresponds closely to a classical quadratic penalty method. There is also a… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 15 REFERENCES

Augmented Lagrangian method for large-scale linear programming problems

- Computer Science, Mathematics
- 2005

18

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming

- Mathematics, Computer Science
- 1995

90

An Experimental Comparison of Techniques for the Assignment of Facilities to Locations

- Computer Science, Mathematics
- 1968

361