Related papers: An FE-dABCD algorithm for elliptic optimal control…
We consider least squares semidefinite programming (LSSDP) where the primal matrix variable must satisfy given linear equality and inequality constraints, and must also lie in the intersection of the cone of symmetric positive semidefinite…
Minimax problems have recently attracted a lot of research interests. A few efforts have been made to solve decentralized nonconvex strongly-concave (NCSC) minimax-structured optimization; however, all of them focus on smooth problems with…
We propose an adaptive optimization algorithm for solving unconstrained scaled gradient flow problems that achieves fast convergence by controlling the optimization trajectory shape and the discretization step sizes. Under a broad class of…
We consider optimal control of an elliptic two-point boundary value problem governed by functions of bounded variation (BV). The cost functional is composed of a tracking term for the state and the BV-seminorm of the control. We use the…
This paper presents the design and analysis of a Hybrid High-Order (HHO) approximation for a distributed optimal control problem governed by the Poisson equation. We propose three distinct schemes to address unconstrained control problems…
In this paper we present a new steepest-descent type algorithm for convex optimization problems. Our algorithm pieces the unknown into sub-blocs of unknowns and considers a partial optimization over each sub-bloc. In quadratic optimization,…
In this work, we use the integral definition of the fractional Laplace operator and study a sparse optimal control problem involving a fractional, semilinear, and elliptic partial differential equation as state equation; control constraints…
An optimal control problem subject to an elliptic obstacle problem is studied. We obtain a numerical approximation of this problem by discretising the PDE obtained via a Moreau--Yosida type penalisation. For the resulting discrete control…
Many modern large-scale machine learning problems benefit from decentralized and stochastic optimization. Recent works have shown that utilizing both decentralized computing and local stochastic gradient estimates can outperform…
We discuss several optimization procedures to solve finite element approximations of linear-quadratic Dirichlet optimal control problems governed by an elliptic partial differential equation posed on a 2D or 3D Lipschitz domain. The control…
This paper presents an algorithm to solve non-convex optimal control problems, where non-convexity can arise from nonlinear dynamics, and non-convex state and control constraints. This paper assumes that the state and control constraints…
In this work we introduce a new optimal control algorithm for the Keller-Segel chemo-attraction system, where both boundary and distributed controls are considered and both are associated with introducing/removing the amount of chemical…
In this work, a balancing domain decomposition by constraints (BDDC) algorithm is applied to the nonsymmetric positive definite linear system arising from the hybridizable discontinuous Galerkin (HDG) discretization of an elliptic…
We consider a hybridizable discontinuous Galerkin (HDG) method for an elliptic distributed optimal control problem and we propose a balancing domain decomposition by constraints (BDDC) preconditioner to solve the discretized system. We…
This work is motivated by the need to study the impact of data uncertainties and material imperfections on the solution to optimal control problems constrained by partial differential equations. We consider a pathwise optimal control…
The aim of this work is to derive a priori error estimates for finite element discretizations of control--constrained optimal control problems that involve the Stokes system and Dirac measures. The first problem entails the minimization of…
We develop a novel iterative algorithm for locally optimal experimental design under constraints, like budget or performance constraints. It is an adaptive discretization algorithm. In every iteration, a discretized version of the…
This paper considers the problems of unconstrained minimization of large scale smooth convex functions having block-coordinate-wise Lipschitz continuous gradients. The block coordinate descent (BCD) method are among the first optimization…
This paper focuses on the quasi-optimality of an adaptive nonconforming finite element method for a distributed optimal control problem governed by the Stokes equation. The nonconforming lowest order Crouzeix-Raviart element and piecewise…
This paper aims to study the convergence of adaptive finite element method for control constrained elliptic optimal control problems under $L^2$-norm. We prove the contraction property and quasi-optimal complexity for the $L^2$-norm errors…