Skip to main content
SpringerLink
Log in

The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization

  • Conference paper
Book cover Principles and Practice of Constraint Programming – CP’99 (CP 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1713))

Abstract

In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient conditions for saddle points, and an efficient first-order search procedure that looks for saddle points in discrete space. Our new theory provides a strong mathematical foundation for solving general nonlinear discrete optimization problems. Specifically, we propose a new vector-based definition of descent directions in discrete space and show that the new definition does not obey the rules of calculus in continuous space. Starting from the concept of saddle points and using only vector calculus, we then prove the discrete-space first-order necessary and sufficient conditions for saddle points. Using well-defined transformations on the constraint functions, we further prove that the set of discrete-space saddle points is the same as the set of constrained local minima, leading to the first-order necessary and sufficient conditions for constrained local minima. Based on the first-order conditions, we propose a local-search method to look for saddle points that satisfy the first-order conditions.

Research supported by National Science Foundation Grant NSF MIP 96-32316.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arrow, K.J., Hurwicz, L.: Gradient method for concave programming, I: Local results. In: Arrow, K.J., Hurwica, L., Uzawa, H. (eds.) Studies in Linear and Nonlinear Programming. Stanford University Press, Stanford (1958)

    Google Scholar 

  2. Balas, E.: Minimax and Duality for Linear and Nonlinear Mixed-Integer Programming. North-Holland, Amsterdam (1970)

    Google Scholar 

  3. Bazaraa, M.S., Goode, J.J.: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality. European Journal of Operational Research 3, 322–338 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  4. Choi, K.F.M., Lee, J.H.M., Stuckey, P.J.: A Lagrangian reconstruction of a class of local search methods. In: Proc. 10th Int’l Conf. on Artificial Intelligence Tools. IEEE Computer Society, Los Alamitos (1998)

    Google Scholar 

  5. Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math. 16, 97–120 (1982)

    MATH  Google Scholar 

  6. Gavish, B.: On obtaining the ‘best’ multilpliers for a lagrangean relaxation for integer programming. Comput. & Ops. Res. 5, 55–71 (1978)

    Article  Google Scholar 

  7. Geoffrion, A.M.: Lagrangean relaxation for integer programming. Mathematical Programming Study 2, 82–114 (1974)

    MathSciNet  Google Scholar 

  8. Giles, F.R., Pulleyblank, W.R.: Total Dual Integrality and Integer Polyhedra, vol. 25. Elsevier North Holland, Inc., Amsterdam (1979)

    Google Scholar 

  9. Glover, F.: Tabu search — Part I. ORSA J. Computing 1(3), 190–206 (1989)

    MATH  Google Scholar 

  10. Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. Operations Research 22, 180–182 (1975)

    Article  Google Scholar 

  11. Granot, D., Granot, F., Vaessen, W.: An accelerated covering relaxation algorithm for solving positive 0-1 polynomial programs. Mathematical Programming 22, 350–357 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hansen, P., Jaumard, B., Mathon, V.: Constrained nonlinear 0-1 programming. ORSA Journal on Computing 5(2), 97–119 (1993)

    MATH  MathSciNet  Google Scholar 

  13. Holland, J.H.: Adaption in Natural and Adaptive Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  14. Hopfield, J.J., Tank, D.W.: Neural computation by concentrating information in time. Proc. National Academy of Sciences, 84, 1896–1900. (1987)

    Google Scholar 

  15. Hribar, M.E.: Large scale constrained optimization. Ph.D. Disertation, Northeasten University (1996)

    Google Scholar 

  16. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  17. Luenberger, D.G.: Linear and Nonlinear Programming. Addison-Wesley Publishing Company, Reading (1984)

    MATH  Google Scholar 

  18. Morris, P.: The breakout method for escaping from local minima. In: Proc. of the 11th National Conf. on Artificial Intelligence, Washington, DC, pp. 40–45 (1993)

    Google Scholar 

  19. Murota, K.: Discrete convex analysis. Mathematical Programming 83(3), 313–371 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  20. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  21. Rosenberg, I.: Minimization of pseudo-boolean functions by binary development. Discrete Mathematics 7, 151–165 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  22. Shang, Y., Wah, B.W.: Discrete Lagrangian-based search for solving MAXSAT problems. In: Proc. Int’l Joint Conf. on Artificial Intelligence, IJCAI, pp. 378–383 (August 1997)

    Google Scholar 

  23. Shang, Y., Wah, B.W.: A discrete Lagrangian based global search method for solving satisfiability problems. J. Global Optimization 12(1), 61–99 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  24. Shapiro, J.F.: Generalized Lagrange multipliers in integer programming. Operations Research 19, 68–76 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  25. Tind, J., Wolsey, L.A.: An elementary survey of general duality theory in mathematical programming. Mathematical Programming, 241–261 (1981)

    Google Scholar 

  26. Wah, B.W., Shang, Y., Wu, Z.: Discrete Lagrangian method for optimizing the design of multiplierless QMF filter banks. IEEE Transactions on Circuits and Systems, Part II (1999) (accepted to appear)

    Google Scholar 

  27. Wah, B.W., Wang, T.: Simulated annealing with asymptotic convergence for nonlinear constrained global optimization. Principles and Practice of Constraint Programming (October 1999) (accepted to appear)

    Google Scholar 

  28. Wah, B.W., Wu, Z.: Discrete Lagrangian method for designing multiplierless two-channel PR-LP filter banks. VLSI Signal Processing 21(2), 131–150 (1999)

    Article  Google Scholar 

  29. Wang, X.D.: An algorithm for nonlinear 0-1 programming and its application in structural optimization. Journal of Numerical Method and Computational Applications 1(9), 22–31 (1988)

    Google Scholar 

  30. Watters, L.J.: Reduction of integer polynomial programming to zero-one linear programming problems. Operations Research 15, 1171–1174 (1967)

    Article  Google Scholar 

  31. Wu, Z., Wah, B.W.: Solving hard satisfiability problems using the discrete Lagrange-multiplier method. In: Proc. 1999 National Conference on Artificial Intelligence, pp. 673–678. AAAI, Menlo Park (1999)

    Google Scholar 

  32. Wu, Z.: Discrete Lagrangian Methods for Solving Nonlinear Discrete Constrained Optimization Problems. M.Sc. Thesis, Dept. of Computer Science, Univ. of Illinois, Urbana, IL (May 1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois, Urbana-Champaign, Urbana, IL, 61801, USA

    Benjamin W. Wah & Zhe Wu

Authors
  1. Benjamin W. Wah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhe Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, National University of Singapore, 117543, Republic of Singapore

    Joxan Jaffar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wah, B.W., Wu, Z. (1999). The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48085-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66626-4

  • Online ISBN: 978-3-540-48085-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation