Accelerated ADMM based on Accelerated Douglas-Rachford Splitting
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Many applied problems, like transport processes in porous media or ferromagnetism in composite materials, can be modeled by partial differential equations (PDEs) with heterogeneous coefficients that rapidly vary at small scales. To capture the effective be ...
Multiscale differential equations arise in the modeling of many important problems in the science and engineering. Numerical solvers for such problems have been extensively studied in the deterministic case. Here, we discuss numerical methods for (mean-squ ...
This paper investigates the particular problem of matrices appearing during the modeling of Integrated Circuits with Finite Integration Technique (FIT) method. We present the key points of FIT approach followed by an illustration of the structure and the p ...
Among the efficient numerical methods based on atomistic models, the quasi-continuum (QC) method has attracted growing interest in recent years. The QC method was first developed for crystalline materials with Bravais lattice and was later extended to mult ...
In this Note we prove that in two and three space dimensions, the symmetric and non-symmetric discontinuous Galerkin method for second order elliptic problems is stable when using piecewise linear elements enriched with quadratic bubbles without any penali ...
The numerical analysis of a dynamic constrained optimization problem is presented. It consists of a global minimization problem that is coupled with a system of ordinary differential equations. The activation and the deactivation of inequality constraints ...
This paper examines the computational complexity certification of the fast gradient method for the solution of the dual of a parametric con- vex program. To this end, a lower iteration bound is derived such that for all parameters from a compact set a solu ...
Contour parallel tool paths are among the most widely used tool paths for planer milling operations. A number of exact as well as approximate methods are available for offsetting a closed boundary in order to generate a contour parallel tool path; however, ...
This paper proposes to use Nesterov's fast gradient method for the solution of linear quadratic model predictive control (MPC) problems with input constraints. The main focus is on the method's a priori computational complexity certification which consists ...
Institute of Electrical and Electronics Engineers2012
This paper proposes a smoothing technique for nonsmooth convex minimization using self-concordant barriers. To illustrate the main ideas, we compare our technique and the proximity smoothing approach (Nesterov2005) via the classical gradient method on both ...
