Related papers: A new algebraic solution to multidimensional minim…
An exactly solvable position-dependent mass Schr\"odinger equation in two dimensions, depicting a particle moving in a semi-infinite layer, is re-examined in the light of recent theories describing superintegrable two-dimensional systems…
A new approach to solving a class of rankconstrained semi-definite programming (SDP) problems, which appear in many signal processing applications such as transmit beamspace design in multiple-input multiple-output (MIMO) radar, downlink…
Interior eigenvalue problems for large-scale sparse Hermitian matrices are fundamental in computational science. We propose an adaptive polynomial filtering strategy based on Chebyshev expansion of a step function, integrated into a…
Given pointwise samples of an unknown function belonging to a certain model set, one seeks in Optimal Recovery to recover this function in a way that minimizes the worst-case error of the recovery procedure. While it is often known that…
We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, "tame"). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the…
This paper suggests an algebraic version of the theorem on the existence of eigenvectors for linear operators in abstract idempotent spaces. Earlier, the theorem on the existence of eigenvectors was only known for the cases of a free…
We consider a class of infinite-dimensional optimization problems in which a distributed vector-valued variable should pointwise almost everywhere take values from a given finite set $\mathcal{M}\subset\mathbb{R}^m$. Such hybrid…
With his Clifford algebra of differential forms, Kaehler's algebra addresses the overlooked manifestation of symmetry in the solutions of exterior systems. In this algebra, solutions with a given symmetry are members of left ideals…
We consider the method of quasi-solutions (also referred to as Ivanov regularization) for the regularization of linear ill-posed problems in non-reflexive Banach spaces. Using the equivalence to a metric projection onto the image of the…
We show that in the setting of proper metric spaces one obtains a solution of the classical two-dimensional Plateau problem by minimizing the energy, as in the classical case, once a definition of area (in the sense of convex geometry) has…
In many applications of practical interest, solutions of partial differential equation models arise as critical points of an underlying (energy) functional. If such solutions are saddle points, rather than being maxima or minima, then the…
Differentiable systems in this paper means systems of equations that are described by differentiable real functions in real matrix variables. This paper proposes algorithms for finding minimal rank solutions to such systems over (arbitrary…
Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
Theoretical and computational properties of a vector equation $Ax-\|x\|_1x=b$ are investigated, where $A$ is an invertible $M$-matrix and $b$ is a nonnegative vector. Existence and uniqueness of a nonnegative solution is proved. Fixed-point…
} The main goal of this note is to provide new, mostly multidimensional densities, compactly supported and list many of its properties that enable effective calculations. The idea of obtaining such densities is firstly to build some…
We introduce a direct numerical treatment of nonlinear higher-index differential-algebraic equations by means of overdetermined polynomial least-squares collocation. The procedure is not much more computationally expensive than standard…
We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…
The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarization and Mixed-Integer Programming (MIP) solvers. However,…
Convex optimization is a well-established research area with applications in almost all fields. Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a…