Minimum distance between pattern transformation manifolds: Algorithm and Applications
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.
In the context of real-time optimization, modifier-adaptation schemes update the model-based optimization problem by adding first-order correction terms to the cost and constraint functions of the optimization problem. This guarantees meeting the plant fir ...
The ever-increasing requirement for reliability and quality of supply suggests to enable the self-healing features of modern distribution networks employing the intelligent measurement, communication, and control facilities of smart grids. In this paper, t ...
For lumped homogeneous reaction systems, this paper presents a kinetic model identification scheme that provides maximum-likelihood parameter estimates and guarantees convergence to global optimality. The use of the extent-based incremental approach allows ...
We explore consequences of the Averaged Null Energy Condition (ANEC) for scaling dimensions Delta of operators in four-dimensional N = 1 superconformal field theories. We show that in many cases the ANEC bounds are stronger than the corresponding unitarity ...
Optimization algorithms and Monte Carlo sampling algorithms have provided the computational foundations for the rapid growth in applications of statistical machine learning in recent years. There is, however, limited theoretical understanding of the relati ...
We show that the configuration spaces of a product of parallelizable manifolds may be recovered from those of the factors as the Boardman-Vogt tensor product of right modules over the operads of little cubes of the appropriate dimension. We also discuss an ...
Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system.\ The algorithmic construction of the linearizing output proceeds inductively, and each stage has two structures, name ...
A broad class of convex optimization problems can be formulated as a semidefinite program (SDP), minimization of a convex function over the positive-semidefinite cone subject to some affine constraints. The majority of classical SDP solvers are designed fo ...
We consider minimizing a nonconvex, smooth function f on a Riemannian manifold M. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle point ...
We present two Lie algebroids linked to the construction of the linearizing output of an input affine nonlinear system. The algorithmic development of the linearizing output proceeds inductively, and each stage has two structures, namely a codimension one ...
