Abstract
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs) formulated as nonlinear programming (NLP) and mixed-integer NLP (MINLP). By exploiting the localities of constraints, we first partition each problem by parallel decomposition into subproblems that are related by complicating constraints and complicating variables. We develop heuristics for finding good starting points that are critical for resolving the complicating constraints and variables. In our experimental evaluations of 255 benchmarks, our approach can solve 89.4% of the problems, whereas the best existing solvers can only solve 42.8%.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM review 47(1), 99–131 (2005)
Wächter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Programming 106(1), 25–57 (2006)
Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programming. Operations Research 8, 101–111 (1960)
Wah, B.W., Chen, Y.X.: Solving large-scale nonlinear programming problems by constraint partitioning. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 697–711. Springer, Heidelberg (2005)
Wah, B., Chen, Y.X.: Constraint partitioning in penalty formulations for solving temporal planning problems. Artificial Intelligence 170(3), 187–231 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, S., Wah, B. (2008). Finding Good Starting Points for Solving Nonlinear Constrained Optimization Problems by Parallel Decomposition. In: Gelbukh, A., Morales, E.F. (eds) MICAI 2008: Advances in Artificial Intelligence. MICAI 2008. Lecture Notes in Computer Science(), vol 5317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88636-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-88636-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88635-8
Online ISBN: 978-3-540-88636-5
eBook Packages: Computer ScienceComputer Science (R0)