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.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
BFGS algorithm is one of the most effective methods in solving the non-constrained optimization problems.
BFGS算法是解无约束优化问题的公认的最有效的算法之一。
Particle swarm optimization (PSO) algorithm is one of the most powerful methods for solving unconstrained and constrained global optimization problems.
粒子群优化算法(PSO)是一种有效的随机全局优化技术。
Particle swarm optimization (PSO) algorithm is one of the most powerful methods for solving unconstrained and constrained global optimization problems.
粒子群优化算法(PSO)是一种有效的随机全局优化技术。
应用推荐