欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为寻求能够降低正定几何规划问题难度的新方法,本文首先尝试运用对偶理论把正定几何规划问题转化成等式约束和非负约束条件下的非线性规划问题,然后结合信赖域算法和内点算法构造出一种求解正定式几何规划问题的新算法,并在较少条件下证明了该算法的收敛性。该算法一方面减少了计算量,另一方面还可以降低求解几何规划的困难度。
英文摘要：
Positive geometric programming is an important part of nonlinear programming.In order to find a new method to reduce the difficulty of positive geometric programming,the positive geometric programming is substited for nonlinear programming with nonnegative constraint and equation constrain by using the duality theory.A new algorithm is constructed by combing trust region algorithm and the interior point algorithm for solving the positive geometric programming.Under mild conditions,the convergence is proved.The method not only decreases the iteration step but also reduces the degrees of difficulty for solving the positive geometric programming.
同期刊论文项目
同项目期刊论文
A Hermitian least squares solution of the matrix equation AXB = C subject to inequality restrictions
A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility pr
Speed Optimization Control for Wheeled Robot Navigation with Obstacle Avoidance Based on Viability T
On the Convergence of Central Path and GeneralizedProximal Point Method for Symmetric Cone Linear Pr
On the Convergence of Central Path and Generalized Proximal Point Method for Symmetric Cone Linear P
Convergence of an algorithm for the split common fixed-point of asymptomatic quasi-nonexpansive oper
Portfolio selection problem with Value-at-Risk constraints under non-extensive statistical mechanics
Local composite quantile regression estimation of time-varying parameter vector for multidimensional
Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
期刊信息
位置：