Search results for "optimization"
showing 10 items of 2824 documents
Online Closed-Loop Real-Time tES-fMRI for Brain Modulation: Feasibility, Noise/Safety and Pilot Study
2021
AbstractRecent studies suggest that transcranial electrical stimulation (tES) can be performed during functional magnetic resonance imaging (fMRI). The novel approach of using concurrent tES-fMRI to modulate and measure targeted brain activity/connectivity may provide unique insights into the causal interactions between the brain neural responses and psychiatric/neurologic signs and symptoms, and importantly, guide the development of new treatments. However, tES stimulation parameters to optimally influence the underlying brain activity in health and disorder may vary with respect to phase, frequency, intensity and electrode’s montage. Here, we delineate how a closed-loop tES-fMRI study of …
Multi-stage Linear Programming Optimization for Pump Scheduling
2014
This study presents a methodology based on Linear Programming for determining the optimal pump schedule on a 24-hour basis, considering as decision variables the continuous pump flow rates which are subsequently transformed into a discrete schedule. The methodology was applied on a case study derived from the benchmark Anytown network. To evaluate the LP reliability, a comparison was made with solutions generated by a Hybrid Discrete Dynamically Dimensioned Search (HD-DDS) algorithm. The cost associated with the result derived from the LP initial solution was shown to be lower than that obtained with repeated HD-DDS runs with differing random seeds. (C) 2013 The Authors. Published by Elsevi…
Nonlinear vector Duffing inclusions with no growth restriction on the orientor field
2019
We consider nonlinear multivalued Dirichlet Duffing systems. We do not impose any growth condition on the multivalued perturbation. Using tools from the theory of nonlinear operators of monotone type, we prove existence theorems for the convex and the nonconvex problems. Also we show the existence of extremal trajectories and show that such solutions are $C_0^1(T,\mathbb{R}^N)$-dense in the solution set of the convex problem (strong relaxation theorem).
Stability of the Calderón problem in admissible geometries
2014
In this paper we prove log log type stability estimates for inverse boundary value problems on admissible Riemannian manifolds of dimension n ≥ 3. The stability estimates correspond to the uniqueness results in [13]. These inverse problems arise naturally when studying the anisotropic Calderon problem. peerReviewed
On a class of compactly epi-Lipschitzian sets
2003
The paper is devoted to the study of the so-called compactly epi-Lipschitzian sets. These sets are needed for many aspects of generalized differentiation, particulary for necessary optimality conditions, stability of mathematical programming problems and calculus rules for subdifferentials and normal cones. We present general conditions under which sets defined by general constraints are compactly epi-Lipschitzian. This allows us to show how the compact epi-Lipschitzness properties behave under set intersections.
Least gradient functions in metric random walk spaces
2019
In this paper we study least gradient functions in metric random walk spaces, which include as particular cases the least gradient functions on locally finite weighted connected graphs and nonlocal least gradient functions on $\mathbb{R}^N$. Assuming that a Poincar\'e inequality is satisfied, we study the Euler-Lagrange equation associated with the least gradient problem. We also prove the Poincar\'e inequality in a few settings.
Unique continuation property and Poincar�� inequality for higher order fractional Laplacians with applications in inverse problems
2020
We prove a unique continuation property for the fractional Laplacian $(-\Delta)^s$ when $s \in (-n/2,\infty)\setminus \mathbb{Z}$. In addition, we study Poincar\'e-type inequalities for the operator $(-\Delta)^s$ when $s\geq 0$. We apply the results to show that one can uniquely recover, up to a gauge, electric and magnetic potentials from the Dirichlet-to-Neumann map associated to the higher order fractional magnetic Schr\"odinger equation. We also study the higher order fractional Schr\"odinger equation with singular electric potential. In both cases, we obtain a Runge approximation property for the equation. Furthermore, we prove a uniqueness result for a partial data problem of the $d$-…
Superconductive and insulating inclusions for linear and non-linear conductivity equations
2015
We detect an inclusion with infinite conductivity from boundary measurements represented by the Dirichlet-to-Neumann map for the conductivity equation. We use both the enclosure method and the probe method. We use the enclosure method to prove partial results when the underlying equation is the quasilinear $p$-Laplace equation. Further, we rigorously treat the forward problem for the partial differential equation $\operatorname{div}(\sigma\lvert\nabla u\rvert^{p-2}\nabla u)=0$ where the measurable conductivity $\sigma\colon\Omega\to[0,\infty]$ is zero or infinity in large sets and $1<p<\infty$.
A DUALITY APPROACH TO THE FRACTIONAL LAPLACIAN WITH MEASURE DATA
2011
We describe a duality method to prove both existence and uniqueness of solutions to nonlocal problems like $$(-\Delta)^s v = \mu \quad \text{in } \mathbb{R}^N,$$ ¶ with vanishing conditions at infinity. Here $\mu$ is a bounded Radon measure whose support is compactly contained in $\mathbb{R}^N$, $N\geq2$, and $-(\Delta)^s$ is the fractional Laplace operator of order $s\in (1/2,1)$.
Notes on the subspace perturbation problem for off-diagonal perturbations
2014
The variation of spectral subspaces for linear self-adjoint operators under an additive bounded off-diagonal perturbation is studied. To this end, the optimization approach for general perturbations in [J. Anal. Math., to appear; arXiv:1310.4360 (2013)] is adapted. It is shown that, in contrast to the case of general perturbations, the corresponding optimization problem can not be reduced to a finite-dimensional problem. A suitable choice of the involved parameters provides an upper bound for the solution of the optimization problem. In particular, this yields a rotation bound on the subspaces that is stronger than the previously known one from [J. Reine Angew. Math. (2013), DOI:10.1515/cre…