Related papers: Limited-memory BFGS Systems with Diagonal Updates
In the paper, a newly developed three-point fourth-order compact operator is utilized to construct an efficient compact finite difference scheme for the Benjamin-Bona-Mahony-Burgers' (BBMB) equation. Detailed derivation is carried out based…
Table structure recognition is a challenging task due to the various structures and complicated cell spanning relations. Previous methods handled the problem starting from elements in different granularities (rows/columns, text regions),…
The Bregman proximal gradient method (BPGM), which uses the Bregman distance as a proximity measure in the iterative scheme, has recently been re-developed for minimizing convex composite problems without the global Lipschitz gradient…
Mathematical models for flow and reactive transport in porous media often involve non-linear, degenerate parabolic equations. Their solutions have low regularity, and therefore lower order schemes are used for the numerical approximation.…
In the context of sparse recovery, it is known that most of existing regularizers such as $\ell_1$ suffer from some bias incurred by some leading entries (in magnitude) of the associated vector. To neutralize this bias, we propose a class…
We consider the augmented Lagrangian method (ALM) as a solver for the fused lasso signal approximator (FLSA) problem. The ALM is a dual method in which squares of the constraint functions are added as penalties to the Lagrangian. In order…
We consider the solution of systems of linear algebraic equations (SLAEs) with an ill-conditioned or degenerate exact matrix and an approximate right-hand side. An approach to solving such a problem is proposed and justified, which makes it…
A bi-Hamiltonian formulation is proposed for triangular systems resulted by perturbations around solutions, from which infinitely many symmetries and conserved functionals of triangular systems can be explicitly constructed, provided that…
We introduce a novel approach addressing global analysis of a difficult class of nonconvex-nonsmooth optimization problems within the important framework of Lagrangian-based methods. This genuine nonlinear class captures many problems in…
We present upgraded theoretical predictions for inclusive and exclusive radiative decays of {\it B} mesons. Our results include those next-to-leading order corrections that have already been computed. Our best estimates in the Standard…
We study the linear filtering problem for systems driven by continuous Gaussian processes with memory described by two parameters. The driving processes have the virtue that they possess stationary increments and simple semimartingale…
In this article explicit formulas for the recurrence equation p_{n+1}(x) = (A_n x + B_n) p_n(x) - C_n p_{n-1}(x) and the derivative rules sigma(x) p'_n(x) = alpha_n p_{n+1}(x) + beta_n p_n(x) + gamma_n p_{n-1}(x) and sigma(x) p'_n(x) =…
Consider the problem of minimizing the sum of a smooth convex function and a separable nonsmooth convex function subject to linear coupling constraints. Problems of this form arise in many contemporary applications including signal…
Given a zero-dimensional ideal I in K[x1,...,xn] of degree D, the transformation of the ordering of its Groebner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving…
Bilevel optimization, addressing challenges in hierarchical learning tasks, has gained significant interest in machine learning. The practical implementation of the gradient descent method to bilevel optimization encounters computational…
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly…
This paper concerns the reconstruction of a complex-valued anisotropic tensor $\gamma=\sigma+\i\omega\varepsilon$ from knowledge of several internal magnetic fields $H$, where $H$ satisfies the anisotropic Maxwell system on a bounded domain…
We consider solving high-order semidefinite programming (SDP) relaxations of nonconvex polynomial optimization problems (POPs) that often admit degenerate rank-one optimal solutions. Instead of solving the SDP alone, we propose a new…
We observe that a system of irreducible, fiber-linear, first class constraints on T*M is equivalent to the definition of a foliation Lie algebroid over M. The BFV formulation of the constrained system is given by the Hamiltonian lift of the…
We provide a variable metric stochastic approximation theory. In doing so, we provide a convergence theory for a large class of online variable metric methods including the recently introduced online versions of the BFGS algorithm and its…