Related papers: Matrix bordering structure of the Faddeev-Jackiw a…
The implementation of discontinuous Galerkin finite element methods (DGFEMs) represents a very challenging computational task, particularly for systems of coupled nonlinear PDEs, including multiphysics problems, whose parameters may consist…
This paper examines the nonconvex quadratically constrained quadratic programming (QCQP) problems using an iterative method. One of the existing approaches for solving nonconvex QCQP problems relaxes the rank one constraint on the unknown…
We investigate the asymptotic behavior of perfect matchings on rail-yard graphs with doubly free boundary conditions and Jack weights. While a special case of this model reduces to the half space Macdonald process with Jack weights…
Convergence guarantees for optimization over bounded-rank matrices are delicate to obtain because the feasible set is a non-smooth and non-convex algebraic variety. Existing techniques include projected gradient descent, fixed-rank…
Bounded model finding is a key technique for validating software designs, usually obtained by translating high-level specifications into SAT/SMT problems. Although effective, such translations introduce a semantic gap and a dependency on…
We develop the approach of Felix Buot to construction of Wigner-Weyl calculus for the lattice models. We apply this approach to the tight-binding models with finite number of lattice cells. For simplicity we restrict ourselves to the case…
Infinite-dimensional Newton methods can be effectively used to derive numerical proofs of the existence of solutions to partial differential equations (PDEs). In computer-assisted proofs of PDEs, the original problem is transformed into the…
The Jackiw-Teitelboim model written as a BF theory in two dimensions is analyzed by using the Dirac's and Faddeev-Jackiw formalism. The analysis consists in finding the full structure of the constraints, the gauge transformations, the…
We study mathematical programs with switching constraints (MPSC)from the topological perspective. Two basic theorems from Morse theory are proved. Outside the W-stationary point set, continuous defor-mation of lower level sets can be…
Algebraic Phase Theory (APT) exhibits a marked structural selectivity. In certain mathematical and physical settings it gives rise to rigidity phenomena, constrained representation behaviour, and reductions in apparent degrees of freedom,…
We begin by addressing the time-domain full-waveform inversion using the adjoint method. Next, we derive the scaled boundary semi-weak form of the scalar wave equation in heterogeneous media through the Galerkin method. Unlike conventional…
We construct new Yang-Baxter integrable boundary conditions in the lattice approach to the logarithmic minimal model WLM(1,p) giving rise to reducible yet indecomposable representations of rank 1 in the continuum scaling limit. We interpret…
Replacing vector type of interaction of the Thirring-Wess model by the chiral type a new model is presented which is termed here as chiral Thirring-Wess model. Ambiguity parameters of regularization is so chosen that the model falls into…
For some typical and widely used non-convex half-quadratic regularization models and the Ambrosio-Tortorelli approximate Mumford-Shah model, based on the Kurdyka-\L ojasiewicz analysis and the recent nonconvex proximal algorithms, we…
In a recent work, we presented the reduced Jacobian method (RJM) as an extension of Wolfe's reduced gradient method to multicriteria (multiobjective) optimization problems dealing with linear constraints. This approach reveals that using a…
We present new convergence estimates for the iterated penalty method applied to structure-preserving discretizations of linear generalized saddle point systems. The method may be viewed as an Uzawa iteration on an augmented Lagrangian…
This work is concerned with the iterative solution of systems of quasi-static multiple-network poroelasticity (MPET) equations describing flow in elastic porous media that is permeated by single or multiple fluid networks. Here, the focus…
Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume…
To efficiently solve large scale nonlinear systems, we propose a novel Random Greedy Fast Block Kaczmarz method. This approach integrates the strengths of random and greedy strategies while avoiding the computationally expensive…
It has long remained open whether smoothing Newton methods (SNMs) for symmetric cone programming (SCP) admit polynomial iteration complexity. A key difficulty lies in the lack of an analogue of the self-concordant convex framework…