Solving large-scale nonlinear programming problems by constraint partitioning

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

Volumn 3709 LNCS, Issue , 2005, Pages 697-711

  Wah, Benjamin W ^a   Chen, Yixin ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; MATHEMATICAL TECHNIQUES; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINT PARTITIONING; LOCAL OPTIMAL SOLUTIONS; MIXED INTEGER NONLINEAR PROGRAMMING PROBLEMS (MINLPS); SUBPROBLEMS;

NONLINEAR PROGRAMMING;

EID: 33646171746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_51     Document Type: Conference Paper

References (15)

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