0去购物车结算
购物车中还没有商品,赶紧选购吧!
当前位置: 图书分类 > 数学 > 代数/数论 > 数值线性代数与最优化(numerical linear algebra and optimization)

相同作者的商品

浏览历史

数值线性代数与最优化(numerical linear algebra and optimization)


联系编辑
 
标题:
 
内容:
 
联系方式:
 
  
数值线性代数与最优化(numerical linear algebra and optimization)
  • 书号:7030119193
    作者:袁亚湘
  • 外文书名:
  • 装帧:
    开本:16(23k)
  • 页数:232
    字数:200000
    语种:
  • 出版社:科学出版社
    出版时间:2003-12-26
  • 所属分类:Z89 文摘、索引
  • 定价: ¥150.00元
    售价: ¥118.50元
  • 图书介质:

  • 购买数量: 件  缺货,请选择其他介质图书!
  • 商品总价:

相同系列
全选

目录

  • Preface
    Part Ⅰ Invited Lectures
    1 Adaptive Finite Element Methods Coupled with A Posteriori Error Estimates-an Optimization Tool for Solving Navier-Stokes Equations
    2 Test Function Methods for Locating Bifurcation Parameters with Applications to Nonlinear Electrical Power Systems
    3 Unified Convergence Analyses of Nonlinear Conjugate Gradient Methods
    4 Variable Metric Methods for Monsmooth Optimization
    5 Convergence of an Online Gradient Method for Neural Networks
    6 Mathematical Modeling of Protein Structure Using Distance Geometry
    7 Visualization of Large Chemical Databases with Application to Drug Design
    8 Some Problems in Nonlinear Programming
    Part Contributed Papers
    9 An Approximation Elliptic Trust Region Interior Point Algorithm Based upon A Logarithmic Barrier Function for Nonconvex Quadratic Programming
    10 Some Nonmonotone Trust Region Algorithms and Their Convergence Analysis For LSP
    11 Some Estimates for Eigenvalues and Singular Values of Schur Complements of Normal Matrices
    12 An Outer Approximation Method For Solving The Biconcave Programs With Separable Linear Constraints
    13 A Trust Region Algorithm Combined with Curved Path Line Search techniques
    14 An Interval Algorithm for Global Minimizing Non-smooth Function of Several Variables
    15 A Modified Evolutionary Algorithm with Chaos Sesrch for n-dimensional Global Optimization
    16 Iterated Self-adaptive Regularization Method for Ⅲ-Posed Problems
    17 A Smooth Trust-Region Algorithm for Mathematical Programs with Linear Complementarity Constraints
    18 Search a Feasible Point of Polyhedral Set
    19 Efficient Fast Algorithms for Some Nonlinearly Constrained Minimization Arising from Linear Inverse Problems
帮助中心
公司简介
联系我们
常见问题
新手上路
发票制度
积分说明
购物指南
配送方式
配送时间及费用
配送查询说明
配送范围
快递查询
售后服务
退换货说明
退换货流程
投诉或建议
版权声明
经营资质
营业执照
出版社经营许可证