Some relevant conditions on unconstrained and constrained problems are obtained.
得出了无约束问题、约束问题的相关条件。
The paper, combined with evaluation function introduces the transformation of constrained problems into unconstrained ones, and offers an interval extension.
结合评价函数法将带约束的多目标优化问题转化为无约束优化问题，并给出相应的区间扩张，对相关定理进行了证明。
Numerical results show that the present algorithm is efficient and reliable. The last chapter, we present a modified filter trust region method for bound constrained problems.
第六章，由第五章求解无约束问题的多维滤子信赖域修正算法出发，将其推广到界约束乃至凸约束的优化问题。
Global convergence is promoted through the use of the filter and the convergence theory holds for convex constrained problems. Numerical results demonstrate the efficiency of the modified algorithm.
修正算法对于凸约束优化问题全局收敛，最后我们通过一组数值试验验证了新算法的实际运行效果。
Thus, within a context of norms and trust, humans online will behave in coordinated ways, addressing collective problems through knowledge-constrained, coordinated individual actions.
因此，在一个拥有准则和互相信任的背景下，网络使人们会变得协作，通过每个人的合作行为，来处理相同的问题，哪怕这些个人行为会受到自身知识的限制。
This framework demonstrates that applications might benefit from asynchronous designs when faced with performance and scalability problems — even in a resource-constrained environment.
该框架表明应用程序在性能和可伸缩性方面会从异步设计中获益 —甚至在一个资源受限的环境中。
In this paper, we consider the nonlinear inequality constrained optimization problems.
在本文中，我们考虑非线性不等式约束优化问题。
A method for solving minimax problem is presented, which also can be used to solve linear or constrained optimization problems.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
To solve the equation constrained optimization problems, two new particle swarm optimization algorithms are presented. The experimental results show the algorithms are effective.
提出了求解有等式约束优化问题的两种新粒子群优化算法，数值试验结果表明，算法是有效的。
To solve complex constrained optimization problems, we propose a new immune-genetic algorithm.
提出一种新的求解复杂约束优化问题的免疫遗传算法。
Chapter 3 constructs a new generalized pattern search method for linear equality constrained optimization problems and gives the proofs of the global convergence.
第3章给出了广义模式搜索算法对线性等式约束最优化问题的一个新解法，并证明了这种算法的全局收敛性。
Sequential quadratic programming (SQP) method is an efficient method for solving smooth constrained optimization problems because of its fast convergence rate.
由于序列二次规划（SQP）算法具有快速收敛速度，所以它是求解光滑约束优化问题的有效方法之一。
The Chaotic neural network model can be used to solve many multi-dimensioned, discrete, non-convex, nonlinear constrained optimization problems.
基于混沌神经网络模型可以有效地解决高维、离散、非凸的非线性约束优化问题。
Image matching belongs to constrained optimization problems. Whether the system would converge to the global optimum is still an open problem.
图像匹配是一种约束最优化问题，系统是否收敛于全局最优值一直尚未解决。
The concept of regularity of feasible set is presented, under the regularity condition, the stability of more general probabilistic constrained programs problems is studied.
在原始规划可行集上引入了正则的概念，并在此正则条件下，研究了更一般的概率约束规划问题的稳定性。
In this paper, an algorithm of multiplier method for the constrained minimization problems is introduced.
本文简略介绍了使用乘子法解有约束极小问题的一个算法。
In this paper, descending algorithms for the constrained nonlinear programming problems are discussed and we offer a new way to research methods of nonlinear programming by that.
本文讨论了约束非线性规划问题的降维算法，为非线性规划算法的研究提供了一种新途径。
This article deals with the basic methods for solving unconstrained and constrained nonlinear problems. It describes also the linear approximation methods of nonlinear programming.
本文阐明无约束和有约束非线性问题的基本解法，并说明非线性规划的线性近似方法。
The constrained matrix equation problems have been widely used in control theory, economic field, vibration theory, civil engineering and so on.
约束矩阵方程问题广泛应用于自动控制、经济、振动理论以及土木工程等。
Currently, there is no general algorithm to find the global optimal solution for the constrained non-linear programming problems.
目前对有约束非线性规划问题还没有通用的求全局最优解的算法。
In this paper, we develop a trust region algorithm for convex constrained optimization problems.
本文我们考虑求解凸约束优化问题的信赖域方法。
The aim of the dissertation is to study second order derivatives based differential equation approaches to nonconvex constrained optimization problems.
本文旨在研究求解非凸约束优化问题的基于二阶导数的微分方程方法。
We propose a new trust region algorithm for special linear inequality constrained optimization problems with nonnegative bound constraints.
对一类带有非负边界约束的线性不等式约束优化问题进行了研究，提出了一种新的信赖域算法。
This paper presents a trust region algorithm for solving the constrained interpolation and smoothing problems such as convex interpolation, convex smoothing and shape-preserving interpolation.
针对凸插值、凸光顺和保形插值等带约束条件的插值和光顺问题，提出一种信赖域方法。
In this paper, a trust region method with new conic model for linearly constrained optimization problems is proposed.
本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法。
The improved approximate expressions are proposed to create the sequential approximation problems which are solved with the constrained variable metric method.
用该近似函数形成结构优化原问题的序列近似问题，再用约束变尺度法解近似问题。
The productive method on the initial population is studied by using genetic algorithms to solve the constrained optimization problems. The study gives the new method of initial population evolution.
针对用遗传算法求解约束优化问题时，初始种群产生的方法进行了研究，提出了初始种群产生的一种新方法。
We present an algorithm for the solution of general inequality constrained optimization problems.
我们提出一个一般不等式约束优化问题的求解算法。
We present an algorithm for the solution of general inequality constrained optimization problems.
我们提出一个一般不等式约束优化问题的求解算法。
应用推荐