Publications related to Minimum distance between pattern transformation manifolds: Algorithm and Applications

Implications of ANEC for SCFTs in four dimensions

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 ...

SPRINGER2020

Maximum-likelihood estimation of kinetic parameters via the extent-based incremental approach

Dominique Bonvin, Julien Léo Billeter, Diogo Filipe Mateus Rodrigues

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 ...

PERGAMON-ELSEVIER SCIENCE LTD2019

Stochastic Frank-Wolfe for Composite Convex Minimization

Volkan Cevher, Alp Yurtsever

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 ...

2019

Sampling can be faster than optimization

Nicolas Henri Bernard Flammarion

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 ...

PNAS2019

Analysis of output modifier adaptation for real-time optimization

Dominique Bonvin, Alejandro Gabriel Marchetti

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 ...

PERGAMON-ELSEVIER SCIENCE LTD2019

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Nicolas Henri Bernard Flammarion

We consider minimizing a nonconvex, smooth function

f

on a Riemannian manifold

\mathcal{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 ...

2019

Distribution Network Restoration in a Multiagent Framework Using a Convex OPF Model

Hossein Sekhavatmanesh

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 ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Configuration Spaces Of Products

Kathryn Hess Bellwald

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 ...

2019

On two isomorphic Lie algebroids for Feedback Linearization

Philippe Müllhaupt

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 ...

2019

On two isomorphic Lie algebroids associated with feedback linearization

Philippe Müllhaupt

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 ...

ELSEVIER2019

Minimum distance between pattern transformation manifolds: Algorithm and Applications

Graph Chatbot

Chat with Graph Search

Implications of ANEC for SCFTs in four dimensions

Maximum-likelihood estimation of kinetic parameters via the extent-based incremental approach

Stochastic Frank-Wolfe for Composite Convex Minimization

Sampling can be faster than optimization

Analysis of output modifier adaptation for real-time optimization

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Distribution Network Restoration in a Multiagent Framework Using a Convex OPF Model

Configuration Spaces Of Products

On two isomorphic Lie algebroids for Feedback Linearization

On two isomorphic Lie algebroids associated with feedback linearization

Sampling can be faster than optimization

Maximum-likelihood estimation of kinetic parameters via the extent-based incremental approach

Distribution Network Restoration in a Multiagent Framework Using a Convex OPF Model

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Configuration Spaces Of Products

Stochastic Frank-Wolfe for Composite Convex Minimization

Analysis of output modifier adaptation for real-time optimization

On two isomorphic Lie algebroids for Feedback Linearization

Implications of ANEC for SCFTs in four dimensions

On two isomorphic Lie algebroids associated with feedback linearization