A deterministic global optimization algorithm based on Lagrangian dual is proposed for solving the nonconvex quadratic programming with nonconvex quadratic constraints
which is often encountered in technical design and operational research. By utilizing a linearized method the difficulty that the Lagrangian dual problem is nonconvex is solved and the linearization relaxation of the Lagrangian is obtained. The proposed branch and bound algorithms are convergent to the global minimum via successive refinement of the linear relaxation of the Lagrangian dual problem and the solutions to a series of the relaxation of linear programming. Interval Newton method is used to accelerate the convergence of the algorithm. Numerical experiments are given to verify the feasibility of the proposed algorithm.
关键词
Keywords
references
KHAMMASH M H. Synthesis of globally optimal controllers for robust performance to unstructured uncertainty[J]. IEEE Transactions on Automatic Control,1996, 41(2):189-198.
SALAPAKA M V, KHAMMASH M H, VOORHIS T V.Synthesis of globally optimal controllers in h using the reformulation-linearization technique[C]∥Proceedings of the IEEE Conference on Decision and Control. Piscataway, NJ, USA: IEEE, 1998.
LODWICK W A. Preprocessing nonlinear functional constraints with applications to the pooling problem[J]. ORSA Journal on Computing,1992, 4(1):119-131.
FLOUDAS C A, VISWESWARAN V. Primal-relaxed dual global optimization approach[J]. Journal of Optimization Theory and Applications, 1993, 78:187-225.
QU S J, YIN H Y, ZHANG K C. A global optimization algorithm using linear relaxation[J].Applied Mathematics and Computation, 2006,178:510-518.
VOORHIS T V. A global optimization algorithm using Lagrangian underestimates and the interval Newton method[J]. Journal of Global Optimization, 2002,24:349-370.
PARDLOS P M, ROSEN J B. Constrained global optimization: algorithms and applications[M]. Berlin,Germany:Springer-Verlag, 1987.
AN L T H. An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints[J]. Math Program: Ser A, 2000, 87(12):401-426.
KEARFOTT R B.Rigorous global search: continuous problems, nonconvex optimization and its applications[M]. Dordrecht,Holland:Kluwer Academic Publishers,1996.
MARANAS C D, FLOUDAS C A. Global optimization in generalized geometric programming[J]. Computers and Chemical Engineering,1997,21(4):351-369.