Publications related to Discrete-time regional pole-placement using convex approximations: Theory and application to a boost converter

AC OPF in radial distribution networks – Part I: On the limits of the branch flow convexification and the alternating direction method of multipliers

Jean-Yves Le Boudec, Mario Paolone, Dan-Cristian Tomozei, Konstantina Christakou

The optimal power-flow problem (OPF) has always played a key role in the planning and operation of power systems. Due to the non-linear nature of the AC power-flow equations, the OPF problem is known to be non-convex, therefore hard to solve. During the la ...

Elsevier2017

Decentralized and distributed robust control invariance for constrained linear systems

Giancarlo Ferrari Trecate

In this paper we propose an efficient procedure to compute time-varying Robust Control Invariant (RCI) sets for large-scale systems arising from the interconnection of M Linear Time-Invariant (LTI) constrained subsystems. In particular, the associated stat ...

IEEE2017

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Colin Neil Jones, Ye Pu, Melanie Nicole Zeilinger

In this technical note, the fast alternating minimization algorithm (FAMA) is proposed to solve model predictive control (MPC) problems with polytopic and second-order cone constraints. Two splitting strategies with efficient implementations for MPC proble ...

2017

Optical Tomography Based On A Nonlinear Model That Handles Multiple Scattering

Michaël Unser, Demetri Psaltis, Ulugbek Kamilov, Alexandre Goy, Joowon Lim

Learning Tomography (LT) is a nonlinear optimization algorithm for computationally imaging three-dimensional (3D) distribution of the refractive index in semi-transparent samples. Since the energy function in LT is generally non-convex, the solution it obt ...

Ieee2017

Non-convex, non-local functionals converging to the total variation

Hoài-Minh Nguyên

We present new results concerning the approximation of the total variation, integral(Omega)vertical bar del u vertical bar, of a function u by non-local, non-convex functionals of the form Lambda delta(u) = integral(Omega)integral(Omega)delta phi(vertical ...

Elsevier2017

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 Comment on “Computational Complexity of Stochastic Programming Problems”

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical justification by the seminal work of Dyer and Stougie (Mathematical Programming A, 106(3):423–432, 200 ...

Springer Heidelberg2016

Convex block-sparse linear regression with expanders - provably

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis, Luca Baldassarre, Bubacarr Bah

Sparse matrices are favorable objects in machine learning and optimization. When such matrices are used, in place of dense ones, the overall complexity requirements in optimization can be significantly reduced in practice, both in terms of space and run-ti ...

2016

Fixed-structure H-2 controller design for polytopic systems via LMIs

Alireza Karimi, Arash Sadeghzadeh

In this paper a new approach for fixed-structure H2 controller design in terms of solutions to a set of linear matrix inequalities are given. Both discrete- and continuous-time single-input single-output (SISO) time- invariant systems are considered. Then ...

Wiley-Blackwell2015

Discrete-time regional pole-placement using convex approximations: Theory and application to a boost converter

Graph Chatbot

Chat with Graph Search

AC OPF in radial distribution networks – Part I: On the limits of the branch flow convexification and the alternating direction method of multipliers

Decentralized and distributed robust control invariance for constrained linear systems

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Optical Tomography Based On A Nonlinear Model That Handles Multiple Scattering

Non-convex, non-local functionals converging to the total variation

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

Fast Robust PCA on Graphs

A Comment on “Computational Complexity of Stochastic Programming Problems”

Convex block-sparse linear regression with expanders - provably

Fixed-structure H-2 controller design for polytopic systems via LMIs

AC OPF in radial distribution networks – Part I: On the limits of the branch flow convexification and the alternating direction method of multipliers

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

Optical Tomography Based On A Nonlinear Model That Handles Multiple Scattering

Fast Robust PCA on Graphs

A Comment on “Computational Complexity of Stochastic Programming Problems”

Decentralized and distributed robust control invariance for constrained linear systems

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Convex block-sparse linear regression with expanders - provably

Fixed-structure H-2 controller design for polytopic systems via LMIs

Non-convex, non-local functionals converging to the total variation