Related papers: Lazard-style CAD and Equational Constraints
In numerical relativity simulations with non-trivial matter configurations, one must solve the Hamiltonian and momentum constraints of the ADM formulation for the metric variables in the initial data. We introduce a new scheme based on the…
Controlled Lagrangian and matching techniques are developed for the stabilization of relative equilibria and equilibria of discrete mechanical systems with symmetry as well as broken symmetry. Interesting new phenomena arise in the…
We consider the minimization problem with the truncated quadratic regularization with gradient operator, which is a nonsmooth and nonconvex problem. We cooperated the classical preconditioned iterations for linear equations into the…
We explore how the analysis of the Carleman linearization can be extended to dynamical systems on infinite-dimensional Hilbert spaces with quadratic nonlinearities. We demonstrate the well-posedness and convergence of the truncated Carleman…
We present a novel enhanced cyclic coordinate descent (ECCD) framework for solving generalized linear models with elastic net constraints that reduces training time in comparison to existing state-of-the-art methods. We redesign the CD…
This paper addresses some fundamental issues in nonconvex analysis. By using pure complementary energy principle proposed by the author, a class of fully nonlinear partial diforerential equations in nonlinear elasticity is able to converted…
We consider Monte-Carlo discretizations of partial differential equations based on a combination of semi-lagrangian schemes and probabilistic representations of the solutions. We study the Monte-Carlo error in a simple case, and show that…
We introduce a method for solving Calder\'on type inverse problems for semilinear equations with power type nonlinearities. The method is based on higher order linearizations, and it allows one to solve inverse problems for certain…
Complementary Labels Learning (CLL) arises in many real-world tasks such as private questions classification and online learning, which aims to alleviate the annotation cost compared with standard supervised learning. Unfortunately, most…
Speculative decoding (SD), where a draft model provides multiple candidate tokens for the target model to verify in parallel, has demonstrated significant potential for accelerating LLM inference. Yet, existing SD approaches adhere to a…
We introduce a primal-dual framework for solving linearly constrained nonconvex composite optimization problems. Our approach is based on a newly developed Lagrangian, which incorporates \emph{false penalty} and dual smoothing terms. This…
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…
We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping…
A rapidly growing area of research is the use of machine learning approaches such as autoencoders for dimensionality reduction of data and models in scientific applications. We show that the canonical formulation of autoencoders suffers…
In this paper, we present new obstructions to the existence of Lagrangian cobordisms in $\mathbb{R}^4$ that depend only on the enriched knot diagrams of the boundary knots or links, using holomorphic curve techniques. We define enriched…
The inverse problem of the calculus of variations consists in determining if the solutions of a given system of second order differential equations correspond with the solutions of the Euler-Lagrange equations for some regular Lagrangian.…
The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained…
The Calder\'on problem consists in recovering an unknown coefficient of a partial differential equation from boundary measurements of its solution. These measurements give rise to a highly nonlinear forward operator. As a consequence, the…
In this paper, we study a class of convex composite optimization problems. We begin by characterizing the equivalence between the primal/dual strong second-order sufficient condition and the dual/primal nondegeneracy condition. Building on…
This paper proposes novel computational multiscale methods for linear second-order elliptic partial differential equations in nondivergence-form with heterogeneous coefficients satisfying a Cordes condition. The construction follows the…