Yapa: Accelerated Proximal Algorithm For Convex Composite Problems

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.

In this manuscript, we present a collective multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty, and develop a novel convergence analysis of collective ...

This paper investigates the use of relaxed recentered logarithmic barrier functions in the context of nonlinear model predictive control. These functions are a variation of the regular log-barrier functions that are introduced in the objective function of ...

The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting para ...

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

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...

Within the context of contemporary machine learning problems, efficiency of optimization process depends on the properties of the model and the nature of the data available, which poses a significant problem as the complexity of either increases ad infinit ...

We show that shifted pairs of discrete or continuous low-lying horocycles equidistribute in the product space of two modular curves. ...

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

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

In this thesis, we propose and analyze novel numerical algorithms for solving three different high-dimensional problems involving tensors. The commonality of these problems is that the tensors can potentially be well approximated in low-rank formats. Ident ...

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

Yapa: Accelerated Proximal Algorithm For Convex Composite Problems

Chat with Graph Search

A multigrid method for PDE-constrained optimization with uncertain inputs

Relaxed Recentered Log-Barrier Function based Nonlinear Model Predictive Control

Phenomenological theory of variational quantum ground-state preparation

Data-Driven Control and Optimization under Noisy and Uncertain Conditions

On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

Universal and adaptive methods for robust stochastic optimization

The unipotent mixing conjecture

Hybrid Flock - Formation Control Algorithms

Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations

Low-Rank Tensor Methods for High-Dimensional Problems

Approximate CVPp in time 2(0.802n)