Publication

An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints

Related publications (34)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

Pascal Frossard, Sergio Mena, Stefano D'Aronco

Multiparty videoconferences, or more generally multiparty video calls, are gaining a lot of popularity as they offer a rich communication experience. These applications have, however, large requirements in terms of both network and computational resources ...

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

Technical Report: Control of Nonlinear Systems with Explicit-MPC-like Controllers

Colin Neil Jones, Milan Korda, Ivan Pejcic

This paper describes synthesis of controllers involving Quadratic Programming (QP) optimization problems for control of nonlinear systems. The QP structure allows an implementation of the controller as a piecewise affine function, pre-computed offline, whi ...

2017

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

, ,

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successiv ...

2014

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Georgios Karakonstantis

Ieee2014

The Minimal Complexity of Adapting Agents Increases with Fitness

What is the relationship between the complexity and the fitness of evolved organisms, whether natural or artificial? It has been asserted, primarily based on empirical data, that the complexity of plants and animals increases as their fitness within a part ...

Public Library Science2013

Magnetic resonance imaging (MRI) scanners produce raw measurements that are unfit to direct interpretation, unless an algorithmic step, called reconstruction, is introduced. Up to the last decade, this reconstruction was performed by algorithms of moderate ...

EPFL2012

This thesis deals with models and methods for large scale optimization problems; in particular, we focus on decision problems arising in the context of seaport container terminals for the efficient management of terminal operations. Large-scale optimizatio ...

EPFL2011

We present a new approach for the construction of lower bounds for the inf-sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. We combine the ``linearized' ...

Elsevier2010

We consider

L ^{ 1 }

SIAM2016