English
Related papers

Related papers: Approximating Operator Norms via Generalized Krivi…

200 papers

Sparsity finds applications in areas as diverse as statistics, machine learning, and signal processing. Computations over sparse structures are less complex compared to their dense counterparts, and their storage consumes less space. This…

Signal Processing · Electrical Eng. & Systems 2023-01-31 Omar M. Sleem , M. E. Ashour , N. S. Aybat , Constantino M. Lagoa

We consider the Schur-Horn problem for normal operators in von Neumann algebras, which is the problem of characterizing the possible diagonal values of a given normal operator based on its spectral data. For normal matrices, this problem is…

Operator Algebras · Mathematics 2015-10-28 Matthew Kennedy , Paul Skoufranis

Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$. If the samples are perturbed by noise, controlling the smoothness of the…

Numerical Analysis · Mathematics 2025-10-20 Thomas Strohmer

Given a matrix $A$, the goal of the entrywise low-rank approximation problem is to find $\operatorname{argmin} \|A-B\|_p$ over all rank-$k$ matrices $B$, where $\| \cdot \|_p$ is the entrywise $\ell_p$ norm. When $p = 2$ this well-studied…

Data Structures and Algorithms · Computer Science 2026-04-28 Prashanti Anderson , Ainesh Bakshi , Samuel B. Hopkins

Several unitarily invariant norm inequalities and numerical radius inequalities for Hilbert space operators are studied. We investigate some necessary and sufficient conditions for the parallelism of two bounded operators. For a finite rank…

Functional Analysis · Mathematics 2024-04-03 Pintu Bhunia

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\ell_p$-approximation error, for any $p \geq 1$; the case $p = 2$ is the classical SVD problem. We obtain the first provably good…

Data Structures and Algorithms · Computer Science 2017-05-19 Flavio Chierichetti , Sreenivas Gollapudi , Ravi Kumar , Silvio Lattanzi , Rina Panigrahy , David P. Woodruff

In this paper, we consider an $\ell_{0}$-norm penalized formulation of the generalized eigenvalue problem (GEP), aimed at extracting the leading sparse generalized eigenvector of a matrix pair. The formulation involves maximization of a…

Machine Learning · Statistics 2015-06-22 Junxiao Song , Prabhu Babu , Daniel P. Palomar

In $L_2({\mathbb R}^d; {\mathbb C}^n)$, we consider a matrix strongly elliptic differential operator ${A}_\varepsilon$ of order $2p$, $p \geqslant 2$. The operator ${A}_\varepsilon$ is given by ${A}_\varepsilon = b(\mathbf{D})^*…

Analysis of PDEs · Mathematics 2020-11-30 Tatiana Suslina

Let $r$ be a positive real number and $p$ satisfy $(2/p)\in\mathbb{N}$. Then, we consider the lattice point problem of the closed curves astroid-type $p$-circle $\{x\in\mathbb{R}^{2}|\ |x_{1}|^{p}+|x_{2}|^{p}=r^{p}\}$ which generalize the…

Number Theory · Mathematics 2025-06-19 Masaya Kitajima

We derive a priori error estimates for Nitsche's method applied to elliptic problems on approximate domains. Such approximations arise, for example, in unfitted finite element methods, data-driven simulations, and evolving domain problems,…

Numerical Analysis · Mathematics 2026-04-02 Mats G. Larson , Karl Larsson , Shantiram Mahata

In this paper we study the auxiliary problems that appear in $p$-order tensor methods for unconstrained minimization of convex functions with $\nu$-H\"{o}lder continuous $p$th derivatives. This type of auxiliary problems corresponds to the…

Optimization and Control · Mathematics 2021-06-07 Geovani Nunes Grapiglia , Yurii Nesterov

In this paper we consider nonlinear problems with an operator depending only on the deformation tensor. We consider the class of operators derived from a potential and with $(p,\delta)$ structure, for $1<p\leq 2$ and for all $\delta\geq0$.…

Analysis of PDEs · Mathematics 2021-12-24 Luigi C. Berselli , Michael Růžička

In this paper we develop a procedure to deal with a family of parameter-dependent ill-posed problems, for which the exact solution in general does not exist. The original problems are relaxed by considering corresponding approximate ones,…

Analysis of PDEs · Mathematics 2022-06-29 Martin Lazar , Enrique Zuazua

Optimization problems over permutation matrices appear widely in facility layout, chip design, scheduling, pattern recognition, computer vision, graph matching, etc. Since this problem is NP-hard due to the combinatorial nature of…

Optimization and Control · Mathematics 2016-09-01 Bo Jiang , Ya-Feng Liu , Zaiwen Wen

In this work, we consider the approximation of Hilbert space-valued meromorphic functions that arise as solution maps of parametric PDEs whose operator is the shift of an operator with normal and compact resolvent, e.g. the Helmholtz…

Numerical Analysis · Mathematics 2020-02-28 Francesca Bonizzoni , Fabio Nobile , Ilaria Perugia , Davide Pradovera

In this paper, we propose $\ell_p$-norm regularized models to seek near-optimal sparse portfolios. These sparse solutions reduce the complexity of portfolio implementation and management. Theoretical results are established to guarantee the…

Portfolio Management · Quantitative Finance 2013-12-24 Caihua Chen , Xindan Li , Caleb Tolman , Suyang Wang , Yinyu Ye

We consider a class of statistical inverse problems involving the estimation of a regression operator from a Polish space to a separable Hilbert space, where the target lies in a vector-valued reproducing kernel Hilbert space induced by an…

Machine Learning · Statistics 2026-04-28 Jia-Qi Yang , Lei Shi

We give a counterexample to a trilinear version of the operator space Grothendieck theorem. In particular, we show that for trilinear forms on $\ell_\infty$, the ratio of the symmetrized completely bounded norm and the jointly completely…

Operator Algebras · Mathematics 2019-06-05 Jop Briët , Carlos Palazuelos

We study the general scheduling problem (GSP) which generalizes and unifies several well-studied preemptive single-machine scheduling problems, such as weighted flow time, weighted sum of completion time, and minimizing the total weight of…

Data Structures and Algorithms · Computer Science 2025-11-21 Alexander Armbruster , Lars Rohwedder , Andreas Wiese

We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\{ Ax \geq r \}$ minimizing a non-negative…

Discrete Mathematics · Computer Science 2017-04-28 Britta Peis , José Verschae , Andreas Wierz