最优化问题

一种解决无约束非线性最优化问题的SD模型

A System Dynamics Model for Solving Nonlinear Optimization Problem without Constraint

一类非光滑最优化问题的非单调Bundle型算法

A Nonmonotonic Bundle-Type Algorithm for a Class of Nonsmooth Optimization Problems

本文将2005年“电工杯”B题的最优化问题转化为独立的问题来讨论。

This paper transfers the optimal problem of Test Bin2005 's Diangong Cup B into an independent one .

集&集映射的最优化问题的Lagrange对偶关系

Lagrange duality relation of optimization problems with set set maps

Banach空间中多目标最优化问题的标量化条件

Scalar Conditions for Multi - Objective Optimization in Banach Space

该工作可提高DNA计算中表示和处理数值的能力，扩展DNA计算求解最优化问题的范围。

This work improves the capability of representing and dealing with data and extends the range of solving numerical optimization problems in DNA computing .

向量最优化问题的Lagrange对偶与择一定理

Lagrange Duality and Alternative Theorem of Vector Optimization Problem

Banach空间中向量最优化问题的充分条件

Sufficient Conditions of Vector Optimization Problem in Banach Spaces

Hopfield网络学习及其在最优化问题中的应用

Hopfield Network Learning and Its Application in Optimization Problems

NP最优化问题的可近似性

The Approximability of NP Optimization Problems

Hilbert空间中的一个最优化问题

An Optimization Problem In Hilbert Space

自反Banach空间中锥拟凸映射多目标最优化问题锥有效解集的弱连通性

Weak Connectedness of the Efficient Solution set for Cone - quasiconvex Vector Optimization in Reflexive Banach Spaces

这个最优化问题已被证明是NP-hard。

This optimization problem has been proved to be NP-hard .

最优化问题的Lagrangian对偶理论与SQP方法

Lagrangian Dual Theory and SQP Method in Optimization Problem

其突出的优点是把复杂的多参数的最优化问题分离为N个小型最优化问题，这里N是隐藏层单元数。

A salient feature of this algorithm is that it decomposes a complicated multiparameter optimization problem into N separate small-scale optimization problems , where N is the number of hidden units .

当衡量独立性的目标函数确定的时候，ICA可以归结为一个简单的最优化问题。

When the measurement function on independence is determined , ICA can be attributed to a simple optimization problem .

一类大规模最优化问题的并行BFGS算法

Parallel BFGS Algorithm for a Class of Large Scale Optimization Problem

超大规模集成电路（VLSI）中的参数成品率最优化问题一直是集成电路可制造性设计的重点研究问题。

The maximum problem of parametric yield in VLSI is always an important issue in design for manufacturing ( DFM ) .

Lagrangian对偶问题和鞍点最优性条件又是最优化问题中的重要课题。

The Lagrangian dual problem and the optimization conditions of the saddle point play important parts in optimization problem .

本文根据近年来由意大利学者Dorigo等人最初提出的蚂蚁系统算法（AntSystem）来解决桁架的最优化问题。

Based on ant system algorithm which initially proposed by Italian scholars including Dorigo , etc , the paper tries to solve the truss optimization problem .

求解约束最优化问题KKT系统的BFGS方法

A BFGS Method for Solving KKT Systems of Constrained Optimization Problems

求解等式约束最优化问题的Broyden算法的全局收敛性

Global Convergence of Broyden 's Method for Equality Constrained Optimization Problems

通过引入凸泛函F定义了一类新的广义凸函数，并在此凸性下讨论了非光滑最优化问题的充分性条件。

In this paper , we defined a new kind of generalized F convex functions by introducing a convex functional F several sufficient conditions for nonsmooth optimization problems have been presented .

许多有着重要理论和应用价值的最优化问题在算法复杂性上都是NP-hard的，其解决方法之一是近似算法。

Many worthwhile optimization problems are NP-hard in algorithmic complexity , one of the solutions of which is approximation algorithm .

在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。

In convex programming theory , a constrained optimization problem , by KT conditions , is usually converted into a mixed nonlinear complementarity problem .

多学科设计优化（Multidisciplinarydesignoptimization，MDO）方法研究耦合多学科系统的设计最优化问题，对于提高飞行器设计水平具有非常现实与重要的意义。

The MDO ( Multidisciplinary Design Optimization ) method handles the optimal design problem of coupled multidisciplinary system . It has very practical and important meaning to increase the aerospace vehicle design level .

简要介绍了MATLAB程序设计语言及其优化工具箱，通过对MATLAB优化工具箱中最小化函数的语法进行分析，提出通过实时创建M文件从而编写最优化问题求解通用程序的方法。

This paper briefly introduces MATLAB 's Optimization toolbox and the syntax of optimization functions , then proposes a method for programming general-duty program for solving optimization question , which is based on creating M-files timely .

本文将2001CMCMB题公交车调度的最优化问题分成两个相对独立的问题来讨论，由所要运送的乘客数来决定公交公司的最小车辆数，由乘客到达来决定发车时刻表。

This paper transfers the optimal problem of 2001 ′ s CMCM-B into two relatively independent problems . The least number of the bus is determined by the amount of the passengers and the timetable is determined by the passengers ′ arrival .

本文研究求解约束最优化问题的序列二次规划算法（SQP算法）。

In this paper , we are concerned with the sequence quadratic programming ( SQP ) methods for solving constrained optimization problems .

Newton-PCG算法是解决无约束问题的有效方法，在该算法中需要求解一个一维整数最优化问题，并且算法的效率也依赖于它的最优值。

Newton-PCG algorithm is very efficient for solving the unconstrained optimization problems .