Search results for "FOS: Mathematics"

showing 10 items of 1448 documents

Orbits of bounded bijective operators and Gabor frames

2020

This paper is a contribution to frame theory. Frames in a Hilbert space are generalizations of orthonormal bases. In particular, Gabor frames of $L^2(\mathbb{R})$, which are made of translations and modulations of one or more windows, are often used in applications. More precisely, the paper deals with a question posed in the last years by Christensen and Hasannasab about the existence of overcomplete Gabor frames, with some ordering over $\mathbb{Z}$, which are orbits of bounded operators on $L^2(\mathbb{R})$. Two classes of overcomplete Gabor frames which cannot be ordered over $\mathbb{Z}$ and represented by orbits of operators in $GL(L^2(\mathbb{R}))$ are given. Some results about opera…

Context (language use)01 natural sciencessymbols.namesakeOperator (computer programming)WaveletOperator representation of framesSettore MAT/05 - Analisi Matematica0103 physical sciencesFOS: MathematicsOrthonormal basis0101 mathematicsRepresentation (mathematics)MathematicsDiscrete mathematicsBounded bijective operatorsApplied Mathematics010102 general mathematicsHilbert spaceFunctional Analysis (math.FA)Mathematics - Functional AnalysisBounded functionsymbolsBijection010307 mathematical physics42C15 94A20Gabor framesAnnali di Matematica Pura ed Applicata (1923 -)
researchProduct

A product space reformulation with reduced dimension for splitting algorithms

2021

AbstractIn this paper we propose a product space reformulation to transform monotone inclusions described by finitely many operators on a Hilbert space into equivalent two-operator problems. Our approach relies on Pierra’s classical reformulation with a different decomposition, which results in a reduction of the dimension of the outcoming product Hilbert space. We discuss the case of not necessarily convex feasibility and best approximation problems. By applying existing splitting methods to the proposed reformulation we obtain new parallel variants of them with a reduction in the number of variables. The convergence of the new algorithms is straightforwardly derived with no further assump…

Control and OptimizationApplied Mathematicsdouglas – rachford algorithm47H05 47J25 49M27 65K10 90C30UNESCO::CIENCIAS TECNOLÓGICASComputational MathematicsOptimization and Control (math.OC)splitting algorithmprojection methodsFOS: Mathematicspierra’s product space reformulationmonotone inclusionsMathematics - Optimization and Controlfeasibility problemComputational Optimization and Applications
researchProduct

Symmetry breaking in a constrained cheeger type isoperimetric inequality

2015

We study the optimal constant in a Sobolev inequality for BV functions with zero mean value and vanishing outside a bounded open set. We are interested in finding the best possible embedding constant in terms of the measure of the domain alone. We set up an optimal shape problem and we completely characterize the behavior of optimal domains.

Control and OptimizationOptimal shapeZero (complex analysis)Symmetry and asymmetryMeasure (mathematics)Sobolev inequalityCheeger inequalityCombinatoricsComputational MathematicsMathematics - Analysis of PDEsOptimization and Control (math.OC)Control and Systems EngineeringSettore MAT/05 - Analisi MatematicaFOS: MathematicsExponentSymmetry breakingIsoperimetric inequalitySymmetry (geometry)Constant (mathematics)Mathematics - Optimization and ControlAnalysis of PDEs (math.AP)Mathematics
researchProduct

Convergence of Markovian Stochastic Approximation with discontinuous dynamics

2016

This paper is devoted to the convergence analysis of stochastic approximation algorithms of the form $\theta_{n+1} = \theta_n + \gamma_{n+1} H_{\theta_n}({X_{n+1}})$, where ${\left\{ {\theta}_n, n \in {\mathbb{N}} \right\}}$ is an ${\mathbb{R}}^d$-valued sequence, ${\left\{ {\gamma}_n, n \in {\mathbb{N}} \right\}}$ is a deterministic stepsize sequence, and ${\left\{ {X}_n, n \in {\mathbb{N}} \right\}}$ is a controlled Markov chain. We study the convergence under weak assumptions on smoothness-in-$\theta$ of the function $\theta \mapsto H_{\theta}({x})$. It is usually assumed that this function is continuous for any $x$; in this work, we relax this condition. Our results are illustrated by c…

Control and OptimizationStochastic approximationMarkov processMathematics - Statistics Theorydiscontinuous dynamicsStatistics Theory (math.ST)Stochastic approximation01 natural sciencesCombinatorics010104 statistics & probabilitysymbols.namesake[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]Convergence (routing)FOS: Mathematics0101 mathematics62L20state-dependent noiseComputingMilieux_MISCELLANEOUSMathematicsta112SequenceconvergenceApplied Mathematicsta111010102 general mathematicsFunction (mathematics)[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]16. Peace & justice[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulationcontrolled Markov chainMarkovian stochastic approximationsymbolsStochastic approximat
researchProduct

An Adaptive Alternating Direction Method of Multipliers

2021

AbstractThe alternating direction method of multipliers (ADMM) is a powerful splitting algorithm for linearly constrained convex optimization problems. In view of its popularity and applicability, a growing attention is drawn toward the ADMM in nonconvex settings. Recent studies of minimization problems for nonconvex functions include various combinations of assumptions on the objective function including, in particular, a Lipschitz gradient assumption. We consider the case where the objective is the sum of a strongly convex function and a weakly convex function. To this end, we present and study an adaptive version of the ADMM which incorporates generalized notions of convexity and penalty…

Control and Optimizationsignal denoisingApplied Mathematicsalternating direction method of multipliersMathematics::Optimization and Controldouglas–rachford algorithmUNESCO::CIENCIAS TECNOLÓGICASManagement Science and Operations Researchcomonotonicityweakly convex functionOptimization and Control (math.OC)47H05 47N10 47J25 49M27 65K15FOS: Mathematicsfirm thresholdingMathematics - Optimization and Control
researchProduct

Convergent dynamics of optimal nonlinear damping control

2021

Following Demidovich's concept and definition of convergent systems, we analyze the optimal nonlinear damping control, recently proposed [1] for the second-order systems. Targeting the problem of output regulation, correspondingly tracking of $\mathcal{C}^1$-trajectories, it is shown that all solutions of the control system are globally uniformly asymptotically stable. The existence of the unique limit solution in the origin of the control error and its time derivative coordinates are shown in the sense of Demidovich's convergent dynamics. Explanative numerical examples are also provided along with analysis.

Control and Systems EngineeringOptimization and Control (math.OC)FOS: Electrical engineering electronic engineering information engineeringFOS: MathematicsVDP::Matematikk og Naturvitenskap: 400Systems and Control (eess.SY)Electrical Engineering and Systems Science - Systems and ControlMathematics - Optimization and Control
researchProduct

Convergence for varying measures

2023

Some limit theorems of the type $\int_{\Omega}f_n dm_n -- --> \int_{\Omega}f dm$ are presented for scalar, (vector), (multi)-valued sequences of m_n-integrable functions f_n. The convergences obtained, in the vector and multivalued settings, are in the weak or in the strong sense.

Convergence in total variationSetwise convergenceConvergence in total variationUniform integrabilityAbsolute integrabilityPettis integralMultifunctionAbsolute integrabilitySetwise convergenceApplied MathematicsFunctional Analysis (math.FA)28B20 26E25 26A39 28B05 46G10 54C60 54C65Mathematics - Functional AnalysisMultifunctionSettore MAT/05 - Analisi MatematicaFOS: MathematicsPettis integralUniform integrabilityAnalysisJournal of Mathematical Analysis and Applications
researchProduct

Monotonicity and enclosure methods for the p-Laplace equation

2018

We show that the convex hull of a monotone perturbation of a homogeneous background conductivity in the $p$-conductivity equation is determined by knowledge of the nonlinear Dirichlet-Neumann operator. We give two independent proofs, one of which is based on the monotonicity method and the other on the enclosure method. Our results are constructive and require no jump or smoothness properties on the conductivity perturbation or its support.

Convex hull35R30 (Primary) 35J92 (Secondary)EnclosurePerturbation (astronomy)Monotonic function01 natural sciencesConstructiveMathematics - Analysis of PDEsEnclosure methodFOS: Mathematics0101 mathematicsMathematicsInclusion detectionMonotonicity methodLaplace's equationmonotonicity methodApplied Mathematics010102 general mathematicsMathematical analysista111inclusion detection010101 applied mathematicsNonlinear systemMonotone polygonp-Laplace equationAnalysis of PDEs (math.AP)enclosure method
researchProduct

A constructive theory of shape

2021

We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of qualitatively similar shapes are constructed giving as input a finite ordered set of characteristic points (landmarks) and the value of a continuous parameter $\kappa \in (0,\infty)$. We prove that all shapes belonging to the same family are located within the convex hull of the landmarks. The theory is constructive in the sense that it provides a systematic means to build a mathematical model for any shape taken from the physical world. We illustrate this with a va…

Convex hullConnected spacePure mathematicsSeries (mathematics)Dynamical systems theoryPlane curveGeneral MathematicsApplied MathematicsGeneral Physics and AstronomyStatistical and Nonlinear PhysicsNumerical Analysis (math.NA)ConstructiveAttractorFOS: MathematicsMathematics - Numerical AnalysisParametric equationMathematics
researchProduct

Enclosure method for the p-Laplace equation

2014

We study the enclosure method for the p-Calder\'on problem, which is a nonlinear generalization of the inverse conductivity problem due to Calder\'on that involves the p-Laplace equation. The method allows one to reconstruct the convex hull of an inclusion in the nonlinear model by using exponentially growing solutions introduced by Wolff. We justify this method for the penetrable obstacle case, where the inclusion is modelled as a jump in the conductivity. The result is based on a monotonicity inequality and the properties of the Wolff solutions.

Convex hullGeneralization35R30 (Primary) 35J92 (Secondary)EnclosureMathematics::Classical Analysis and ODEsInverseMonotonic function01 natural sciencesTheoretical Computer ScienceMathematics - Analysis of PDEsFOS: Mathematics0101 mathematicsMathematical PhysicsMathematicsLaplace's equationMathematics::Functional AnalysisCalderón problemApplied Mathematics010102 general mathematicsMathematical analysisComputer Science Applications010101 applied mathematicsNonlinear systemSignal ProcessingJumpp-Laplace equationenclosure methodAnalysis of PDEs (math.AP)
researchProduct