Related papers: Moments and convex optimization for analysis and c…
Optimal control of the singular nonlinear parabolic PDE which is a distributional formulation of multidimensional and multiphase Stefan-type free boundary problem is analyzed. Approximating sequence of finite-dimensional optimal control…
This paper explores a fully discrete approximation for a nonlinear hyperbolic PDE-constrained optimization problem (P) with applications in acoustic full waveform inversion. The optimization problem is primarily complicated by the…
Support vector machines (SVMs) are well-studied supervised learning models for binary classification. In many applications, large amounts of samples can be cheaply and easily obtained. What is often a costly and error-prone process is to…
We consider optimal experimental design (OED) for Bayesian nonlinear inverse problems governed by partial differential equations (PDEs) under model uncertainty. Specifically, we consider inverse problems in which, in addition to the…
Finite element approximations of Dirichlet boundary control problems governed by parabolic PDEs on convex polygonal domains are studied in this paper. The existence of a unique solution to optimal control problems is guaranteed based on…
This paper investigates the control of nonlinear systems using a piecewise linear approximation framework. The proposed approach combines a PID controller with locally linearized models obtained by partitioning the nonlinear function into…
This paper proposes a new steepest gradient descent method for solving nonconvex finite minimax problems using non-monotone adaptive step sizes and providing proof of convergence results in cases of the nonconvex, quasiconvex, and…
This work is concerned with optimal control of partial differential equations where the control enters the state equation as a coefficient and should take on values only from a given discrete set of values corresponding to available…
We study optimal control problems that are governed by semilinear elliptic partial differential equations that involve non-Lipschitzian nonlinearities. It is shown that, for a certain class of such PDEs, the solution map is Fr\'{e}chet…
We consider joint optimization and learning problems arising in real-time decision systems. While most existing work focuses primarily on convex, revenue-based objectives, we extend this line of research to multi-objective formulations. In…
In this paper we compute families of reduced order models that match a prescribed set of moments of a highly dimensional linear time-invariant system. First, we fully parametrize the models in the interpolation points and in the free…
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…
In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our…
In this paper, we propose a low rank approximation method for efficiently solving stochastic partial differential equations. Specifically, our method utilizes a novel low rank approximation of the stiffness matrices, which can significantly…
For solving pseudo-convex global optimization problems, we present a novel fully adaptive steepest descent method (or ASDM) without any hard-to-estimate parameters. For the step-size regulation in an $\varepsilon$-normalized direction, we…
Finite-time linear-quadratic control of partial differential-algebraic equations (PDAEs) is considered. The discussion is restricted to those that are radial with index $0$; this corresponds to a nilpotency degree of 1. We establish the…
We consider solving high-order semidefinite programming (SDP) relaxations of nonconvex polynomial optimization problems (POPs) that often admit degenerate rank-one optimal solutions. Instead of solving the SDP alone, we propose a new…
Stochastic nonconvex optimization problems with nonlinear constraints have a broad range of applications in intelligent transportation, cyber-security, and smart grids. In this paper, first, we propose an inexact-proximal accelerated…
We look at a stochastic time-varying optimization problem and we formulate online algorithms to find and track its optimizers in expectation. The algorithms are derived from the intuition that standard prediction and correction steps can be…
To study the nonlinear properties of complex natural phenomena, the evolution of the quantity of interest can be often represented by systems of coupled nonlinear stochastic differential equations (SDEs). These SDEs typically contain…