Publications related to Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

2018

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

ePrint2018

An FFT-based Numerical Method for Elasto-Plastic Contact

Jean-François Molinari, Guillaume Anciaux, Lucas Henri Galilée Frérot

Contact of rough surfaces is of prime importance in the study of friction and wear. Numerical simulations are well suited for this non-linear problem, but natural surfaces being fractal [1], they have high discretization requirements. There is therefore a ...

2018

A Data-driven Approach to Robust Control of Multivariable Systems by Convex Optimization

Alireza Karimi, Christoph Manuel Kammer

The frequency-domain data of a multivariable system in different operating points is used to design a robust controller with respect to the measurement noise and multimodel uncertainty. The controller is fully parametrized in terms of matrix polynomial fun ...

2017

A Data-Driven Approach to Power Converter Control via Convex Optimization

Alireza Karimi, Achille Nicoletti, Michele Martino

A new model reference data-driven approach is presented for synthesizing controllers for the CERN power converter control system. This method uses the frequency re- sponse function (FRF) of a system in order to avoid the problem of unmodeled dynamics assoc ...

2017

On Generalized Primal-Dual Interior-Point Methods with Non-uniform Complementarity Perturbations for Quadratic Programming

Colin Neil Jones, Altug Bitlislioglu

This technical note discusses convergence conditions of a generalized variant of primal-dual interior point methods. The generalization arises due to the permitted case of having a non-uniform complementarity perturbation vector, which is equivalent to hav ...

2017

Computation of a 768-Bit Prime Field Discrete Logarithm

Arjen Lenstra, Thorsten Kleinjung

This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly disc ...

Springer International Publishing Ag2017

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

Fast Robust PCA on Graphs

Pierre Vandergheynst, Gilles Puy, Nathanaël Perraudin, Nauman Shahid, Vasilis Kalofolias

Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-linear dimensionality reduction has played an important role to overcome the c ...

Ieee-Inst Electrical Electronics Engineers Inc2016

A Data-Driven Approach in Designing RST Controllers with H∞ Performance via Convex Optimization

Alireza Karimi, Achille Nicoletti, Zlatko Emedi

In this paper, a new method for designing robust fixed-order

\mathcal{H}_{\infty}

discrete-time controllers is presented. The controller structure is a two-degree of freedom polynomial controller of the

RST

type. A data-driven approach is implemented f ...

IEEE2015

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Graph Chatbot

Chat with Graph Search

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

An FFT-based Numerical Method for Elasto-Plastic Contact

A Data-driven Approach to Robust Control of Multivariable Systems by Convex Optimization

A Data-Driven Approach to Power Converter Control via Convex Optimization

On Generalized Primal-Dual Interior-Point Methods with Non-uniform Complementarity Perturbations for Quadratic Programming

Computation of a 768-Bit Prime Field Discrete Logarithm

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Fast Robust PCA on Graphs

A Data-Driven Approach in Designing RST Controllers with H∞ Performance via Convex Optimization

An FFT-based Numerical Method for Elasto-Plastic Contact

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Fast Robust PCA on Graphs

On Generalized Primal-Dual Interior-Point Methods with Non-uniform Complementarity Perturbations for Quadratic Programming

A Data-Driven Approach to Power Converter Control via Convex Optimization

A Data-Driven Approach in Designing RST Controllers with H∞ Performance via Convex Optimization

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Computation of a 768-Bit Prime Field Discrete Logarithm

A Data-driven Approach to Robust Control of Multivariable Systems by Convex Optimization