Home

Concept

Simplex algorithm

Formal sciences
Theoretical computer science
Algorithms and data structures
Combinatorial optimization

About
Privacy
Disclaimer

Graph Chatbot

Related publications (26)

Page 1 of 2

Challenges and approaches in bridging the biomimicry gap in biohybrid systems of fish and robots

Vaios Papaspyros

As the field of ethology advances, especially over the past two decades, the role of animal-robot interaction tools has increasingly become essential. This importance arises from the need for controlled, repetitive, repeatable, and long-duration experiment ...

EPFL2023

A Proximal-Point Lagrangian-Based Parallelizable Nonconvex Solver for Bilinear Model Predictive Control

Colin Neil Jones, Yuning Jiang, Yingzhao Lian

Nonlinear model predictive control (NMPC) has been widely adopted to manipulate bilinear systems with dynamics that include products of the inputs and the states. These systems are ubiquitous in chemical processes, mechanical systems, and quantum physics, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Fully solvable finite simplex lattices with open boundaries in arbitrary dimensions

Fabrizio Minganti

Finite simplex lattice models are used in different branches of science, e.g., in condensed-matter physics, when studying frustrated magnetic systems and non-Hermitian localization phenomena; or in chemistry, when describing experiments with mixtures. An n ...

Amer Physical Soc2023

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

Adiabatic quantum-flux parametron (AQFP) is an energy-efficient superconducting technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the technology-imposed constraints on path balancing and fanout branching. These cells a ...

ACM2022

A prescriptive Dirichlet power allocation policy with deep reinforcement learning

Olga Fink

Prescribing optimal operation based on the condition of the system, and thereby potentially prolonging its remaining useful lifetime, has tremendous potential in terms of actively managing the availability, maintenance, and costs of complex systems. Reinfo ...

2022

Vehicle-to-Grid for Reliable Frequency Regulation

Dirk Lauinger

Future low-carbon societies will need to store vast amounts of electricity to stabilize electricity grids and to power electric vehicles. Vehicle-to-grid allows vehicle owners and grid operators to share the costs of electricity storage by making the batte ...

EPFL2022

Real-time Control of Battery Energy Storage Systems to Provide Ancillary Services Considering Voltage-Dependent Capability of DC-AC Converters

Mario Paolone, Sidi-Rachid Cherkaoui, Antonio Zecchino, Zhao Yuan

Frequency response and voltage support are vital ancillary services for power grids. In this paper, we design and experimentally validate a real-time control framework for battery energy storage systems (BESSs) to provide ancillary services to power grids. ...

2021

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Volkan Cevher, Alp Yurtsever

This paper develops a new storage-optimal algorithm that provably solves almost all semidefinite programs (SDPs). This method is particularly effective for weakly constrained SDPs under appropriate regularity conditions. The key idea is to formulate an app ...

SIAM Publications2021

The Imitation Game: Algorithm Selection by Exploiting Black-Box Recommenders

Rachid Guerraoui, Georgios Damaskinos

Cross-validation is commonly used to select the recommendation algorithms that will generalize best on yet unknown data. Yet, in many situations the available dataset used for cross-validation is scarce and the selected algorithm might not be the best suit ...

Springer2021

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Shaul Nadav Hallak

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to t ...

SPRINGER/PLENUM PUBLISHERS2020

Adaptation and Learning Over Networks Under Subspace Constraints-Part I: Stability Analysis

Ali H. Sayed, Stefan Vlaski, Roula Nassif

This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in low-dimensional ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

The Decision Rule Approach to Optimisation under Uncertainty: Methodology and Applications

Daniel Kuhn, Wolfram Wiesemann

Dynamic decision-making under uncertainty has a long and distinguished history in operations research. Due to the curse of dimensionality, solution schemes that naively partition or discretize the support of the random problem parameters are limited to sma ...

2019

Distributed Inference Over Networks Under Subspace Constraints

Ali H. Sayed, Stefan Vlaski, Roula Nassif

This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that enforce the objectives across the network to lie in a low-dimensiona ...

IEEE2019

The (h, k)-Server Problem on Bounded Depth Trees

Marek Elias

We study the k-server problem in the resource augmentation setting, i.e., when the performance of the online algorithm with k servers is compared to the offline optimal solution with h

ASSOC COMPUTING MACHINERY2019

"Dice"-sion Making under Uncertainty: When Can a Random Decision Reduce Risk?

Daniel Kuhn, Wolfram Wiesemann

Stochastic programming and distributionally robust optimization seek deterministic decisions that optimize a risk measure, possibly in view of the most adverse distribution in an ambiguity set. We investigate under which circumstances such deterministic de ...

2019

From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming

Daniel Kuhn, John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter

We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite convex programs ...

SIAM Publications2018

A Two Phase Heuristic Approach For The Dynamic Electric Autonomous Dial-a-Ride Problem

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provide shared-ride services to users specifying their origin, destination, and preferred arrival time. In the dynamic version of the DARP, some trips are booked in advance while others come in real-tim ...

2018

Coordinated Optimization and Control for Smart Grids

Altug Bitlislioglu

In this thesis, we consider commercial buildings with available heating, ventilation and air conditioning (HVAC) systems, and develop methods to assess and exploit their energy storage and production potential to collectively offer ancillary services to th ...

EPFL2018

Active Directional Modifier Adaptation with Trust Region - Application to Energy-Harvesting Kites

Dominique Bonvin, Colin Neil Jones, Sanket Sanjay Diwale, Martand Singhal, Matthieu Jonin

Many real-time optimization schemes maximize process performance by performing a model-based optimization. However, due to plant-model mismatch, the model-based solution is often suboptimal. In modifier adaptation, measurements are used to correct the mode ...

IEEE2018

On some problems related to 2-level polytopes

Manuel Francesco Aprile

In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...

EPFL2018