Advertisement

Optimality conditions in nonlinear programming

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 268)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AKGU84]
    Akgul, M. Topics in relaxation and ellipsoidal methods. Lecture Notes in Math., 97 (1984), Pitman Publ. Co.Google Scholar
  2. [AVRI76]
    Avriel, M. Nonlinear Programming: Analysis and Methods. Prentice Hall Inc. Englewood Cliffs, N.J. (1976).Google Scholar
  3. [BARA86]
    Barahona, F. A solvable case for quadratic 0–1 programming. Discrete Appl. Math. 13 (1986), 23–26.CrossRefGoogle Scholar
  4. [BURD77]
    Burdet, C.A. Elements of a theory in non-convex programming. Naval Res. Log. Quarterly Vol. 24, No. 1 (1977), 47–66.Google Scholar
  5. [CHUN81]
    Chung, S.J. and Murty, K.G. A polynomially bounded ellipsoid algorithm for convex quadratic programming. Nonlinear Programming 4 (ed. O.L. Mangasarian, R.R. Meyer and S.M. Robinson), Acad. Press, (1981), 439–485.Google Scholar
  6. [ECKE85]
    Ecker, J.G. and Kupferschmid, M. A computational comparison of the ellipsoid algorithm with several nonlinear programming algorithms. SIAM J. Control and Optimization, Vol. 23, No. 5 (1985), 657–674.CrossRefGoogle Scholar
  7. [FALK67]
    Falk, J. Lagrange multipliers and nonlinear programming. Journ. of Math. Anal. and Applic. 19 (1967), 141–159.CrossRefGoogle Scholar
  8. [FALK69]
    Falk, J. Lagrange multipliers and nonconvex programs. SIAM J. on Control and Optimization 7 (1969), 534–545.CrossRefGoogle Scholar
  9. [GASA84]
    Gasanov, I.I. and Rikun, A.D. On necessary and sufficient conditions for uniextremality in nonconvex mathematical programming problems. Soviet Math. Dokl. Vol 30, No. 2 (1984), 457–559.Google Scholar
  10. [GASA85]
    Gasanov, I.I. and Rikun, A.D. The necessary and sufficient conditions for single extremality in nonconvex problems of mathematical programming. USSR Comput. Maths. Math. Phys., Vol. 25, No. 3 (1985), 105–113.CrossRefGoogle Scholar
  11. [HELG80]
    Helgason, R., Kennington, J., and Lall, H. A polynomially bounded algorithm for a singly constrained quadratic program. Math. Progr. 18 (1980), 338–343.CrossRefGoogle Scholar
  12. [HORS82]
    Horst, R. A note on functions whose local minima are global. JOTA 36 (1982), 457–463.CrossRefGoogle Scholar
  13. [KAPO86]
    Kapoor, S. and Vaidya, P.M. Fast algorithms for convex quadratic programming and multicommodity flows. Working paper, Comp. Sc. Dept. (1986), University of Illinois at Urbana-Champaign.Google Scholar
  14. [KARM84]
    Karmarkar, N. A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984), 373–395.Google Scholar
  15. [KHAC79]
    Khachian, L.G. A polynomial algorithm for linear programming. Soviet Math. Dokl. Vol. 20 (1979), 191–194.Google Scholar
  16. [KOZL79]
    Kozlov, M.K., Tarasov, S.P., and Khachian, L.G. Polynomial solvability of convex quadratic programming. Soviet Math. Dokl. Vol. 20 (1979), 1108–1111.Google Scholar
  17. [LUEN84]
    Luenberger, D.G. Linear and Nonlinear Programming. Addison Wesley (1984).Google Scholar
  18. [MANG69]
    Mangasarian, O.L. Nonlinear Programming. McGraw-Hill, N.Y. (1969).Google Scholar
  19. [MURT85]
    Murty, K.G. and Kabadi, S.N. Some NP-complete problems in quadratic and nonlinear programming. Technical report 85-23 (1985), Dept. of Industr. and Oper. Eng., Univ. of Michigan.Google Scholar
  20. [PARD87A]
    Pardalos, P.M. and Kovoor, N. An algorithm for singly constrained quadratic programs. Technical Report CS-87-06 (1987), Computer Sci. Dept., The Penn. State Univ.Google Scholar
  21. [PARD87B]
    Pardalos, P.M. and Schnitger, G. Checking local optimality in constrained quadratic programming is NP-hard. Technical Report (1987), Computer Sci. Dept., The Penn. State Univ.Google Scholar
  22. [PICA82]
    Picard, J.C. and Queyranne, M. Selected applications of min cut in networks. INFOR Vol. 20, No. 4 (1982), 395–422.Google Scholar
  23. [SHOR70]
    Shor, N.Z. Convergence rate of the gradient descent method with dilatation of the space. Cybernetics 6 (1970), 102–108.CrossRefGoogle Scholar
  24. [VERG86]
    Vergis, A., Steiglitz, K., and Dickinson, B. The complexity of analog computation. Math. and Computers in Simulation 28 (1986), 91–113.CrossRefGoogle Scholar
  25. [YE86]
    Ye, Y. and Edison, T. A polynomial time algorithm for convex quadratic prgramming. Working paper (1986), Depart. of Engin.-Econom. Systems, Stanford Univ.Google Scholar
  26. [ZANG75]
    Zang, I. and Avriel M. On functions whose local minima are global. JOTA 16 (1975), 183–190.CrossRefGoogle Scholar
  27. [ZANG76]
    Zang, I. A note on functions whose local minima are global. JOTA 18 (1976), 556–559.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1987

Personalised recommendations