Related papers: A Minimum Angle Method for Dual Feasibility
We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions. While there has been theoretical work on this problem, our algorithm is the first…
We propose an optimization formulation for the simultaneous estimation of a latent variable and the identification of a linear continuous-time dynamic system, given a single input-output pair. We justify this approach based on Bayesian…
Employing probabilistic techniques we compute best possible upper and lower bounds on the price of an option on one or two assets with continuous piecewise linear payoff function based on prices of simple call options of possibly distinct…
Multi-stage decision problems under uncertainty can be efficiently solved with the Stochastic Dual Dynamic Programming (SDDP) algorithm. However, traditional implementations require all stage problems to be feasible. Feasibility is usually…
The aim of this manuscript is to approach by means of first order differential equations/inclusions convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the…
This mini-course provides a presentation of the method of characteristics to initial/boundary-value problems for systems of first-order partial differential equations and to Hamilton-Jacobi variational inequalities. In particular, these…
We analyze the performance of alternating minimization for loss functions optimized over two variables, where each variable may be restricted to lie in some potentially nonconvex constraint set. This type of setting arises naturally in…
We present a new notion of probabilistic duality for random variables involving mixture distributions. Using this notion, we show how to implement a highly-parallelizable Gibbs sampler for weakly coupled discrete pairwise graphical models…
The problem of mobile position estimation in multipath scenarios is addressed. A low-complexity, fully-adaptive algorithm is proposed, based on the pseudo maximum likelihood approach. The processing is done exclusively on-board at the…
We describe an adaptive importance sampling algorithm for rare events that is based on a dual stochastic control formulation of a path sampling problem. Specifically, we focus on path functionals that have the form of cumulate generating…
Incorporating the concept of order parameter of the mean-field theory into the simulated annealing method, we presented a new optimization algorithm, the guided simulated annealing method. In this method mean-field order parameters are…
We design accelerated algorithms with improved rates for several fundamental classes of optimization problems. Our algorithms all build upon techniques related to the analysis of primal-dual extragradient methods via relative Lipschitzness…
We propose a canonical form of the experimental optimization problem and review the state-of-the-art methods to solve it. As guarantees of global convergence to an optimal point via only feasible iterates are absent in these methods, we…
We propose a primal--dual technique that applies to infinite dimensional equality constrained problems, in particular those arising from optimal control. As an application of our general framework, we solve a control-constrained double…
In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the…
The minimum-time path for intercepting a moving target with a prescribed impact angle is studied in the paper. The candidate paths from Pontryagin's maximum principle are analyzed, so that each candidate is related to a zero of a…
Recent advances in causal inference have seen the development of methods which make use of the predictive power of machine learning algorithms. In this paper, we develop novel double machine learning (DML) procedures for panel data in which…
Motion planning in the presence of multiple dynamic obstacles is an important research problem from the perspective of autonomous vehicles as well as space-constrained multi-robot work environment. In this paper, we address the motion…
Neural Algorithmic Reasoning is an emerging area of machine learning which seeks to infuse algorithmic computation in neural networks, typically by training neural models to approximate steps of classical algorithms. In this context, much…
Minimum-time speed profiles are constructed for planar paths with smooth strictly-monotonic signed curvature, subject to constraints on velocity, normal acceleration and tangential acceleration. The construction is explicit and exact, and…