Concept

Méthodes de points intérieurs

Publications associées (197)

Random extrapolation for primal-dual coordinate descent

We introduce a randomly extrapolated primal-dual coordinate descent method that adapts to sparsity of the data matrix and the favorable structures of the objective function. Our method updates only a subset of primal and dual variables with sparse data, an ...

2020

Rapid Analysis of Arbitrary-Shaped Conformal Beam-Scanning Arrays

Anja Skrivervik, Denys Nikolayev

Conformal antenna arrays are able to fit seamlessly on curved 3D-shaped surfaces, which are found ubiquitously on vehicles, aircraft, a human body, etc. In addition, conformal structures can overcome the scan loss limitations of conventional planar arrays. ...

IEEE2020

Sparsity Invariance for Convex Design of Distributed Controllers

Maryam Kamgarpour, Luca Furieri, Yu Zheng

We address the problem of designing optimal linear time-invariant (LTI) sparse controllers for LTI systems, which corresponds to minimizing a norm of the closed-loop system subjected to sparsity constraints on the controller structure. This problem is NP-h ...

2020

On the Influence of Bias-Correction on Distributed Stochastic Optimization

Ali H. Sayed, Bicheng Ying, Kun Yuan, Sulaiman A S A E Alghunaim

Various bias-correction methods such as EXTRA, gradient tracking methods, and exact diffusion have been proposed recently to solve distributed deterministic optimization problems. These methods employ constant step-sizes and converge linearly to the exact ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Editing in Style: Uncovering the Local Semantics of GANs

Sabine Süsstrunk, Edo Collins

While the quality of GAN image synthesis has improved tremendously in recent years, our ability to control and condition the output is still limited. Focusing on StyleGAN, we introduce a simple and effective method for making local, semantically-aware edit ...

2020

Seismic displacement demand prediction in non-linear domain: Optimization of the N2 method

Pierino Lestuzzi, Lorenzo Diana

In Europe, computation of displacement demand for seismic assessment of existing buildings is essentially based on a simplified formulation of the N2 method as prescribed by Eurocode 8 (EC8). However, a lack of accuracy of the N2 method in certain conditio ...

2019

Accuracy Assessment of Nonlinear Seismic Displacement Demand Predicted by Simplified Methods for the Plateau Range of Design Response Spectra

Pierino Lestuzzi, Lorenzo Diana

The non-linear seismic displacement demand prediction for low-period structures, i.e. with an initial fundamental period situated in the plateau of design response spectra is studied. In Eurocode 8, the computation of seismic displacement demands is essent ...

2019

An adaptive primal-dual framework for nonsmooth convex minimization

Volkan Cevher, Quoc Tran Dinh, Ahmet Alacaoglu

We propose a new self-adaptive and double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems. Our algorithm is based on Nesterov’s smoothing technique via general Bregman distance functions. It self-adaptiv ...

2019

Nested Convex Bodies are Chaseable

Marek Elias

In the Convex Body Chasing problem, we are given an initial point v0. Rd and an online sequence of n convex bodies F1,..., Fn. When we receive Ft, we are required to move inside Ft. Our goal is to minimize the total distance traveled. This fundamental onli ...

SPRINGER2019

MATHICSE Technical Report: Controlling oscillations in high-order Discontinuous Galerkin schemes using artificial\ viscosity tuned by neural networks

Jan Sickmann Hesthaven, Niccolo' Discacciati, Deep Ray

High-order numerical solvers for conservation laws suer from Gibbs phenomenon close to discontinuities, leading to spurious oscillations and a detrimental effect on the solution accuracy. A possible strategy to reduce it comprises adding a suitable amount ...

MATHICSE2019

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.

Connectez-vous pour utiliser Chat avec Graph Search