Layout optimization is an NP-hard problem. It also belongs to complex nonlinear constrained optimization problem.
布局优化是NP难问题，也是复杂的非线性约束优化问题。
This paper proposes a trust-region-type succesive linear algorithm with self-adjusted penalty parameter for nonlinear constrained optimization.
对于非线性约束最优化，提出了一个自动调节罚因子的信赖域类型的逐次线性算法。
The Chaotic neural network model can be used to solve many multi-dimensioned, discrete, non-convex, nonlinear constrained optimization problems.
基于混沌神经网络模型可以有效地解决高维、离散、非凸的非线性约束优化问题。
In this paper, we consider the nonlinear inequality constrained optimization problems.
在本文中，我们考虑非线性不等式约束优化问题。
Based on fully stressed criterion, a mathematical model for spring optimization design has been built. The model is a constrained nonlinear programming problem.
按满应力准则建立了弹簧优化设计的数学模型，它是一个有约束的非线性规划问题。
Predictive control algorithms for a multivariable nonlinear system with limited inputs and outputs can be formulated as a constrained nonlinear optimization problem which is hard to solve.
输入输出受限非线性系统的预测控制问题，可以看作是一个难以直接求解的约束非线性优化问题。
This paper presents an algorithm for nonlinear inequality constrained optimization problems which begins at any starting point.
本文给出非线性不等式约束最优化问题的一个初始点可任取的算法。
In this paper, a trust region algorithm for general nonlinear equality constrained optimization problems, is presented. The solution of their subproblems is easy.
对一般非线性等式约束最优化问题提出了一种信赖域算法，其子问题较易求解。
The constrained complex method is one of the important ways to resolve the problem of nonlinear optimization.
约束复合形法是求解约束非线性最优问题的一种重要方法。
The essential of planar location issue is nonlinear continuous function optimization under constrained condition.
平面选址问题实质上是带约束的非线性连续函数优化问题。
Based on analysis of the effects of the pitch on heat transfer enhancement and flow resistance, the pitch was optimized by the constrained nonlinear optimization method.
通过分析内管螺距对强化换热和流动阻力的影响，采用有约束非线性优化方法对螺距进行了优化。
A new, feasible chaos optimization algorithm is presented to nonlinear constrained programming problem.
针对非线性约束问题，提出了一种新的、可行的混沌优化算法。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
应用推荐