由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
Computation版 - karmarkar's paper
相关主题
about Gaussian elimination zz[转载] 会数值积分的请帮忙看一下
编写 network coding 仿真的一个问题 (转载)Re: 请问normal disctribution的cdf函数在FORTRAN
请问如何用fft算法计算卷积[转载] Question about Energy spectrum
请教一个Gaussian quadrature的问题请教一个数值计算问题
[转载] [Help]Gaussian问个matlab二重数值积分的问题
prove: deg(gcd(p,q))=nullity(sylvester(p,q))[转载] FFT里面的"码位倒置"用英文怎么说啊?
fft algorithm[转载] 有搞 神经网络算法的弟兄吗
[转载] 学数学的快来帮忙!!!FFT 变换问题Fourier question
相关话题的讨论汇总
话题: karmarkar话题: why话题: lp话题: paper话题: means
进入Computation版参与讨论
1 (共1页)
h***r
发帖数: 726
1
【 以下文字转载自 Mathematics 讨论区 】
发信人: haier (no nickname), 信区: Mathematics
标 题: karmarkar's paper
发信站: BBS 未名空间站 (Wed Mar 3 17:00:58 2010, 美东)
after the ellipsoid paper, Karmarkar developed the interior point method for
LP.
Does anyone understand why the canonical form, on the first page, is the
following? (WHY Z, not R?)
min x' x
s.t. Ax = 0
\sum xi = 1
x >= 0
x \in R^n, c \in Z^n, A \in Z^(mn)
x' means x transpose
R^n means R to the nth
So, Why c, A in Z, not R???
Thanks!
i******t
发帖数: 370
2
If A, c are in Z, FFT-based algorithms can be used to speed up matrix
multiplication. This makes the gaussian elimination step faster (see page 5)
. For FFT-based multiplication, check:
http://en.wikipedia.org/wiki/Sch%C3%B6nhage-Strassen_algorithm
You can ignore this if you are working with small numbers in A and c.

for

【在 h***r 的大作中提到】
: 【 以下文字转载自 Mathematics 讨论区 】
: 发信人: haier (no nickname), 信区: Mathematics
: 标 题: karmarkar's paper
: 发信站: BBS 未名空间站 (Wed Mar 3 17:00:58 2010, 美东)
: after the ellipsoid paper, Karmarkar developed the interior point method for
: LP.
: Does anyone understand why the canonical form, on the first page, is the
: following? (WHY Z, not R?)
: min x' x
: s.t. Ax = 0

h***r
发帖数: 726
3
谢谢萝卜的回答。
问题是,这样会不会失去generality?
In another word, if A c is in Z, can the cananical form still represent all
general LP problems?
Thanks again!

5)

【在 i******t 的大作中提到】
: If A, c are in Z, FFT-based algorithms can be used to speed up matrix
: multiplication. This makes the gaussian elimination step faster (see page 5)
: . For FFT-based multiplication, check:
: http://en.wikipedia.org/wiki/Sch%C3%B6nhage-Strassen_algorithm
: You can ignore this if you are working with small numbers in A and c.
:
: for

i******t
发帖数: 370
4
I mean for A, c in R (general LP), the algorithm is still the same. The only
difference is, when A, c in Z, you can do better in solving the linear
system (gaussian elimination).

all

【在 h***r 的大作中提到】
: 谢谢萝卜的回答。
: 问题是,这样会不会失去generality?
: In another word, if A c is in Z, can the cananical form still represent all
: general LP problems?
: Thanks again!
:
: 5)

1 (共1页)
进入Computation版参与讨论
相关主题
Fourier question[转载] [Help]Gaussian
[转载] 做FFT的陷阱prove: deg(gcd(p,q))=nullity(sylvester(p,q))
对矩阵求导fft algorithm
fortran的random number 相关的函数lib是啥?[转载] 学数学的快来帮忙!!!FFT 变换问题
about Gaussian elimination zz[转载] 会数值积分的请帮忙看一下
编写 network coding 仿真的一个问题 (转载)Re: 请问normal disctribution的cdf函数在FORTRAN
请问如何用fft算法计算卷积[转载] Question about Energy spectrum
请教一个Gaussian quadrature的问题请教一个数值计算问题
相关话题的讨论汇总
话题: karmarkar话题: why话题: lp话题: paper话题: means