UNCONSTRAINED

作品数：77被引量：100H指数：6
导出分析报告
相关领域：理学更多>>
相关机构：对外经济贸易大学北京科技大学华南理工大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家教育部博士点基金国家重点基础研究发展计划国家科技支撑计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Numerical Mathematics（Theory,Methods and Applications）x
共 条 记 录，以下是1-4
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
A TRANSFORMATION PATH ALGORITHM FOR UNCONSTRAINED SIGNOMIAL GEOMETRIC PROGRAMMING
《Numerical Mathematics A Journal of Chinese Universities(English Series)》2004年第1期42-49,共8页王燕军 张可村 
In this paper we present a transformation path algorithm for Unconstrained Signomial Geometric Programming (USGP). The algorithm is proposed from a new point of view based on exploring the characteristics of USGP prob...
关键词：路径转换算法 非约束Signomial几何规划 SGP 收敛性 HESSIAN矩阵 
A CHARACTERIZATION OF SELF-SCALING RANK ONE UPDATE
《Numerical Mathematics A Journal of Chinese Universities(English Series)》2002年第1期106-112,共7页Sun Linping(孙麟平) 
The Project Suppoted by the National Natural Science Foundation (40075023).
An analysis on the property of Self-Scaling Rank One Update (SSR1) is given. In view of it, we explore whether the SSR1 update without using exact line search possesses the finite termination property when it is appli...
关键词：quasi-Newton  finite termination  INEXACT line search  UNCONSTRAINED optimization. 
A CLASS OF COLLINEAR SCALING ALGORITHMS FOR UNCONSTRAINED OPTIMIZATON
《Numerical Mathematics A Journal of Chinese Universities(English Series)》1997年第2期219-230,共12页盛松柏 
Supported by NNSF of China and NSF of Jiangsu Province
A Class of Collinear Scaling Algorithms for Unconstrained Optimization. An appealing approach to the solution of nonlinear optimization problems based on conic models of the objective function has been in troduced by ...
关键词：UNCONSTRAINED optimization CONIC models COLLINEAR scaling QUASI-NEWTON algorithms. 
AN IMPROVEMENT ON UNCONSTRAINED CONVEX PROGRAMMING APPROACH TO LINEAR PROGRAMMING
《Numerical Mathematics A Journal of Chinese Universities(English Series)》1995年第1期44-48,共5页盛松柏 
The project was supported by the National Natural Science Fundation of China
For satate form linear gram as Fang and sao deined and approach which would find an optimal solution by solving an anconstrained convex dual programming.Thedual was construcied by applying an emropic peturbation and a...
关键词：LINEAR PROGRAMMING entropie FUNCTION CONVEX PROGRAMMING GEOMETRIC dtility theory 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部