An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

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.

The formulation of inverse problems in the continuum eliminates discretization errors and allows for the exact incorporation of priors. In this paper, we formulate a continuous-domain inverse problem over a search space of continuous and piecewise-linear f ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

The ever-increasing impact of deploying renewable energy resources reducing power system inertia, requires distributed energy resource (DER) aggregators to secure high-performance, fast-responding primary frequency reserve (PFR) in ancillary service market ...

We develop new tools to study landscapes in nonconvex optimization. Given one optimization problem, we pair it with another by smoothly parametrizing the domain. This is either for practical purposes (e.g., to use smooth optimization algorithms with good g ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We form ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...

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 ...

Control systems operating in real-world environments often face disturbances arising from measurement noise and model mismatch. These factors can significantly impact the perfor- mance and safety of the system. In this thesis, we aim to leverage data to de ...

In this paper, we analyze the recently proposed stochastic primal-dual hybrid gradient (SPDHG) algorithm and provide new theoretical results. In particular, we prove almost sure convergence of the iterates to a solution with convexity and linear convergenc ...

In this thesis we design online combinatorial optimization algorithms for beyond worst-case analysis settings. In the first part, we discuss the online matching problem and prove that, in the edge arrival model, no online algorithm can achieve a competiti ...

Internet ranking algorithms play a crucial role in information technologies and numerical analysis due to their efficiency in high dimensions and wide range of possible applications, including scientometrics and systemic risk in finance (SinkRank, DebtRank ...

One of the main goal of Artificial Intelligence is to develop models capable of providing valuable predictions in real-world environments. In particular, Machine Learning (ML) seeks to design such models by learning from examples coming from this same envi ...

We address black-box convex optimization problems, where the objective and constraint functions are not explicitly known but can be sampled within the feasible set. The challenge is thus to generate a sequence of feasible points converging towards an optim ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Chat with Graph Search

A Box-Spline Framework for Inverse Problems With Continuous-Domain Sparsity Constraints

A ride time-oriented scheduling algorithm for dial-a-ride problems

Stochastic Risk-driven Bidding of a Solar and Storage Aggregator in Primary Frequency and Energy Markets: A Performance-based Capacity Allocation Approach

The effect of smooth parametrizations on nonconvex optimization landscapes

Learning to Remove Cuts in Integer Linear Programming

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Perturbed Utility Stochastic Traffic Assignment

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

A Combination Technique for Optimal Control Problems Constrained by Random PDEs

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Vehicle-to-Grid for Reliable Frequency Regulation

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

On The Convergence Of Stochastic Primal-Dual Hybrid Gradient

Beyond worst-case analysis, with or without predictions

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Predicting in Uncertain Environments: Methods for Robust Machine Learning

Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations

Results on Sparse Integer Programming and Geometric Independent Sets