搜索结果: 1-11 共查到“计算数学 Programming”相关记录11条 . 查询时间(0.031 秒)
Generalized Chebyshev bounds via semidefinite programming
Quadratic inequality convex optimization computation single variable and random variable chebyshev inequality
font style='font-size:12px;'>
2015/8/10
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first two moments of the distribution, can be efficiently computed using convex optimization. This result g...
Solving the Interval-Valued Linear Fractional Programming Problem
Interval-Valued Function Linear Fractional Programming Interval-Valued Linear Fractional Programming
font style='font-size:12px;'>
2013/1/30
This paper introduces an interval valued linear fractional programming problem (IVLFP). An IVLFP is a linear fractional programming problem with interval coefficients in the objective function. It is ...
Linear Index Coding via Semidefinite Programming
Linear Index Coding Semidefinite Programming Data Structures and Algorithms
font style='font-size:12px;'>
2011/9/30
Abstract: In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side informati...
An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels
Iterative Joint Linear-Programming Decoding of LDPC Codes Finite-State Channels
font style='font-size:12px;'>
2010/12/10
In this paper, we introduce an efficient method for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the a...
Dynamic programming based algorithms for set multicover and multiset
Set multicover Multiset multicover Inclusionexclusion Dynamic programming Algorithm
font style='font-size:12px;'>
2012/11/30
Given a universe N containing n elements and a collection of multisets or sets over N, the multiset multicover (MSMC) problem or the set multicover (SMC) problem is to cover all elements at least a nu...
EXPECTED NUMBER OF ITERATIONS OF INTERIOR-POINT ALGORITHMS FOR LINEAR PROGRAMMING
font style='font-size:12px;'>
2007/12/12
We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the expected and anticipated number of iterations of these algorith...
A NEW FILLED FUNCTION METHOD FOR INTEGER PROGRAMMING
font style='font-size:12px;'>
2007/12/12
The Filled Function Method is a class of effective algorithms for
continuous global optimization. In this paper, a new filled
function method is introduced and used to solve integer
programming. Fi...
PREDICTOR-CORRECTOR ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING WITH UPPER BOUNDS
font style='font-size:12px;'>
2007/12/11
Predictor-corrector algorithm for linear programming, proposed by
Mizuno et al.$^{[1]}$, becomes the best well known in the interior point
methods.
The purpose of this paper is to extend these resu...
Mathematical Methods of Programming Group
Mathematica 数学 computing 计算
font style='font-size:12px;'>
2007/12/19
The Mathematical Methods of Programming Group research concentrates on the mathematical foundations of computing. The techniques used include: logics, category theory, logics and theory of institution...
An Interior-point Trust-region Polynomial Algorithm for Convex Programming
interior-point algorithm self-concordant barrier trust-region subproblem
font style='font-size:12px;'>
2012/8/1
An interior-point trust-region algorithm is proposed for minimization of a convex quadratic objective function over a general convex set. The algorithm uses a trust-region model to ensure descent on a...
An Interior-point Trust Region Algorithm for General Symmetric Cone Programming
interior-point algorithm trust-region subproblem symmetric cone
font style='font-size:12px;'>
2012/8/1
An interior-point trust-region algorithm is proposed for minimization of general (perhaps, non-convex) quadratic objective function over the domain obtained as the intersection of a symmetric cone wit...