Related papers: Order reductions of Lorentz-Dirac-like equations
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…
In this paper, we propose first-order feasible methods for difference-of-convex (DC) programs with smooth inequality and simple geometric constraints. Our strategy for maintaining feasibility of the iterates is based on a "retraction" idea…
Discrete mechanics is used to present fluid mechanics, fluid-structure interactions, electromagnetism and optical physics in a coherent theoretical and numerical approach. Acceleration considered as an absolute quantity is written as a sum…
In this paper we present a theory of reduction of quantum systems in the presence of symmetries and constraints. The language used is that of Lie--Jordan Banach algebras, which are discussed in some detail together with spectrum properties…
We develop a new Riemannian descent algorithm that relies on momentum to improve over existing first-order methods for geodesically convex optimization. In contrast, accelerated convergence rates proved in prior work have only been shown to…
The notion of singular reduction modules, i.e., of singular modules of nonclassical (conditional) symmetry, of differential equations is introduced. It is shown that the derivation of nonclassical symmetries for differential equations can…
This paper is devoted to the construction of order reduced method of fourth order problems. A framework is presented such that a problem on a high-regularity space can be deduced in a constructive way to an equivalent problem on three…
We examine the reductions of the order of certain third- and second-order nonlinear equations with arbitrary nonlinearity through their symmetries and some appropriate transformations. We use the folding transformation which enables one to…
Lorentz's group represented by the hypercomplex system of numbers, which is based on dirac matrices, is investigated. This representation is similar to the space rotation representation by quaternions. This representation has several…
Stochastic Gradient Descent (SGD) methods see many uses in optimization problems. Modifications to the algorithm, such as momentum-based SGD methods have been known to produce better results in certain cases. Much of this, however, is due…
The convergence rate of various first-order optimization algorithms is a pivotal concern within the numerical optimization community, as it directly reflects the efficiency of these algorithms across different optimization problems. Our…
We present a simple scheme for restarting first-order methods for convex optimization problems. Restarts are made based only on achieving specified decreases in objective values, the specified amounts being the same for all optimization…
In this paper we develop a systematic reduction procedure for determining intermediate integrals of second order hyperbolic equations so that exact solutions of the second order PDEs under interest can be obtained by solving first order…
We consider the numerical solution of large-scale symmetric differential matrix Riccati equations. Under certain hypotheses on the data, reduced order methods have recently arisen as a promising class of solution strategies, by forming…
Momentum methods play a significant role in optimization. Examples include Nesterov's accelerated gradient method and the conditional gradient algorithm. Several momentum methods are provably optimal under standard oracle models, and all…
Employing the ideas of non-linear preconditioning and testing of the classical proximal point method, we formalise common arguments in convergence rate and convergence proofs of optimisation methods to the verification of a simple…
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
In arXiv:2305.03945 [math.NA], a first-order optimization algorithm has been introduced to solve time-implicit schemes of reaction-diffusion equations. In this research, we conduct theoretical studies on this first-order algorithm equipped…
We discuss an elementary derivation of variational symmetries and corresponding integrals of motion for the Lagrangian systems depending on acceleration. Providing several examples, we make the manuscript accessible to a wide range of…
A recursive approach for shrinking coefficients of an atomic decomposition is proposed. The corresponding algorithm evolves so as to provide at each iteration a) the orthogonal projection of a signal onto a reduced subspace and b) the index…