In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.

本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。

youdao

Based on successive unconstrained programming methods, the successive bound constrained programming algorithms for large-scale process system optimization are studied in this paper.

基于非线性约束极小化的序列无约束方法，对大规模过程系统稳态优化的序列界约束方法进行了研究。

youdao

BFGS algorithm is one of the most effective methods in solving the non-constrained optimization problems.

BFGS算法是解无约束优化问题的公认的最有效的算法之一。

youdao