Advertisement

Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning

  • Benjamin W. Wah
  • Yixin Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)

Abstract

In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Based on our observation that MINLPs in many engineering applications have highly structured constraints, we propose to partition these MINLPs by their constraints into subproblems, solve each subproblem by an existing solver, and resolve those violated global constraints across the subproblems using our theory of extended saddle points. Constraint partitioning allows many MINLPs that cannot be solved by existing solvers to be solvable because it leads to easier subproblems that are significant relaxations of the original problem. The success of our approach relies on our ability to resolve violated global constraints efficiently, without requiring exhaustive enumerations of variable values in these constraints. We have developed an algorithm for automatically partitioning a large MINLP in order to minimize the number of global constraints, an iterative method for determining the optimal number of partitions in order to minimize the search time, and an efficient strategy for resolving violated global constraints. Our experimental results demonstrate significant improvements over the best existing solvers in terms of solution time and quality in solving a collection of mixed-integer and continuous nonlinear constrained optimization benchmarks.

Keywords

Problem Instance Constraint Function Master Problem Global Constraint Local Optimal Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)zbMATHGoogle Scholar
  2. 2.
    Bongartz, I., Conn, A.R., Gould, N., Toint, P.L.: CUTE: Constrained and unconstrained testing environment. ACM Trans. on Mathematical Software 21(1), 123–160 (1995)zbMATHCrossRefGoogle Scholar
  3. 3.
    Conn, A.R., Gould, N., Toint, P.L.: Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. Mathematical Programming 73, 73–110 (1996)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Duran, M.A., Grossmann, I.E.: An outer approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming 36, 306–307 (1986)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Brooks Cole Publishing Company (2002)Google Scholar
  6. 6.
    Geoffrion, A.M.: Generalized Benders decomposition. J. Optim. Theory and Appl. 10(4), 237–241 (1972)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Gill, P.E., Murray, W., Saunders, M.: SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Journal on Optimization 12, 979–1006 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Gould, N.I.M., Orban, D., Toint, P.L.: An interior-point ℓ1-penalty method for nonlinear optimization. Technical report, RAL-TR-2003-022, Rutherford Appleton Laboratory Chilton, Oxfordshire, UK (2003)Google Scholar
  9. 9.
    Harjunkoski, I., Westerlund, T., Pörn, R., Skrifvars, H.: Different transformations for solving non–convex trim loss problems by MINLP. European Journal of Operations Research 105, 594–603 (1998)zbMATHCrossRefGoogle Scholar
  10. 10.
    Holmberg, K.: On the convergence of the cross decomposition. Mathematical Programming 47, 269–316 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Leyffer, S.: Mixed integer nonlinear programming solver (2002), http://www-unix.mcs.anl.gov/~leyffer/solvers.html
  12. 12.
    Leyffer, S.: MacMINLP: AMPL collection of MINLP problems (2003), http://www-unix.mcs.anl.gov/~leyffer/MacMINLP/
  13. 13.
    Rardin, R.L.: Optimization in Operations Research. Prentice-Hall, Englewood Cliffs (1998)Google Scholar
  14. 14.
    Sahinidis, N.V.: BARON: A general purpose global optimization software package. Journal of Global Optimization 8(2), 201–205 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Wah, B., Chen, Y.X.: Fast temporal planning using the theory of extended saddle points for mixed nonlinear optimization. Artificial Intelligence (accepted for publication) (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Benjamin W. Wah
    • 1
  • Yixin Chen
    • 1
  1. 1.Department of Electrical and Computer Engineering, and the Coordinated Science LaboratoryUniversity of IllinoisUrbanaUSA

Personalised recommendations