Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
Simulation results show that the proposed approach has fast convergence and good optimization ability, and is suitable for solving constrained optimization problems.
实验结果表明，新算法收敛速度快，寻优能力强，能很好地求解约束优化问题。
It is only used for solving inequality constrained optimization problem.
它仅用于求解不等式约束优化问题。
In this paper, a kind of general constrained optimization problem is discussed.
在本文中，我们讨论的是一般约束优化的问题。
The Optimal design of electronic circuits is a problem of constrained optimization.
电子电路的优化设计是非线性约束优化问题。
In this paper, we consider the nonlinear inequality constrained optimization problems.
在本文中，我们考虑非线性不等式约束优化问题。
Automatic Test Paper is a combination of multi-objective constrained optimization problem.
智能组卷是一个多约束目标的组合优化问题。
To solve complex constrained optimization problems, we propose a new immune-genetic algorithm.
提出一种新的求解复杂约束优化问题的免疫遗传算法。
In this paper, we develop a trust region algorithm for convex constrained optimization problems.
本文我们考虑求解凸约束优化问题的信赖域方法。
A subspace truncated-Newton algorithm for large-scale bound constrained optimization is proposed.
给出了大规模界约束优化的一个子空间截断牛顿法。
We present an algorithm for the solution of general inequality constrained optimization problems.
我们提出一个一般不等式约束优化问题的求解算法。
In this paper, we consider an affine-scaling algorithm for the bound constrained optimization problem.
本文我们考虑求解边界约束优化问题的一个仿射尺度算法。
BFGS algorithm is one of the most effective methods in solving the non-constrained optimization problems.
BFGS算法是解无约束优化问题的公认的最有效的算法之一。
Therefore, its KKT conditions are different from those of the general equality constrained optimization problem.
转化后的问题要求其乘子是非负的，故其KKT条件与一般的等式约束优化问题不同。
Layout optimization is an NP-hard problem. It also belongs to complex nonlinear constrained optimization problem.
布局优化是NP难问题，也是复杂的非线性约束优化问题。
In this paper, a trust region method with new conic model for linearly constrained optimization problems is proposed.
本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法。
The method is based on the regularization technique, solving the constrained optimization by proposed iteration steps.
该方法利用正则化技术，通过迭代运算解求重建影像的最优解。
The method of feasible directions (MFD for short) is an important method for solving nonlin-early constrained optimization.
可行方向法（简称为MFD）是用于求解非线性约束最优化重要的方法之一。
The equations of nonlinearly constrained optimization are presented for the evaluation of the minimal circumscribed sphere.
本文把最小外接球的评定问题表述为非线性约束最优化问题，并采用有效约束技术求得精确的最优解。
In this paper, a modified sequential quadratic program (SQP) for inequality constrained optimization problems is presented.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP)。
A method for solving minimax problem is presented, which also can be used to solve linear or constrained optimization problems.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
Based on the orthogonality of rotation matrix, a constrained optimization approach is proposed to estimate the rotation matrix.
本文利用旋转矩阵的正交性，提出了进一步改善原旋转矩阵估计的约束优化方法。
This paper presents an algorithm for nonlinear inequality constrained optimization problems which begins at any starting point.
本文给出非线性不等式约束最优化问题的一个初始点可任取的算法。
Starting with the constrained optimization method, an algorithm for the even distribution of the machining allowance is developed.
从约束优化方法入手，提出了复杂等距型面加工余量均布优化算法。
In this paper, we are concerned with the sequence quadratic programming (SQP) methods for solving constrained optimization problems.
本文研究求解约束最优化问题的序列二次规划算法(SQP算法)。
Sequential Unconstrained Minimization Techniques (SUMT) are most common and comparatively successful method in constrained optimization.
罚函数法(SUMT)是处理约束优化问题时最常用、也是较为成功的一种方法。
In this paper, the constrained optimization problem is discussed to arrive at a general perturbed gradient projection method for solution.
讨论带不等式和等式约束优化问题，提出了求解非线性规划问题的广义摄动梯度投影算法。
We propose a new trust region algorithm for special linear inequality constrained optimization problems with nonnegative bound constraints.
对一类带有非负边界约束的线性不等式约束优化问题进行了研究，提出了一种新的信赖域算法。
We propose a new trust region algorithm for special linear inequality constrained optimization problems with nonnegative bound constraints.
对一类带有非负边界约束的线性不等式约束优化问题进行了研究，提出了一种新的信赖域算法。
应用推荐