The theory of discrete lagrange multipliers for nonlinear discrete optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1713, Issue , 1999, Pages 28-42

  Wah, Benjamin W ^a   Wu, Zhe ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; OPTIMIZATION; VECTOR SPACES;

CONSTRAINED OPTIMI-ZATION PROBLEMS; CONSTRAINT FUNCTIONS; DESCENT DIRECTIONS; DISCRETE OPTIMIZATION; FIRST-ORDER CONDITIONS; LOCAL SEARCH METHOD; MATHEMATICAL FOUNDATIONS; NON-LINEAR DISCRETE OPTIMIZATION PROBLEMS;

LAGRANGE MULTIPLIERS;

EID: 84957357422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_3     Document Type: Conference Paper

References (32)

1. K. J. Arrow and L. Hurwicz. Gradient method for concave programming, I: Local results. In K. J. Arrow, L. Hurwica, and H. Uzawa, editors, Studies in Linear and Nonlinear Programming. Stanford University Press, Stanford, CA, 1958.
2. E. Balas. Minimax and Duality for Linear and Nonlinear Mixed-Integer Programming. North-Holland, Amsterdam, Netherlands, 1970.
3. M. S. Bazaraa and J. J. Goode. A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality. European Journal of Operational Research, 3:322–338, 1979.
4. K. F. M. Choi, J. H. M. Lee, and P. J. Stuckey. A Lagrangian reconstruction of a class of local search methods. In Proc. 10th Int’l Conf. on Artificial Intelligence Tools. IEEE Computer Society, 1998.
5. A. Frank. An algorithm for submodular functions on graphs. Ann. Discrete Math., 16:97–120, 1982.
6. B. Gavish. On obtaining the ‘best’ multilpliers for a lagrangean relaxation for integer programming. Comput. & Ops. Res., 5:55–71, 1978.
7. A. M. Geoffrion. Lagrangean relaxation for integer programming. Mathematical Programming Study, 2:82–114, 1974.
8. F. R. Giles and W. R. Pulleyblank. Total Dual Integrality and Integer Polyhedra, volume 25. Elsevier North Holland, Inc., 1979.
9. F. Glover. Tabu search — Part I. ORSA J. Computing, 1(3):190–206, 1989.
10. F. Glover and E. Woolsey. Converting the 0-1 polynomial programming problem to a 0-1 linear program. Operations Research, 22:180–182, 1975.
11. D. Granot, F. Granot, and W. Vaessen. An accelerated covering relaxation algorithm for solving positive 0-1 polynomial programs. Mathematical Programming, 22:350–357, 1982.
12. P. Hansen, B. Jaumard, and V. Mathon. Constrained nonlinear 0-1 programming. ORSA Journal on Computing, 5(2):97–119, 1993.
13. J. H. Holland. Adaption in Natural and Adaptive Systems. University of Michigan Press, Ann Arbor, 1975.
14. J. J. Hopfield and D. W. Tank. Neural computation by concentrating information in time. In Proc. National Academy of Sciences, volume 84, pages 1896–1900, Washington, D. C., 1987. National Academy of Sciences.
15. M. E. Hribar. Large scale constrained optimization. Ph.D. Disertation, Northeasten University, 1996.
16. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671–680, May 1983.
17. D. G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley Publishing Company, 1984.
18. P. Morris. The breakout method for escaping from local minima. In Proc. of the 11th National Conf. on Artificial Intelligence, pages 40–45, Washington, DC, 1993.
19. K. Murota. Discrete convex analysis. Mathematical Programming, 83(3):313–371, 1998.
20. R. T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
21. I. Rosenberg. Minimization of pseudo-boolean functions by binary development. Discrete Mathematics, 7:151–165, 1974.
22. Y. Shang and B. W. Wah. Discrete Lagrangian-based search for solving MAXSAT problems. In Proc. Int’l Joint Conf. on Artificial Intelligence, pages 378–383. IJCAI, August 1997.
23. Y. Shang and B. W. Wah. A discrete Lagrangian based global search method for solving satisfiability problems. J. Global Optimization, 12(1):61–99, January 1998.
24. J. F. Shapiro. Generalized Lagrange multipliers in integer programming. Operations Research, 19:68–76, 1971.
25. J. Tind and L. A. Wolsey. An elementary survey of general duality theory in mathematical programming. Mathematical Programming, pages 241–261, 1981.
26. B. W. Wah, Y. Shang, and Z. Wu. Discrete Lagrangian method for optimizing the design of multiplierless QMF filter banks. IEEE Transactions on Circuits and Systems, Part II, (accepted to appear) 1999.
27. B. W. Wah and T. Wang. Simulated annealing with asymptotic convergence for nonlinear constrained global optimization. Principles and Practice of Constraint Programming, (accepted to appear) October 1999.
28. B. W. Wah and Z. Wu. Discrete Lagrangian method for designing multiplierless two-channel PR-LP filter banks. VLSI Signal Processing, 21(2):131–150, June 1999.
29. X. D. Wang. 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.
30. L. J. Watters. Reduction of integer polynomial programming to zero-one linear programming problems. Operations Research, 15:1171–1174, 1967.
31. Z. Wu and B. W. Wah. Solving hard satisfiability problems using the discrete Lagrange-multiplier method. In Proc. 1999 National Conference on Artificial Intelligence, pages 673–678. AAAI, July 1999.
32. Zhe Wu. Discrete Lagrangian Methods for Solving Nonlinear Discrete Constrained Optimization Problems. M.Sc. Thesis, Dept. of Computer Science, Univ. of Illinois, Urbana, IL, May 1998.