Publications related to Non-convex optimization for robust multi-view imaging

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

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

EPFL2023

Universal and adaptive methods for robust stochastic optimization

Ali Kavis

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

EPFL2023

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

Michel Bierlaire

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

2023

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

Ahmet Alacaoglu

Stochastic gradient descent (SGD) and randomized coordinate descent (RCD) are two of the workhorses for training modern automated decision systems. Intriguingly, convergence properties of these methods are not well-established as we move away from the spec ...

EPFL2021

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

Maximum-likelihood estimation of kinetic parameters via the extent-based incremental approach

Dominique Bonvin, Julien Léo Billeter, Diogo Filipe Mateus Rodrigues

For lumped homogeneous reaction systems, this paper presents a kinetic model identification scheme that provides maximum-likelihood parameter estimates and guarantees convergence to global optimality. The use of the extent-based incremental approach allows ...

PERGAMON-ELSEVIER SCIENCE LTD2019

Robust control of systems with sector nonlinearities via convex optimization: A data-driven approach

Alireza Karimi, Achille Nicoletti

In this paper, a new data-driven method for designing robust controllers is proposed for systemswith sector-bounded nonlinearities and multimodel uncertainties. The results from the circle criterion are used to generate necessary and sufficient convex cons ...

WILEY2019

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H-infinity Performance

Alireza Karimi, Achille Nicoletti

Recently, a new data-driven method for robust control with H-infinity performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controller ...

IEEE2018

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H∞ Performance

Alireza Karimi, Achille Nicoletti

Recently, a new data-driven method for robust control with H∞ performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controllers, the p ...

Elsevier2018

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H∞ Performance

Alireza Karimi, Achille Nicoletti

Recently, a new data-driven method for robust control with H ∞ performance has been proposed. This method is based on convex optimization and converges to the optimal performance when the controller order increases. However, for low-order controllers, the ...

2018

Non-convex optimization for robust multi-view imaging

Graph Chatbot

Chat with Graph Search

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Universal and adaptive methods for robust stochastic optimization

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

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

A first-order primal-dual method with adaptivity to local smoothness

Maximum-likelihood estimation of kinetic parameters via the extent-based incremental approach

Robust control of systems with sector nonlinearities via convex optimization: A data-driven approach

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H-infinity Performance

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H∞ Performance

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H∞ Performance

Universal and adaptive methods for robust stochastic optimization

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

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

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

A first-order primal-dual method with adaptivity to local smoothness

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H-infinity Performance

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H∞ Performance

Maximum-likelihood estimation of kinetic parameters via the extent-based incremental approach

A Data-Driven Method for Computing Fixed-Structure Low-Order Controllers With H∞ Performance

Robust control of systems with sector nonlinearities via convex optimization: A data-driven approach