In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
Simulation results show that the proposed approach has fast convergence and good optimization ability, and is suitable for solving constrained optimization problems.
实验结果表明，新算法收敛速度快，寻优能力强，能很好地求解约束优化问题。
A method for solving minimax problem is presented, which also can be used to solve linear or constrained optimization problems.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
应用推荐