Corpus ID: 53400483

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}
}
  • I. L. Galabova, J. A. Julian Hall
  • Published 2018
  • Mathematics
  • arXiv: Optimization and Control
  • 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

    Figures and Tables from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES
    Augmented Lagrangian method for large-scale linear programming problems
    18
    Augmented Lagrangian algorithms for linear programming
    21
    Multiplier and gradient methods
    1460
    Parallelizing the dual revised simplex method
    15
    Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
    352
    A survey for the quadratic assignment problem
    403
    An Experimental Comparison of Techniques for the Assignment of Facilities to Locations
    361
    Benchmarks for optimization software
    97