Haut PDF Some approximation schemes in polynomial optimization
Some approximation schemes in polynomial optimization
... example in [Wyn70] and ...developed in [MYZ15]. In the latter paper, the construction of an optimal design is performed in two ...steps. In the first step one only deals with an ...
107
Approximating min-max (regret) versions of some polynomial problems
... regret, approximation, fptas, shortest path, min- imum spanning ...combinatorial optimization problem requires to specify parameters, in particular objective function coefficients, which may be ...
10
On inhomogeneous diophantine approximation with some quasi-periodic expressions, II
... M(e’/-’, 1/2) = 1/8 and M(eI/8, 1/3) =0if~=2 (mod 3); 1/18 otherwise. Then, what is the condition such that ,Jt~l (9, ~) - 0 holds? It seems that a non-constant polynomial in a quasi-periodic part ...
15
Exponential approximation schemata for some network design problems
... obtained in [2] where the Hamiltonian cycle problem is solved in O ∗ ...with polynomial space, the best running time known so far for traveling salesman problem is O ∗ (4 n n log n ) reached by the ...
12
Sparse polynomial approximation of parametric elliptic PDEs Part II: lognormal coefficients *
... for some β > 1 2 , which still represents an improvement over the condition in ...representations, in terms of the resulting summability properties of (ku ν k V ) ν∈F ...
29
Cone-Copositive Lyapunov Functions for Complementarity Systems: Converse Result and Polynomial Approximation
... answered in the affirmative for exponentially stable systems. Some refinements of this result, under certain conditions on the vector field in the system dynamics, allow us to restrict our search for ...
26
Approximation algorithms for some vehicle routing problems
... a k+1 k − ε standard approximation for Min-Max b n k cTSP(1,2) could decide (k − 4)PP in polynomial time. 6 Min-Sum EkTSP Bellmore and Hong [3] showed that when the constraint p = k is replaced by p ...
22
An overview on polynomial approximation of NP-hard problems
... a polynomial time algorithm could ever be devised for optimally solving NP-hard problems, strongly motivates both researchers and practitioners in trying to heuristically solving such problems, by making a ...
35
On some difficulties with a posterior probability approximation technique
... differ in their expressions, they fundamentally relate to the same notion that parameters from other models can be ignored when conditioning on the model index M ...the schemes both of Carlin and Chib ...
10
Numerical approximation of BSDEs using local polynomial drivers and branching processes
... Keywords: Bsde, Monte-Carlo methods, branching process. MSC2010: Primary 65C05, 60J60; Secondary 60J85, 60H35. 1 Introduction Since the seminal paper of Pardoux and Peng [22], the theory of Backward Stochastic ...
35
Numerical approximation of parabolic problems by means of residual distribution schemes
... numerical approximation of (1) has already been considered by sev- eral ...of schemes has originally been devised for (steady) transport problems, based on a genuinely multidimensional upwind ...[21]. ...
26
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
... is in fact also valid for average dense ...a polynomial time algorithm with the first sublinear approximation ratio O(n/logn) was designed for the general problem in ...improvement in ...
20
The 2013 Newton Institute Programme on polynomial optimization
... give some new bounding procedures for a rather gen- eral graph partitioning problem, and show that the resulting bounds dominate previous known ones, yet remain tractable in ...known polynomial-time ...
4
Algebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis
... done in Section ...an approximation scheme for the JSR (Theorem 5.4). In Section ...5.3.2). In Section ...5.12). In Section 5.5, we study in more depth the approximation ...
156
Towards a general formal framework for polynomial approximation
... 2.2 Some other NPO problems ...new approximation framework 7 5 Approximation hains: a generalization of the approximation algorithms 7 6 Approximation level 7 7 Convergen
e and hardness ...
41
Polynomial approximation and graph-coloring
... devised in [24 ...seen in se
tion 13 and approximately solves k SC in this instan
e. In [24 ℄, k = 6 ...proposed in
ludes three ...6-sets in the initial 6SC-instan
e (S, C) ...
41
ALGORITHMS FOR POSITIVE POLYNOMIAL APPROXIMATION
... the polynomial interpolant p n ∈ P n defined by p n (x i ) = f (x i ) for all 0 ≤ i ≤ n satisfies p n ∈ P n + ...central in applications and scientific ...reflects some of our own interests is: [1, ...
28
Phase-field approximation for some branched transportation problems
... stated in the introduction of this thesis, this fact is essential when approximating the Mumford - Shah functional as in the limit energy one aims at recovering the length of the jump set of some BV ...
166
Border Basis for Polynomial System Solving and Optimization
... after a finite number of relaxations. The SDP solver used in this computation is mosek . The table records the number of variables (v), the number of inequality and equality constraints (c), the maximum degree of ...
9
Review and Analysis of some Metamodeling Techniques used in Optimization
... the in- formation obtained allows to reprodu
e the behaviour of this fun
..., some authors propose to onstru
t a lo
al metamodel, with only few observation points arround the desired ...data in the ...
21
