English
Related papers

Related papers: Monotone Linear Relations: Maximality and Fitzpatr…

200 papers

In this paper, we utilize results from convex analysis and monotone operator theory to derive additional properties of the softmax function that have not yet been covered in the existing literature. In particular, we show that the softmax…

Optimization and Control · Mathematics 2018-08-23 Bolin Gao , Lacra Pavel

A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…

Quantum Algebra · Mathematics 2007-05-23 Swapneel Mahajan

A general class of nonconvex optimization problems is considered, where the penalty is the composition of a linear operator with a nonsmooth nonconvex mapping, which is concave on the positive real line. The necessary optimality condition…

Optimization and Control · Mathematics 2018-04-23 Daria Ghilli , Karl Kunisch

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

Logic · Mathematics 2013-08-19 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…

Optimization and Control · Mathematics 2020-12-01 Navid Rezazadeh , Solmaz S. Kia

We examine the linear convergence rates of variants of the proximal point method for finding zeros of maximal monotone operators. We begin by showing how metric subregularity is sufficient for linear convergence to a zero of a maximal…

Optimization and Control · Mathematics 2009-02-25 D. Leventhal

Let $\mathfrak{n}$ be a nonempty, proper, convex subset of $\mathbb{C}$. The $\mathfrak{n}$-maximal operators are defined as the operators having numerical ranges in $\mathfrak{n}$ and are maximal with this property. Typical examples of…

Functional Analysis · Mathematics 2023-10-31 Rosario Corso

We study the problem of minimizing or maximizing the fundamental spectral gap of Schr\"odinger operators on metric graphs with either a convex potential or a ``single-well'' potential on an appropriate specified subset. (In the case of…

Spectral Theory · Mathematics 2024-01-10 Mohammed Ahrami , Zakaria El Allali , Evans M Harrell , James B. Kennedy

A basic idea in optimal transport is that optimizers can be characterized through a geometric property of their support sets called cyclical monotonicity. In recent years, similar "monotonicity principles" have found applications in other…

Optimization and Control · Mathematics 2023-08-31 Julio Backhoff-Veraguas , Mathias Beiglböck , Giovanni Conforti

An explicit construction for Q-operators of the finite XXZ spin-chain with twisted boundary conditions is presented. The massless and the massive regime is considered as well as the root of unity case. It is explained how these results…

High Energy Physics - Theory · Physics 2014-11-18 Christian Korff

In this paper we study, in the relaxed context of locally convex spaces, intrinsic properties of monotone operators needed for the sum conjecture for maximal monotone operators to hold under classical interiority-type domain constraints.

Functional Analysis · Mathematics 2016-12-13 M. D. Voisei

Motivated by an application to resource sharing network modelling, we consider a problem of greedy maximization (i.e., maximization of the consecutive minima) of a vector in $R^n$, with the admissible set indexed by the time parameter. The…

Optimization and Control · Mathematics 2019-02-05 Lukasz Kruk

The investigation and classification of non-unique factorization phenomena has attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P.A. Garc\'ia-S\'anchez, together with several co-authors, derived…

Number Theory · Mathematics 2011-04-05 Andreas Philipp

The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the integer lattice. Suppose…

Data Structures and Algorithms · Computer Science 2016-05-11 Tasuku Soma , Yuichi Yoshida

We show that the composition of omega-series by surreal numbers, or more generally by elements of any confluent field of transseries, is monotonic in its second argument. In particular, omega-series and LE-series interpreted as functions…

Logic · Mathematics 2026-05-12 Vincenzo Mantova

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…

Combinatorics · Mathematics 2020-10-26 Sergey Bezuglyi , Palle E. T. Jorgensen

Let $A$ be a positive definite operator on a Hilbert space $H$, and $|||.|||$ be a unitarily invariant norm on $B(H)$. We show that if $f$ is an operator monotone function on $(0,\infty)$ and $n\in \mathbb{N}$, then $|||D^n…

Functional Analysis · Mathematics 2021-05-13 Amir Ghasem Ghazanfari

In this paper, we approach the problem of finding the zeros of the sum of a maximally monotone operator and a monotone and Lipschitz continuous one in a real Hilbert space via an implicit forward-backward-forward dynamical system with…

Optimization and Control · Mathematics 2015-04-23 Sebastian Banert , Radu Ioan Bot

The first part of the paper explains how to encode a one-cocycle and a two-cocycle on a group $G$ with values in its representation by networks of planar trivalent graphs with edges labelled by elements of $G$, elements of the…

K-Theory and Homology · Mathematics 2024-10-10 Mee Seong Im , Mikhail Khovanov

Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…

Computational Complexity · Computer Science 2018-04-18 Aleksandr Maksimenko
‹ Prev 1 8 9 10 Next ›