3 简约空间SQP算法 近二十年来，序列二次规划算法(Sequential Quadratic Programming, SQP)是求解中小规模非线性优化 命题最为有效的方法之一 [6] ，为将其应用于大规模优化命题求解，SQP ...
基于2个网页-相关网页
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP)。
In this paper, a modified sequential quadratic program (SQP) for inequality constrained optimization problems is presented.
利用直接打靶法，将此最优控制模型转化为非线性规划问题，并采用序列二次规划算法进行解算。
By using direct shooting method, the associated optimization was converted into a nonlinear programming problem, which was solved through a sequential quadratic programming solver.
应用推荐