SearcharxivSearch

arXiv subjects

Umarkhon Rakhimov

Publications and source records attributed to Umarkhon Rakhimov.

4 recordsLinked to original sources

A Function-Space Framework for BDDC Preconditioning in Control- and State-Constrained Sparse Optimal Control

We develop a Balancing Domain Decomposition by Constraints (BDDC) preconditioner for the interface systems arising from active-set semi-smooth Newton linearizations of elliptic optimal control problems with box-constrained controls, $L^1$-sparsity, and Moreau--Yosida regularized state constraints. The domain decomposition and BDDC construction are formulated directly at the infinite-dimensional level. Eliminating the interior variables yields a Schur complement for the state and adjoint traces assembled from local subdomain operators. We prove a global--local equivalence result, establish well-posedness of the local and partially assembled problems under verifiable conditions on the primal constraints. The BDDC operator admits a two-level additive Schwarz representation with independent local solves and a finite-dimensional coarse solve. We implement the preconditioner using conforming finite elements and test it for distributed and Neumann boundary control. For a fixed ratio of subdomain diameter $H$ to mesh size $h$, the GMRES iteration counts are nearly independent of mesh refinement and grow only moderately as this ratio increases. Enriching the coarse space substantially improves convergence and reduces sensitivity to the control regularization and sparsity weights. For the state-constrained problem, scaling the Moreau--Yosida penalty parameter proportionally to $h^2$ yields nearly constant GMRES iteration counts as the mesh is refined.

math.OC

Reconstructing edge-deleted unicyclic graphs

The Harary reconstruction conjecture states that any graph with more than four edges can be uniquely reconstructed from its set of maximal edge-deleted subgraphs. In 1977, Müller verified the conjecture for graphs with $n$ vertices and $n \log_2(n)$ edges, improving on Lovás's bound of $\log(n^2-n)/4$. Here, we show that the reconstruction conjecture holds for graphs which have exactly one cycle and and three non-isomorphic subtrees.

math.CO

A Discontinuous Galerkin Method for Optimal Control of the Obstacle Problem

This article provides quasi-optimal a priori error estimates for an optimal control problem constrained by an elliptic obstacle problem where the finite element discretization is carried out using the symmetric interior penalty discontinuous Galerkin method. The main proofs are based on the improved $L^2$-error estimates for the obstacle problem, the discrete maximum principle, and a well-known quadratic growth property. The standard (restrictive) assumptions on mesh are not assumed here.

math.NA

On The Use of Risk Measures in Digital Twins to Identify Weaknesses in Structures

Given measurements from sensors and a set of standard forces, an optimization based approach to identify weakness in structures is introduced. The key novelty lies in letting the load and measurements to be random variables. Subsequently the conditional-value-at-risk (CVaR) is minimized subject to the elasticity equations as constraints. CVaR is a risk measure that leads to minimization of rare and low probability events which the standard expectation cannot. The optimization variable is the (deterministic) strength factor which appears as a coefficient in the elasticity equation, thus making the problem nonconvex. Due to uncertainty, the problem is high dimensional and, due to CVaR, the problem is nonsmooth. An adjoint based approach is developed with quadrature in the random variables. Numerical results are presented in the context of a plate, a large structure with trusses similar to those used in solar arrays or cranes, and a footbridge.

math.OC