Related papers: A remark on staircase laminates in restricted sets
We investigate the computational complexity of min-max optimization under coupled constraints. The work of Daskalakis, Skoulakis, and Zampetakis [DSZ21] was the first to study min-max optimization through the lens of computational…
This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…
We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…
We develop a general framework for working with structured lifting problems, establishing closure and uniqueness properties of their solutions. In a subsequent paper, we apply these results to axiomatize computation rules of cubical type…
Recent advances in cutting-plane strategies applied to robust optimization problems show that they are competitive with respect to problem reformulations and interior-point algorithms. However, although its application with polyhedral…
We show that in order to decide whether a given probability measure is laminate it is enough to verify Jensen's inequality in the class of extremal non-negative rank-one convex integrands. We also identify a subclass of these extremal…
We extend the results of Deligne and Illusie on liftings modulo $p^2$ and decompositions of the de Rham complex in several ways. We show that for a smooth scheme $X$ over a perfect field $k$ of characteristic $p>0$, the truncations of the…
The Fourier(-Stieltjes) algebras on locally compact groups are important commutative Banach algebras in abstract harmonic analysis. In this paper we introduce a generalization of the above two algebras via twisting with respect to…
In applications that use knowledge representation (KR) techniques, in particular those that combine data-driven and logic methods, the domain of objects is not an abstract unstructured domain, but it exhibits a dedicated, deep structure of…
We enumerate the number of staircase diagrams over classically finite $E$-type Dynkin diagrams, extending the work of Richmond and Slofstra (Staircase Diagrams and Enumeration of smooth Schubert varieties) and completing the enumeration of…
In this paper we prove a complete panel of consistency results for the discrete de Rham (DDR) complex introduced in the companion paper [D. A. Di Pietro and J. Droniou, An arbitrary-order discrete de Rham complex on polyhedral meshes. Part…
The ellipsoid embedding function of a symplectic four-manifold measures the amount by which its symplectic form must be scaled in order for it to admit an embedding of an ellipsoid of varying eccentricity. This function generalizes the…
We present a novel relaxation framework for general mixed-integer nonlinear programming (MINLP) grounded in computational geometry. Our approach constructs polyhedral relaxations by convexifying finite sets of strategically chosen points,…
We consider the minimization of a continuous function over the intersection of a regular cone with an affine set via a new class of adaptive first- and second-order optimization methods, building on the Hessian-barrier techniques introduced…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
In this paper, we discuss the acceleration of the regularized alternating least square (RALS) algorithm for tensor approximation. We propose a fast iterative method using a Aitken-Stefensen like updates for the regularized algorithm.…
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer…
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…
We generalize an improved Lech bound, due to Huneke, Smirnov, and Validashti, for the Buchsbaum-Rim multiplicity and mixed multiplicity. We reduce the problem to the graded case and then to the polynomial ring case. There we use complete…
The paper presents a systematic approach for stiffness modeling of manipulators with complex and hybrid structures using matrix structural analysis. In contrast to previous results, it is suitable for mixed architectures containing…