Results 11 to 20 of about 1,281,767 (368)
"Convex" characterization of linearly convex domains [PDF]
MATHEMATICA SCANDINAVICA, 2011 We prove that a $C^{1,1}$-smooth bounded domain $D$ in $\C^n$ is linearly convex if and only if the convex hull of any two discs in $D$ with common center lies in $D.$Comment: to appear in Math.
Nikolov, Nikolai, Thomas, Pascal J.
core +5 more sources
Noncommutative Partial Convexity Via $$\Gamma $$-Convexity [PDF]
The Journal of Geometric Analysis, 2020 Motivated by classical notions of partial convexity, biconvexity, and bilinear matrix inequalities, we investigate the theory of free sets that are defined by (low degree) noncommutative matrix polynomials with constrained terms. Given a tuple of symmetric polynomials $\Gamma$, a free set is called $\Gamma$-convex if it closed under isometric ...
Jury, Michael +4 more
openaire +3 more sources
Computer Vision, 2010 This textbook is based on lectures given by the authors at MIPT (Moscow), HSE (Moscow), FEFU (Vladivostok), V.I. Vernadsky KFU (Simferopol), ASU (Republic of Adygea), and the University of Grenoble-Alpes (Grenoble, France).
Stephen P. Boyd, L. Vandenberghe
semanticscholar +1 more source
Exact Matrix Completion via Convex Optimization [PDF]
Foundations of Computational Mathematics, 2008 We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M.
E. Candès, B. Recht
semanticscholar +1 more source
Biometrics, 2016 SummaryIn the biclustering problem, we seek to simultaneously group observations and features. While biclustering has applications in a wide array of domains, ranging from text mining to collaborative filtering, the problem of identifying structure in high-dimensional genomic data motivates this work.
Chi, Eric C. +2 more
openaire +4 more sources
Convex Functions on Convex Polytopes [PDF]
Proceedings of the American Mathematical Society, 1968 The behavior of convex functions is of interest in connection with a wide variety of optimization problems. It is shown here that this behavior is especially simple, in certain respects, when the domain is a polytope or belongs to certain classes of sets closely related to polytopes; moreover, the polytopes and related classes are actually ...
Gale, David +2 more
openaire +1 more source
Mathematical Programming, 2022 AbstractWe present a generalization of the notion of neighborliness to non-polyhedral convex cones. Although a definition of neighborliness is available in the non-polyhedral case in the literature, it is fairly restrictive as it requires all the low-dimensional faces to be polyhedral.
James Saunderson, Venkat Chandrasekaran
openaire +4 more sources
Meta-Learning With Differentiable Convex Optimization [PDF]
Computer Vision and Pattern Recognition, 2019 Many meta-learning approaches for few-shot learning rely on simple base learners such as nearest-neighbor classifiers. However, even in the few-shot regime, discriminatively trained linear predictors can offer better generalization.
Kwonjoon Lee +3 more
semanticscholar +1 more source
Convex-cyclic matrices, convex-polynomial interpolation and invariant convex sets [PDF]
Operators and Matrices, 2017 We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant convex sets, and the dynamics of matrices.
Feldman, Nathan S., McGuire, Paul
openaire +2 more sources
Convex Optimization, 2021 This paper will analyze convex functions. In particular, it will investigate criteria for convexity. The investigation will list the criteria from the weakest to the strongest based on theorems, definitions, propositions, and various examples. The theory
Susanna Maria Zagar
semanticscholar +1 more source