Skip to main content

ABS Algorithms for Optimization

  • Reference work entry
  • 1123 Accesses

Article Outline

Keywords

A Class of ABS Projection Methods for Unconstrained Optimization

Applications to Quasi-Newton Methods

ABS Methods for Kuhn–Tucker Equations

Reformulation of the Simplex Method via the Implicit LX Algorithm

ABS Unification of Feasible Direction Methods for Minimization with Linear Constraints

See also

References

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Abaffy J, Spedicato E (1989) ABS projection algorithms: Mathematical techniques for linear and nonlinear equations. Horwood, Westergate

    MATH  Google Scholar 

  2. Adachi N (1971) On variable metric algorithms. JOTA 7:391–409

    MathSciNet  MATH  Google Scholar 

  3. Evtushenko Y (1974) Two numerical methods of solving nonlinear programming problems. Soviet Dokl Akad Nauk 251:420–423

    Google Scholar 

  4. Feng E, Wang XM, Wang XL (1997) On the application of the ABS algorithm to linear programming and linear complementarity. Optim Methods Softw 8:133–142

    MathSciNet  MATH  Google Scholar 

  5. Fletcher R (1997) Dense factors of sparse matrices. In: Buhmann MD, Iserles A (eds) Approximation Theory and Optimization. Cambridge Univ. Press, Cambridge, pp 145–166

    Google Scholar 

  6. Forrest JH, Goldfarb D (1992) Steepest edge simplex algorithms for linear programming. Math Program 57:341–374

    MathSciNet  MATH  Google Scholar 

  7. Psenichny BN, Danilin YM (1978) Numerical methods in extremal problems. MIR, Moscow

    Google Scholar 

  8. Spedicato E, Chen Z, Bodon E (1996) ABS methods for KT equations. In: Di Pillo G, Giannessi F (eds) Nonlinear Optimization and Applications. Plenum, New York, pp 345–359

    Google Scholar 

  9. Spedicato E, Xia Z (1992) Finding general solutions of the quasi-Newton equation in the ABS approach. Optim Methods Softw 1:273–281

    Google Scholar 

  10. Spedicato E, Xia Z, Zhang L (1995) Reformulation of the simplex algorithm via the ABS algorithm. Preprint Univ Bergamo

    Google Scholar 

  11. Spedicato E, Zhao J (1992) Explicit general solution of the quasi-Newton equation with sparsity and symmetry. Optim Methods Softw 2:311–319

    Google Scholar 

  12. Xia Z (1995) ABS generalization and formulation of the interior point method. Preprint Univ Bergamo

    Google Scholar 

  13. Xia Z (1995) ABS reformulation of some versions of the simplex method for linear programming. Report DMSIA Univ Bergamo 10/95

    Google Scholar 

  14. Xia Z, Liu Y, Zhang L (1992) Application of a representation of ABS updating matrices to linearly constrained optimization. Northeast Oper Res 7:1–9

    Google Scholar 

  15. Zhang L (1995) Updating of Abaffian matrices under perturbation in W and A. Report DMSIA Univ Bergamo 95/16

    Google Scholar 

  16. Zhang L (1997) On the ABS algorithm with singular initial matrix and its application to linear programming. Optim Methods Softw 8:143–156

    MathSciNet  MATH  Google Scholar 

  17. Zhang L, Xia ZH (1995) Application of the implicit LX algorithm to the simplex method. Report DMSIA Univ Bergamo 9/95

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Spedicato, E., Xia, Z., Zhang, L. (2008). ABS Algorithms for Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_2

Download citation

Publish with us

Policies and ethics