在本文中，我们考虑非线性不等式约束优化问题。
In this paper, we consider the nonlinear inequality constrained optimization problems.
本文我们考虑求解凸约束优化问题的信赖域方法。
In this paper, we develop a trust region algorithm for convex constrained optimization problems.
共轭梯度法是求解无约束优化问题的一类有效方法。
The conjugate gradient method is one of the most efficient methods for solving unconstrained optimization problems.
我们提出一个一般不等式约束优化问题的求解算法。
We present an algorithm for the solution of general inequality constrained optimization problems.
提出一种新的求解复杂约束优化问题的免疫遗传算法。
To solve complex constrained optimization problems, we propose a new immune-genetic algorithm.
研究给出了一类新的求解无约束优化问题的下降算法。
In this paper, a class of new descent algorithm is proposed to solve unconstrained optimization problems.
第三部分，研究平衡约束优化问题的可行性和最优性条件。
Finally, we study feasibility and optimality conditions for optimization problems with equilibrium constraints.
本文我们考虑求解边界约束优化问题的一个仿射尺度算法。
In this paper, we consider an affine-scaling algorithm for the bound constrained optimization problem.
共轭梯度法是求解大规模无约束优化问题的一种有效方法。
Conjugate gradient method is an efficient method in solving problems with unconstrained optimization, which is especially efficient in dealing large dimension.
算例证明该方法适于解决变量少于二十的有约束优化问题。
It is proved by computing that this method is suitable for solving optimum questions of variables less than twenty.
布局优化是NP难问题，也是复杂的非线性约束优化问题。
Layout optimization is an NP-hard problem. It also belongs to complex nonlinear constrained optimization problem.
提出一种用于求解约束优化问题的自适应佳点集进化算法。
Novel constrained optimization evolutionary algorithm based on self-adaptive good points set (COEAAGP) is proposed to tackle constrained optimization problems (COPs) in this paper.
BFGS算法是解无约束优化问题的公认的最有效的算法之一。
BFGS algorithm is one of the most effective methods in solving the non-constrained optimization problems.
本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法。
In this paper, a trust region method with new conic model for linearly constrained optimization problems is proposed.
对于一般的无约束优化问题，信赖域方法是一种比较有效的方法。
Trust region method is a kind of efficient and robust method to solve general unconstrained optimization.
船舶结构优化设计问题通常是一个包含混合变量的约束优化问题。
Genetic algorithm(GA) to ship structure design optimization is comparativelly complex and involves many manual parameters and it is very difficult to select appropriate penal factors.
讨论了非线性不等式和等式约束优化问题在退化情形下的求解方法。
This paper discusses optimization with nonlinear equality and inequality constraints under degeneracy.
该文将动态优化问题描述为变约束优化问题，并提出一种求解算法。
The problem above is described as a variant constraint optimization problem and a corresponding algorithm is proposed.
本文旨在研究求解非凸约束优化问题的基于二阶导数的微分方程方法。
The aim of the dissertation is to study second order derivatives based differential equation approaches to nonconvex constrained optimization problems.
通过变换可将该无约束优化问题转化为求解非线性代数方程组的问题。
This unconstrained optimization problem may be transformed into nonlinear algebraic system of equations.
罚函数法(SUMT)是处理约束优化问题时最常用、也是较为成功的一种方法。
Sequential Unconstrained Minimization Techniques (SUMT) are most common and comparatively successful method in constrained optimization.
基于混沌神经网络模型可以有效地解决高维、离散、非凸的非线性约束优化问题。
The Chaotic neural network model can be used to solve many multi-dimensioned, discrete, non-convex, nonlinear constrained optimization problems.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
A method for solving minimax problem is presented, which also can be used to solve linear or constrained optimization problems.
本文使用信赖域策略结合投影梯度算法来解约束优化问题，并给出算法及其收敛性。
This paper is to study the convergence properties of the gradient projection method with trust region strategy for constrained optimization.
同时为了将不等式约束优化问题转化为单目标优化问题，对惩罚函数法进行了改进。
At the mean time, the penalty function was improved by transmuting the inequality constrained optimization problem into single target optimization one.
转化后的问题要求其乘子是非负的，故其KKT条件与一般的等式约束优化问题不同。
Therefore, its KKT conditions are different from those of the general equality constrained optimization problem.
本文提出一类求解无约束优化问题的非单调曲线搜索方法，在较弱条件下证明了其收敛性。
This paper presents a non-monotone curve search method for unconstrained optimization problems and proves its convergence under some mild conditions.
解决约束优化问题的关键是如何平衡来自目标函数最优化与满足约束条件这两方面的压力。
It is a key to how to balance the pressure from between the optimization of objective function and the satisfaction of constraints.
讨论带不等式和等式约束优化问题，提出了求解非线性规划问题的广义摄动梯度投影算法。
In this paper, the constrained optimization problem is discussed to arrive at a general perturbed gradient projection method for solution.
然后从信赖域子问题的角度出发，对无约束优化问题提出了一个改进的非单调信赖域算法。
We discuss non-monotonic trust region algorithm for unconstrained nonlinear optimization problems in view of Trust Region Model mainly.
应用推荐