Abstract: The concave-convex procedure (CCCP) is an iterative algorithm that solves d.c. (difference of convex functions) programs as a sequence of convex programs. In machine learning, CCCP is ...
College of Science, Guilin University of Technology, Guilin, China. where (for a given positive integer) this sup is taken over all pairs of nonempty finite subsets such that dist. Obviously and ...
The notion of I-Convergence is a generalization of the concept statistical convergence which was first introduced by H. Fast [1] and later on studied by J. A. Fridy [2,3] from the sequence space point ...
Abstract: We analyse the adaptive finite-element approximation to solutions of partial differential equations in variational formulation. Assuming well-posedness of the continuous problem and ...
SIAM Journal on Applied Mathematics, Vol. 40, No. 3 (Jun., 1981), pp. 528-541 (14 pages) A convenient and useful method for showing weak convergence, to a diffusion, of the interpolated solutions of a ...
Proceedings of the American Mathematical Society, Vol. 102, No. 3 (Mar., 1988), pp. 473-479 (7 pages) We present criteria for irrationality of limits of convergent sequences of rational numbers, ...