位置：成果数据库 > 期刊 > 期刊详情页
DISTURBED SPARSE LINEAR EQUATIONS OVER THE 0-1 FINITE FIELD
  • ISSN号：0254-9409
  • 期刊名称：《计算数学：英文版》
  • 时间：0
  • 分类：O24[理学—计算数学;理学—数学]
  • 作者机构：[1]LSEC, ICMSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China
  • 相关基金：This work is partially supported by Chinese NSF grant 10231060 and the CAS Knowledge Innovation Program.
作者： Ya-xiang Yuan Zhen-zhen Zheng[1]
关键词： 稀疏线性方程, 有限场, 交互方向法, 随机重启动, 遗传混合, Sparse linear equation, 0-1 finite field, Alternating direction method, Random restart, Genetic hybrids.
中文摘要：

在这篇论文，在有限的地被考虑的 0-1 上扰乱了稀少的线性方程。由于这个问题的特殊结构，标准轮流出现的并列方法能以产出一个快、有效的算法的如此的一个方法被实现。我们的轮流出现的并列算法使用系数矩阵的稀少和方程的当前的剩余。象随机的重启和基因转线路那样的一些混合技术也被使用改进我们的算法。

英文摘要：

In this paper, disturbed sparse linear equations over the 0-1 finite field are considered. Due to the special structure of the problem, the standard alternating coordinate method can be implemented in such a way to yield a fast and efficient algorithm. Our alternating coordinate algorithm makes use of the sparsity of the coefficient matrix and the current residuals of the equations. Some hybrid techniques such as random restarts and genetic crossovers are also applied to improve our algorithm.

同期刊论文项目
大规模优化算法，理论以及应用
期刊论文 89 会议论文 12 著作 3
同项目期刊论文
Linear systems associated with
A nonmonotone second order ste
Convergence properties of mult
A 3-approximation algorithm fo
Nonmonotone adaptive trust reg
An adaptive trust-region metho
An excluding algorithm for tes
Solving non-additive traffic a
An outcome-space finite algori
Optimal preemptive online sche
Theoretical and numerical comp
A branch and bound algorithm f
A Feasible Direction Algorithm
股指期货定价方法研究
Mean-variance portfolio optima
On maximizing the throughput?
Non-monotone trust region meth
A truly globally convergent fe
A practical penalty trust-regi
Properties of Hadamard Product
Some results on resource const
Convergence of an inexact smoo
A multiple penalty function me
A new linearization method for
A Subspace implementation of
An adaptive approach of conic
Nonmonotone descent algorithm
On the quadratic convergence o
Duality and Lagrange multiplie
A new two level linear relaxed
Conic Trust region method for
Mixed duality without a constr
A new modified Goldstein-Levit
New decomposition methods for
一个求解大规模优化的有限内存方
关于非负不可约矩阵的广义Perron
A proximal decomposition algor
A trust region method for solv
On-line scheduling with extend
Computing a Celis-Dennis-Tapia
A new stepsize for the steepes
A Class of globally convergent
Adaptive nonmonotone trust reg
Alternate minimization gradien
An effective continuous algori
A nonmonotone line search algo
The application of log barrier
An optimal self-scaling strate
A nonsmooth trust region algor
A simpler proof on global conv
H-Matrices and S-Doubly Diagon
Proximal point algorithm for m
Analysis of monotone gradient
Optimality and mixed duality f
Maximizing the total profit of
Optimality and duality without
Convergence and regularity of
Feasible SQP Descent Method for Inequality Constrained Optimization Problems and Its Convergence
一个自动确定信赖域半径的信赖域方法
二次指派问题的Gilmore-Lawler界的改进
求解二次半定规划的原对偶内点算法
一种新的二次插值模型算法
T-型树T(1,l,m)可由其谱唯一决定
不动点与稳定点存在性关系及判定定理
带有线搜索的新的非单调自适应信赖域算法
A NEW SQP-FILTER METHOD PROGRAMMING FOR SOLVING NONLINEAR PROBLEMS
基于稀疏主成分的股票指数追踪研究
优化矿井通风系统方案的灰色关联模型
LC^1无约束优化问题的非单调线搜索算法
ON THE SEPARABLE NONLINEAR LEAST SQUARES PROBLEMS
COMPUTE A CELIS-DENNIS-TAPIA STEP
VaR模型及其在上海股市中的应用
复合非光滑优化的一种非单调线搜索方法
AN OPTIMAL SELF-SCALING STRATEGY TO THE MODIFIED SYMMETRIC RANK ONE UPDATING
A NEW STEPSIZE FOR THE STEEPEST DESCENT METHOD
T-型树谱唯一性的一个简单刻画
CONVERGENCE PROPERTIES OF MULTI-DIRECTIONAL PARALLEL ALGORITHMS FOR UNCONSTRAINED MINIMIZATION
A FEASIBLE DIRECTION ALGORITHM WITHOUT LINE SEARCH FOR SOLVING MAX-BISECTION PROBLEMS
A Switching Algorithm Based on Modified Quasi-Newton Equation
AN ADAPTIVE NONMONOTONIC TRUST REGION METHOD WITH CURVILINEAR SEARCHES
一个解无约束优化问题的过滤信赖域方法
A NONMONOTONE SECOND-ORDER STEPLENGTH METHOD FOR UNCONSTRAINED MINIMIZATION
AN EFFECTIVE CONTINUOUS ALGORITHM FOR APPROXIMATE SOLUTIONS OF LARGE SCALE MAX-CUT PROBLEMS
Nonmonotone Adaptive Trust Region Algorithms with Indefinite Dogleg Path for Unconstrained Minimization
期刊信息
  • 《计算数学：英文版》
  • 主管单位:
  • 主办单位:中国科学院数学与系统科学研究院
  • 主编：
  • 地址：北京2719信箱
  • 邮编：100080
  • 邮箱：
  • 电话：
  • 国际标准刊号：ISSN：0254-9409
  • 国内统一刊号：ISSN：11-2126/O1
  • 邮发代号:
  • 获奖情况:
  • 中国期刊方阵“双效”期刊
  • 国内外数据库收录:
  • 美国数学评论（网络版）,德国数学文摘,荷兰文摘与引文数据库,美国科学引文索引（扩展库）,英国科学文摘数据库,日本日本科学技术振兴机构数据库
  • 被引量:193