We revisit the problem of online linear optimization in case where set feasible actions is accessible through an approximated oracle with a factor α multiplicative approximation guarantee. This setting particular interesting because it captures natural extensions well-studied offline problems that are NP-hard yet admit efficient algorithms. The goal here to minimize α-regret, which extension th...

We describe nearly linear-time approximation algorithms for explicitly given mixed packing/covering and facility-location linear programs. The algorithms compute (1+ǫ)-approximate solutions in time O(N log(N)/ǫ), where N is the number of non-zeros in the constraint matrix. We also describe parallel variants taking time O(polylog /ǫ) and requiring only near-linear total work, O(N polylog /ǫ). Th...

In this paper, author proves the algorithms for the existence as well as the approximation of solutions to a couple of periodic boundary value problems of nonlinear first order ordinary integro-differential equations using operator theoretic techniques in a partially ordered metric space. The main results rely on the Dhage iteration method embodied in the recent hybrid fixed point theorems of D...

Here we present a center-cut algorithm for convex mixed-integer nonlinear programming (MINLP) that can either be used as a primal heuristic or as a deterministic solution technique. Like many other algorithms for convex MINLP, the center-cut algorithm constructs a linear approximation of the original problem. The main idea of the algorithm is to use the linear approximation differently in order...

A low-power quadrature direct digital frequency synthesizer (DDFS) is presented. Piecewise linear approximation is used to avoid using a ROM look-up table to store the sine values in a conventional DDFS. Significant saving in power consumption, due to the elimination of the ROM, renders the design more suitable for portable wireless communication applications. To demonstrate the proposed techni...

in this paper, a numerical solution for a system of linear fredholm integro-differential equations by means of the sinc method is considered. this approximation reduces the system of integro-differential equations to an explicit system of algebraic equations. the exponential convergence rate $o(e^{-k sqrt{n}})$ of the method is proved. the analytical results are illustrated with numerical examp...

n this paper, we consider continuity properties(especially, regularity, also viewed as an approximation property) for $%mathcal{p}_{0}(x)$-valued set multifunctions ($x$ being a linear,topological space), in order to obtain egoroff and lusin type theorems forset multifunctions in the vietoris hypertopology. some mathematicalapplications are established and several physical implications of thema...

this paper investigates the performances of artificial neural networks approximation, the translog and the fourier flexible functional forms for the cost function, when different production technologies are used. using simulated data bases, the author provides a comparison in terms of capability to reproduce input demands and in terms of the corresponding input elasticities of substitution esti...

Approximating integer linear programs by solving a relaxation to a linear program (LP) and afterwards reconstructing an integer solution from the fractional one is a standard technique in a non-distributed scenario. Surprisingly, the method has not often been applied for distributed algorithms. In this paper, we show that LP relaxation is a powerful technique also to obtain fast distributed app...