Limit theory of restricted range approximations of complex-valued continuous functions

This paper is concerned with the problem of the best restricted range approximations of complex-valued continuous functions.Several properties for the approximating set(?)such that the classical characterization results and/or the uniqueness results of the best approximations hold are introduced.Under the very mild conditions,we prove that these properties are equivalent that(?)is a Haar subspce.     

Pairs of Dual Wavelet Frames from Any Two Refinable Functions

Starting from any two compactly supported refinable functions in L₂(R) with dilation factor d,we show that it is always possible to construct 2d wavelet functions with compact support such that they generate a pair of dual d-wavelet frames in L₂(R). Moreover, the number of vanishing moments of each of these wavelet frames is equal to the approximation order of the dual MRA; this is the highest possible. In particular, when we consider symmetric refinable functions, the constructed dual wavelets are also symmetric or antisymmetric. As a consequence, for any compactly supported refinable function in L₂(R), it is possible to construct, explicitly and easily, wavelets that are finite linear combinations of translates (d · – k), and that generate a wavelet frame with an arbitrarily preassigned number of vanishing moments.We illustrate the general theory by examples of such pairs of dual wavelet frames derived from B-spline functions.     

On isotone functions with the Substitution Property in distributive lattices

A universal algebra isaffine complete if all functions satisfying the Substitution Property are polynomials (composed of the basic operations and the elements of the algebra). In 1962, the first author proved that a bounded distributive lattice is affine complete if and only if it does not contain a proper Boolean interval. Recently, M. Ploica generalized this result to arbitrary distributive lattices.In this paper, we introduce a class of functions on a latticeL, we call themID-polynomials, that derive from polynomials on the ideal lattice (resp., dual ideal lattice) ofL; they are isotone functions and satisfy the Substitution Property. We prove that for a distributive latticeL, all unary functions with the Substitution Property are ID-polynomials if and only ifL contains no proper Boolean interval.The research of the first author was supported by the NSERC of Canada. The research of the second author was supported by the Hungarian National Foundation for Scientific Research, under Grant No. 1903.     

On Primitives and Conjugate Harmonic Pairs in Hermitian Clifford Analysis

The notion of a conjugate harmonic pair in the context of Hermitian Clifford analysis is introduced as a pair of specific harmonic functions summing up to a Hermitian monogenic function in an open region $\Omega $ of $\mathbb C ^n$ . Hermitian monogenic functions are special monogenic functions, which are at the core of so-called Clifford analyis, a straightforward generalization to higher dimension of the holomorphic functions in the complex plane. Under certain geometric conditions on $\Omega $ the conjugate harmonic to a given specific harmonic is explicitly constructed and the potential or primitive of a Hermitian monogenic function is determined.     

EP Theorem for Dual Linear Complementarity Problems

The linear complementarity problem (LCP) belongs to the class of -hard problems. Therefore, we cannot expect a polynomial time solution method for LCPs without requiring some special property of the matrix of the problem. We show that the dual LCP can be solved in polynomial time if the matrix is row sufficient; moreover, in this case, all feasible solutions are complementary. Furthermore, we present an existentially polytime (EP) theorem for the dual LCP with arbitrary matrix. The research of Tibor Illés and Marianna Nagy has been supported by the Hungarian National Research Fund OTKA T 049789 and by the Hungarian Science and Technology Foundation TéT SLO-4/2005. Tamàs Terlaky has been supported by an NSERC Discovery grant, MITACS and the Canada Research Chair program.     

Various notions of weak injectivity over Clifford semigroups

We study various notions of weak injectivity of acts over a Clifford semigroup. In addition we characterize weak self-injectivities of several classes of Clifford semigroups constructed via particular kinds of groups and group homomorphisms. Research of X. Zhang supported by the China Scholarship Council No. 2006101056. Research of Y. Wang supported by National Natural Science Foundation of China Research Grant 10571181.     

Inequalities for E k(X,Y) when the marginals are fixed

When k(x, y) is a quasi-monotone function and the random variables X and Y have fixed distributions, it is shown under some further mild conditions that k(X, Y) is a monotone functional of the joint distribution function of X and Y. Its infimum and supremum are both attained and correspond to explicitly described joint distribution functions.Research supported by the Air Force Office of Scientific Research under Grant AFOSR-75-2796Research supported by the National Science Foundation     

Hartogs Extension Theorem for Functions with Values in Complex Clifford Algebras

A regular extension phenomenon of functions defined on Euclidean space with values in a Clifford algebra was studied by Le Hung Son in the 90’s using methods of Clifford analysis, a function theory which, is centred around the notion of a monogenic function, i.e. a null solution of the firstorder, vector-valued Dirac operator in . The isotonic Clifford analysis is a refinement of the latter, which arises for even dimension. As such it also may be regarded as an elegant generalization to complex Clifford algebra-valued functions of both holomorphic functions of several complex variables and two-sided biregular function theories. The aim of this article is to present a Hartogs theorem on isotonic extendability of functions on a suitable domain of . As an application, the extension problem for holomorphic functions and so for the two-sided biregular ones is discussed.      

Hankel operators on the Bergman spaces of strongly pseudoconvex domains

We characterize functions fL ²(D) such that the Hankel operators H_f are, respectively, bounded and compact on the Bergman spaces of bounded strongly pseudoconvex domains.Research partially supported by a grant of the National Science Foundation.     

Fractal differential equations on the Sierpinski gasket

Let denote the symmetric Laplacian on the Sierpinski gasket SG defined by Kigami [11] as a renormalized limit of graph Laplacians on the sequence of pregaskets G_m whose limit is SG. We study the analogs of some of the classical partial differential equations with playing the role of the usual Laplacian. For harmonic functions, biharmonic functions, and Dirichlet eigenfunctions of , we give efficient algorithms to compute the solutions exactly, we display the results of implementing these algorithms, and we prove various properties of the solutions that are suggested by the data. Completing the work of Fukushima and Shima [8] who computed the Dirichlet eigenvalues and their multiplicities, we show how to construct a basis (but not orthonormal) for the eigenspaces, so that we have the analog of Fourier sine series on the unit interval. We also show that certain eigenfunctions have the property that they are a nonzero constant along certain lines contained in SG. For the analogs of the heat and wave equation, we give algorithms for approximating the solution, and display the results of implementing these algorithms. We give strong evidence that the analog of finite propagation for the wave equation does not hold because of inconsistent scaling behavior in space and time.Research supported in part by the National Science Foundation, Grant DMS-9623250.Research supported by the National Science Foundation through the Research Experiences for Undergraduates (REU) Program.     

The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming

We analyze the rate of local convergence of the augmented Lagrangian method in nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and variational analysis on the projection operator in the symmetric matrix space. Without requiring strict complementarity, we prove that, under the constraint nondegeneracy condition and the strong second order sufficient condition, the rate of convergence is linear and the ratio constant is proportional to 1/c, where c is the penalty parameter that exceeds a threshold . The research of Defeng Sun is partly supported by the Academic Research Fund from the National University of Singapore. The research of Jie Sun and Liwei Zhang is partly supported by Singapore–MIT Alliance and by Grants RP314000-042/057-112 of the National University of Singapore. The research of Liwei Zhang is also supported by the National Natural Science Foundation of China under project grant no. 10471015 and by the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry, China.     

Gelfand pair associated with a hoph algebra and a coideal

We consider a pair of a compact quantum group and a coideal in its dual Hopf *-algebra and introduce the notions of Gelfand pair and strict Gelfand pair. For a strict Gelfand pair, we construct two hyper-complex systems dual to each other. As an example, we consider the quantum analog of the pair (U(n), SO(n)).Published in Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 8, pp. 1055–1066, August, 1994.This research was partially supported by the Foundation for Fundamental Researches of the Ukrainian State Committee on Science and Technology (Project 1/238 Operator).     

On arrangements of Jordan arcs with three intersections per pair

Motivated by a number of motion-planning questions, we investigate in this paper some general topological and combinatorial properties of the boundary of the union ofn regions bounded by Jordan curves in the plane. We show that, under some fairly weak conditions, a simply connected surface can be constructed that exactly covers this union and whose boundary has combinatorial complexity that is nearly linear, even though the covered region can have quadratic complexity. In the case where our regions are delimited by Jordan acrs in the upper halfplane starting and ending on thex-axis such that any pair of arcs intersect in at most three points, we prove that the total number of subarcs that appear on the boundary of the union is only (n(n)), where(n) is the extremely slowly growing functional inverse of Ackermann's function.The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fourth and seventh authors has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation. The seventh author in addition wishes to acknowledge support by a research grant from the NCRD—the Israeli National Council for Research and Development. The fifth author would like to acknowledge support in part by NSF grant DMS-8501947. Finally, the eighth author was supported in part by a National Science Foundation Graduate Fellowship.     

Identifying an optimal basis in linear programming

We propose a sufficient condition that allows an optimal basis to be identified from a central path point in a linear programming problem. This condition can be applied when there is a gap in the sorted list of slack values. Unlike previously known conditions, this condition is valid for real-number data and does not involve the number of bits in the data.This work is supported in part by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF Grant DMS-8920550. Also supported in part by an NSF Presidential Young Investigator Award with matching funds received from AT&T and the Xerox Corporation. Part of this work was carried out while the author was visiting the Sandia National Laboratories, supported by the U.S. Department of Energy under Contract DE-AC04-76DP00789.The author is supported in part by NSF Grant DDM-9207347. Part of this work was carried out while the author was on a sabbatical leave from the University of Iowa and visiting the Cornell Theory Center, Cornell University, Ithaca, NY 14853, supported in part by the Cornell Center for Applied Mathematics and by the Advanced Computing Research Institute, a unit of the Cornell Theory Center, which receives major funding from the National Science Foundation and the IBM Corporation, with additional support from New York State and members of its Corporate Research Institute.     

Second order algorithms for the posynomial geometric programming dual,part I: Analysis

In this paper we analyse algorithms for the geometric dual of posynomial programming problems, that make explicit use of second order information. Out of two possible approaches to the problem, it is shown that one is almost always superior. Interestingly enough, it is the second, inferior approach that has dominated the geometric programming literature.This work was partially supported by the National Research Council of Canada, Grant A3552 and National Science Foundation Grant ENG78-21615.Earlier versions of this paper were presented at the Optimization Days Conference in Montreal (May 1976) and the TIMS meeting in Athens (July 1977).     

Geometry of the Gass-Saaty parametric cost LP algorithm

In previous discussions of the Gass-Saaty algorithm, the possibility of cycling is avoided by making strong nondegeneracy assumptions or by incorporating a lexicographic decision rule. By analyzing the geometric ideas on which the algorithm is based, it is shown here that even without any lexicography, cycling is impossible unless the two objective functions are related in a very special way to each other or to the constraints defining the feasible regionP. In particular, the avoidance of cycling does not require any restriction on the facial structure ofP or on the algebraic relationships among the linear equalities and inequalities by means of whichP is defined.Work on this paper by the first author was supported in part directly by the National Science Foundation, and in part by the Mathematical Sciences Research Institute and the Institute for Mathematics and Its Applications with funds provided by the National Science Foundation. Work by the second author was supported in part by the Alexander von Humboldt Stiftung.     

Quantitative stability of variational systems: III.ε-approximate solutions

We prove that the-optimal solutions of convex optimization problems are Lipschitz continuous with respect to data perturbations when these are measured in terms of the epi-distance. A similar property is obtained for the distance between the level sets of extended real valued functions. We also show that these properties imply that the-subgradient mapping is Lipschitz continuous.Research supported in part by the National Science Foundation and the Air Force Office of Scientific Research.     

Stochastic programming duality: ∞ multipliers for unbounded constraints with an application to mathematical finance

A new duality theory is developed for a class of stochastic programs in which the probability distribution is not necessarily discrete. This provides a new framework for problems which are not necessarily bounded, are not required to have relatively complete recourse, and do not satisfy the typical Slater condition of strict feasibility. These problems instead satisfy a different constraint qualification called direction-free feasibility to deal with possibly unbounded constraint sets, and calmness of a certain finite-dimensional value function to serve as a weaker condition than strict feasibility to obtain the existence of dual multipliers. In this way, strong duality results are established in which the dual variables are finite-dimensional, despite the possible infinite-dimensional character of the second-stage constraints. From this, infinite-dimensional dual problems are obtained in the space of essentially bounded functions. It is then shown how this framework could be used to obtain duality results in the setting of mathematical finance. Mathematics Subject Classification (2000): 46N10, 49N15, 65K10, 90C15, 90C46Research supported in part by a grant of the National Science Foundation.Received: 9, May 2001     

Wavelets and Bidemocratic Pairs in Weighted Norm Spaces

A complete characterization of weight functions for which the higher-rank Haar wavelets are greedy bases in weighted L^p spaces is given. The proof uses the new concept of a bidemocratic pair for a Banach space and also pairs (Φ, Φ), where Φ is an orthonormal system of bounded functions in the spaces L^p, p≠2.     

On the convergence of the exponential multiplier method for convex programming

In this paper, we analyze the exponential method of multipliers for convex constrained minimization problems, which operates like the usual Augmented Lagrangian method, except that it uses an exponential penalty function in place of the usual quadratic. We also analyze a dual counterpart, the entropy minimization algorithm, which operates like the proximal minimization algorithm, except that it uses a logarithmic/entropy proximal term in place of a quadratic. We strengthen substantially the available convergence results for these methods, and we derive the convergence rate of these methods when applied to linear programs.Research supported by the National Science Foundation under Grant DDM-8903385, and the Army Research Office under Grant DAAL03-86-K-0171.