arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.09829math.OC
收藏

将非线性规划问题转化为初值问题求解

Transform the Non-linear Programming Problem to the Initial-value Problem to Solve

Sheng Zhang, Fei Liao, Yi-Nan Kong, Kai-Feng He

摘要:

提出了一种求解含等式约束和不等式约束的非线性规划问题的动态方法。受控制领域中李雅普诺夫连续时间动力学稳定性理论的启发,将最优解类比为有限维动力系统的稳定平衡点,并以渐近方式求解。在KKT(Karush-Kuhn-Tucker)最优性条件存在的前提下,建立了与优化参数向量维数相同的动态最优化方程,并在理论上保证其解全局收敛于NLP的最优解.利用矩阵的伪逆,即使对非线性约束没有线性无关的正则性要求,DOE也是有效的。此外,还推导了在整个优化过程中分别与EC和IEC相邻的Lagrange乘子和KKT乘子的解析表达式。该方法可以将自然线性规划问题转化为初值问题来求解,并可采用成熟的常微分方程积分方法。算例表明,所提出的动力学方法可以高效地得到正确的数值解。

英文摘要:

A dynamic method to solve the Non-linear Programming (NLP) problem with Equality Constraints (ECs) and Inequality Constraints (IECs) is proposed. Inspired by the Lyapunov continuous-time dynamics stability theory in the control field, the optimal solution is analogized to the stable equilibrium point of a finite-dimensional dynamic system and it is solved in an asymptotic manner. Under the premise that the Karush-Kuhn-Tucker (KKT) optimality condition exists, the Dynamic Optimization Equation (DOE), which has the same dimension to that of the optimization parameter vector, is established and its solution will converge to the optimal solution of the NLP globally with a theoretical guarantee. Using the matrix pseudo-inverse, the DOE is valid even without the linearly independent regularity requirement on the nonlinear constraints. In addition, the analytic expressions of the Lagrange multipliers and KKT multipliers, which adjoin the ECs and the IECs respectively during the entire optimization process, are also derived. Via the proposed method, the NLP may be transformed to the Initial-value Problem (IVP) to be solved, with mature Ordinary Differential Equation (ODE) integration methods. Illustrative examples are solved and it is shown that the dynamic method developed may produce the right numerical solutions with high efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑