Two differential equation systems for equality-constrained optimization

Li Jin

doi:10.1016/j.amc.2006.11.041

Two differential equation systems for equality-constrained optimization

2007-07-01

9

PRE

AI

DOI：10.1016/j.amc.2006.11.041

Original

Original request for help

Save

Abstract

En 中文

This paper presents two differential systems, involving first and second order derivatives of problem functions, respectively, for solving equality-constrained optimization problems. Local minimizers to the optimization problems are proved to be asymptotically stable equilibrium points of the two differential systems. First, the Euler discrete schemes with constant stepsizes for the two differential systems are presented and their convergence theorems are demonstrated. Second, we construct algorithms in which directions are computed by these two systems and the stepsizes are generated by Armijo line search to solve the original equality-constrained optimization problem. The constructed algorithms and the Runge-Kutta method are employed to solve the Euler discrete schemes and the differential equation systems, respectively. We prove that the discrete scheme based on the differential equation system with the second order information has the locally quadratic convergence rate under the local Lipschitz condition. The numerical results given here show that Runge-Kutta method has better stability and higher precision and the numerical method based on the differential equation system with the second information is faster than the other one. (c) 2006 Elsevier Inc. All rights reserved.

Keywords:

nonlinear equality-constrained optimization

constraint qualification

differential equation

asymptotical stability

equilibrium point

Two differential equation systems for equality-constrained optimization

Abstract

Journal

Organization