Publication
Inertial Three-Operator Splitting Method and Applications
Abstract
We introduce an inertial variant of the forward-Douglas-Rachford splitting and analyze its convergence. We specify an instance of the proposed method to the three-composite convex minimization template. We provide practical guidance on the selection of the inertial parameter based on the adaptive starting idea. Finally, we illustrate the practical performance of our method in various machine learning applications.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related concepts (15)
Inertial navigation system
An inertial navigation system (INS) is a navigation device that uses motion sensors (accelerometers), rotation sensors (gyroscopes) and a computer to continuously calculate by dead reckoning the position, the orientation, and the velocity (direction and speed of movement) of a moving object without the need for external references. Often the inertial sensors are supplemented by a barometric altimeter and sometimes by magnetic sensors (magnetometers) and/or speed measuring devices.
Euler method
In mathematics and computational science, the Euler method (also called the forward Euler method) is a first-order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. It is the most basic explicit method for numerical integration of ordinary differential equations and is the simplest Runge–Kutta method. The Euler method is named after Leonhard Euler, who first proposed it in his book Institutionum calculi integralis (published 1768–1870).
Iterative method
In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate solutions for a class of problems, in which the n-th approximation is derived from the previous ones. A specific implementation with termination criteria for a given iterative method like gradient descent, hill climbing, Newton's method, or quasi-Newton methods like BFGS, is an algorithm of the iterative method.
Related publications (35)
Lidar point-to-point correspondences for rigorous registration of kinematic scanning in dynamic networks
Jan Skaloud, Davide Antonio Cucci, Aurélien Arnaud Brun
With the objective of improving the registration of lidar point clouds produced by kinematic scanning systems, we propose a novel trajectory adjustment procedure that leverages on the automated extraction of selected reliable 3D point–to–point corresponden ...
2022Synthesis of Kit-of-parts Structures for Reuse
Corentin Jean Dominique Fivet, Gennaro Senatore, Jan Friedrich Georg Brütting, Alex-Manuel Muresan, Ioannis Mirtsopoulos
This paper shows a computational workflow to design a kit of parts consisting of linear bars and spherical joints that can be employed to assemble, take apart, and rebuild diverse reticular structures, e.g. gridshells and space frames. Being able to reuse ...
2021Curable filler material for tubular structures
A radiopaque composition with low viscosity and increased photopolymerizability for application or filling of hollow structures is disclosed. Moreover, a method to apply and monitor the application and/or the photopolymerization of the composition are pres ...
2018Related MOOCs (1)