Jacobian matrix: a bridge between linear and nonlinear polynomial-only problems
By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple, efficient and accurate
Chen, W.
core
Convergence Analysis of the Fast Subspace Descent Methods for Convex Optimization Problems
The full approximation storage (FAS) scheme is a widely used multigrid method for nonlinear problems. In this paper, a new framework to design and analyze FAS-like schemes for convex optimization problems is developed.
Chen, Long, Hu, Xiaozhe, Wise, Steven M.
core
The regularized CQ algorithm without a priori knowledge of operator norm for solving the split feasibility problem. [PDF]
Tian M, Zhang HF.
europepmc +1 more source
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem. [PDF]
Tian M, Zhang HF.
europepmc +1 more source
Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces. [PDF]
Yu H, Wang F.
europepmc +1 more source
An optimal adaptive wavelet method for first order system least squares. [PDF]
Rekatsinas N, Stevenson R.
europepmc +1 more source
Weak convergence theorem for a class of split variational inequality problems and applications in a Hilbert space. [PDF]
Tian M, Jiang BN.
europepmc +1 more source
Runge-Kutta time semidiscretizations of semilinear PDEs with non-smooth data. [PDF]
Wulff C, Evans C.
europepmc +1 more source
N-stability of the theta-method for reaction-diffusion problems [PDF]
Faragó, István, Fekete, Imre
core +2 more sources
Hierarchical convergence of an implicit double-net algorithm for nonexpansive semigroups and variational inequality problems [PDF]
Yeol Je Cho +2 more
core +1 more source

