FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
, 2006 We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.
A.I. Barvinok +17 more
core +2 more sources
The best uniform quadratic approximation of circular arcs with high accuracy
Open Mathematics, 2016 In this article, the issue of the best uniform approximation of circular arcs with parametrically defined polynomial curves is considered. The best uniform approximation of degree 2 to a circular arc is given in explicit form.
Rababah Abedallah
doaj +1 more source
$O(\log^2k/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm [PDF]
, 2018 In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes.
An +6 more
core +3 more sources
Chebyshev Polynomial Approximation for Distributed Signal Processing [PDF]
, 2011 Unions of graph Fourier multipliers are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators to the high-dimensional signals collected by ...
Frossard, Pascal +2 more
core +3 more sources
Piecewise Monotone Polynomial Approximation [PDF]
Transactions of the American Mathematical Society, 1972 Given a real function f satisfying a Lipschitz condition of order 1 on (a, b), there exists a sequence of approximating polynomials IP I such that the sequence En = |Pn - f| (sup norm) has order of magnitude I/n (D. Jackson). We investigate the possibility of selecting polynomials P having the same local n monotonicity as f without affecting the order ...
Newman, D. J. +2 more
openaire +1 more source
Integer Polynomial Optimization in Fixed Dimension
, 2004 We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed.
Barvinok A. I. +9 more
core +4 more sources
Approximation error estimates and inverse inequalities for B-splines of maximum smoothness
, 2015 In this paper, we develop approximation error estimates as well as corresponding inverse inequalities for B-splines of maximum smoothness, where both the function to be approximated and the approximation error are measured in standard Sobolev norms and ...
Takacs, Stefan, Takacs, Thomas
core +1 more source
Domain-of-Attraction Estimation for Uncertain Non-polynomial Systems
, 2013 In this paper, we consider the problem of computing estimates of the domain-of-attraction for non-polynomial systems. A polynomial approximation technique, based on multivariate polynomial interpolation and error analysis for remaining functions, is ...
Lin, Wang, Wu, Min, Yang, Zhengfeng
core +1 more source
Use of Symptomatic Drug Treatment for Fatigue in Multiple Sclerosis and Patterns of Work Loss
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To describe the use of central stimulants and amantadine for fatigue in MS and evaluate a potential association with reduced work loss in people with MS. Methods We conducted a nationwide, matched, register‐based cohort study in Sweden (2006 to 2023) using national registers with prospective data collection.
Simon Englund +3 more
wiley +1 more source
Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization [PDF]
, 2012 We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-linear minimization problem over the same feasible set. Our main result is
Magnanti, Thomas L., Stratila, Dan
core +1 more source