English
Related papers

Related papers: A geometry-based relaxation algorithm for equilibr…

200 papers

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…

Discrete Mathematics · Computer Science 2021-06-09 Matthias Schymura , Ina Seidel , Stefan Weltge

We propose a dual decomposition and linear program relaxation of the NP -hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is amenable to efficient optimization by message passing. Like…

Data Structures and Algorithms · Computer Science 2017-01-13 Paul Swoboda , Bjoern Andres

Tusn\'ady's problem asks to bound the discrepancy of points and axis-parallel boxes in $\mathbb{R}^d$. Algorithmic bounds on Tusn\'ady's problem use a canonical decomposition of Matou\v{s}ek for the system of points and axis-parallel boxes,…

Computational Geometry · Computer Science 2022-02-11 Kunal Dutta

Recent studies of networks representing complex systems from the brain to social graphs have revealed their higher-order architecture, which can be described by aggregates of simplexes (triangles, tetrahedrons, and higher cliques). Current…

Soft Condensed Matter · Physics 2026-03-11 Bosiljka Tadic , Neelima Gupte

Volume is a natural geometric measure for comparing polyhedral relaxations of non-convex sets. Speakman and Lee gave volume formulae for comparing relaxations of trilinear monomials, quantifying the strength of various natural relaxations.…

Optimization and Control · Mathematics 2018-10-18 Emily Speakman , Han Yu , Jon Lee

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Metric Geometry · Mathematics 2026-03-10 Steven Hoehner

We develop the tools to bound extreme roots of multivariate real zero polynomials globally. This is done through the use of a relaxation that approximates their rigidly convex sets. This relaxation can easily be constructed using the degree…

Combinatorics · Mathematics 2025-10-14 Alejandro González Nevado

Recently, there has been significant interest in convex relaxations of the optimal power flow (OPF) problem. A semidefinite programming (SDP) relaxation globally solves many OPF problems. However, there exist practical problems for which…

Optimization and Control · Mathematics 2016-11-17 Daniel K. Molzahn , Ian A. Hiskens

Connecting cell behavior to tissue shape and mechanics is a key challenge in the physics of morphogenesis. Cytoskeletal turnover precludes a fixed reference state, and tensions are actively generated independently of strain; so conventional…

Soft Condensed Matter · Physics 2026-05-28 Nikolas H. Claussen , Fridtjof Brauns , Boris I. Shraiman

A quadratic approximation of neural network loss landscapes has been extensively used to study the optimization process of these networks. Though, it usually holds in a very small neighborhood of the minimum, it cannot explain many…

Machine Learning · Computer Science 2022-06-23 Chao Ma , Daniel Kunin , Lei Wu , Lexing Ying

The Voronoi tessellation of a homogeneous Poisson point process in the lower half-plane gives rise to a family of vertical elongated cells in the upper half-plane. The set of edges of these cells is ruled by a Markovian branching mechanism…

Probability · Mathematics 2022-03-22 Pierre Calka , Yann Demichel , Nathanaël Enriquez

Geometric constraints impact the formation of a broad range of spatial networks, from amino acid chains folding to proteins structures to rearranging particle aggregates. How the network of interactions dynamically self-organizes in such…

Molecular Networks · Quantitative Biology 2016-10-19 Nora Molkenthin , Marc Timme

We propose a PnP algorithm for a camera constrained to two-dimensional motion (applicable, for instance, to many wheeled robotics platforms). Leveraging this assumption allows accuracy and performance improvements over 3D PnP algorithms due…

Robotics · Computer Science 2024-03-11 Joshua Wang

Agglomeration techniques can be successfully employed to reduce the computational costs of numerical simulations and stand at the basis of multilevel algebraic solvers. To automatically perform mesh agglomeration, we propose a novel…

Numerical Analysis · Mathematics 2025-08-08 Paola F. Antonietti , Mattia Corti , Gabriele Martinelli

In this research study, a numerical tool, which is based on a version of Slender Body theory, has been used and also modified to simulate the mechanical behaviour of single- and double-cross-linked biopolymer networks (hydrogel) under…

Soft Condensed Matter · Physics 2026-05-06 Nasrollah Hajaliakbari , David Head , Oliver Harlen

The present paper suggests a new approach for geometric representation of 3D spatial models and provides a new compression algorithm for 3D meshes, which is based on mathematical theory of convex geometry. In our approach we represent a 3D…

Computational Geometry · Computer Science 2013-08-13 Rafik Aramyan , Gagik Mkrtchyan , Arman Karapetyan

A new predictor-corrector type incremental algorithm is proposed for the exact construction of weighted straight skeletons of 2D general planar polygons of arbitrary complexity based on the notion of deforming polygon. In the proposed…

Computational Geometry · Computer Science 2020-11-18 Baris Irhan

Cellular mechanics plays an important role in epithelial morphogenesis, a process wherein cells reshape and rearrange to produce tissue-scale deformations. However, the study of tissue-scale mechanics is impaired by the difficulty of direct…

Cell Behavior · Quantitative Biology 2020-04-01 Nicholas Noll , Sebastian J. Streichan , Boris I. Shraiman

In this paper, a micro-mechanical model is introduce to characterize the stress softening phenomenon in double network hydrogels. Damage in polymer matrices under deformation, which appears as the rupture of cross-linking, is assumed to…

Applied Physics · Physics 2017-12-22 İsmail Doğan Külcü , Roozbeh Dargazany

Momentum space transformations for incommensurate 2D electronic structure calculations are fundamental for reducing computational cost and for representing the data in a more physically motivating format, as exemplified in the…

Numerical Analysis · Mathematics 2023-09-04 Daniel Massatt , Stephen Carr , Mitchell Luskin