149 research outputs found
Optimization via Chebyshev Polynomials
This paper presents for the first time a robust exact line-search method
based on a full pseudospectral (PS) numerical scheme employing orthogonal
polynomials. The proposed method takes on an adaptive search procedure and
combines the superior accuracy of Chebyshev PS approximations with the
high-order approximations obtained through Chebyshev PS differentiation
matrices (CPSDMs). In addition, the method exhibits quadratic convergence rate
by enforcing an adaptive Newton search iterative scheme. A rigorous error
analysis of the proposed method is presented along with a detailed set of
pseudocodes for the established computational algorithms. Several numerical
experiments are conducted on one- and multi-dimensional optimization test
problems to illustrate the advantages of the proposed strategy.Comment: 26 pages, 6 figures, 2 table
Stable Border Bases for Ideals of Points
Let be a set of points whose coordinates are known with limited accuracy;
our aim is to give a characterization of the vanishing ideal independent
of the data uncertainty. We present a method to compute a polynomial basis
of which exhibits structural stability, that is, if is
any set of points differing only slightly from , there exists a polynomial
set structurally similar to , which is a basis of the
perturbed ideal .Comment: This is an update version of "Notes on stable Border Bases" and it is
submitted to JSC. 16 pages, 0 figure
On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
We consider the set Sigma(R,C) of all mxn matrices having 0-1 entries and
prescribed row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n). We
prove an asymptotic estimate for the cardinality |Sigma(R, C)| via the solution
to a convex optimization problem. We show that if Sigma(R, C) is sufficiently
large, then a random matrix D in Sigma(R, C) sampled from the uniform
probability measure in Sigma(R,C) with high probability is close to a
particular matrix Z=Z(R,C) that maximizes the sum of entropies of entries among
all matrices with row sums R, column sums C and entries between 0 and 1.
Similar results are obtained for 0-1 matrices with prescribed row and column
sums and assigned zeros in some positions.Comment: 26 pages, proofs simplified, results strengthene
Stable Complete Intersections
A complete intersection of n polynomials in n indeterminates has only a
finite number of zeros. In this paper we address the following question: how do
the zeros change when the coefficients of the polynomials are perturbed? In the
first part we show how to construct semi-algebraic sets in the parameter space
over which all the complete intersection ideals share the same number of
isolated real zeros. In the second part we show how to modify the complete
intersection and get a new one which generates the same ideal but whose real
zeros are more stable with respect to perturbations of the coefficients.Comment: 1 figur
- …