Related papers: A CDCL-style calculus for solving non-linear const…
The numerical analysis for the small amplitude motion of an elastic beam with internal damping is investigated in domain with moving ends. An efficient numerical method is constructed to solve this moving boundary problem. The stability and…
Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various…
An iterative scheme for the Dynamical Systems Method (DSM) is given such that one does not have to solve the Cauchy problem occuring in the application of the DSM for solving ill-conditioned linear algebraic systems. The novelty of the…
This paper proposes new quadratic constraints (QCs) to bound a quadratic polynomial. Such QCs can be used in dissipation ineqaulities to analyze the stability and performance of nonlinear systems with quadratic vector fields. The proposed…
We present different techniques to numerically solve the equations of motion for the widely studied Discrete Nonlinear Schroedinger equation (DNLS). Being a Hamiltonian system, the DNLS requires symplectic routines for an efficient…
The CDCL algorithm is the leading solution adopted by state-of-the-art solvers for SAT, SMT, ASP, and others. Experiments show that the performance of CDCL solvers can be significantly boosted by embedding domain-specific heuristics,…
This paper is concerned with a class of nonhomogeneous quasilinear elliptic system driven by the locally symmetric potential and the small continuous perturbations in the whole-space $\mathbb{R}^N$. By a variant of Clark's theorem without…
In this work, we propose the joint use of a mixed penalty-interior point method and direct search, for addressing nonlinearly constrained derivative-free optimization problems. A merit function is considered, wherein the set of nonlinear…
In this paper, we propose two new methods for solving Set Constraint Problems, as well as a potential polynomial solution for NP-Complete problems using quantum computation. While current methods of solving Set Constraint Problems focus on…
We present a novel complex number formulation along with tight convex relaxations for the aircraft conflict resolution problem. Our approach combines both speed and heading control and provides global optimality guarantees despite…
In this paper, for solving large-scale nonlinear equations we propose a nonlinear sampling Kaczmarz-Motzkin (NSKM) method. Based on the local tangential cone condition and the Jensen's inequality, we prove convergence of our method with two…
We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…
In these notes, using the method of differential constraints, novel exact kink-like solutions are obtained for certain classes of complex Ginzburg--Landau equations with cubic-quintic nonlinearity. The foregoing solutions are presented in…
In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…
The objective of this manuscript is to enquire for the solvability of a specific type of non-linear quadratic integral equations via the interesting notion of measure of non-compactness. Firstly, we inquire into couple of exciting fixed…
In this work, the joint use of a mixed penalty-interior point method and direct search is proposed, to address {nonlinear} constrained derivative-free optimization problems. A merit function is considered, wherein the set of nonlinear…
Cylindrical algebraic decomposition (CAD) is a core algorithm within Symbolic Computation, particularly for quantifier elimination over the reals and polynomial systems solving more generally. It is now finding increased application as a…
Two effective methods for writing the dynamical equations for non-holonomic systems are illustrated. They are based on the two types of representation of the constraints: by parametric equations or by implicit equations. They can be applied…
A class of smoothing methods is proposed for solving mathematical programs with equimibrium constraints. We introduce new and very simple regularizations of the complementarity constraints. Some estimate distance to optimal solution and…