Search arXivSearch

arXiv · 2501.17214

The Plateau Problem of Michell Trusses and Orthogonality in Springs

Abstract

Given finitely many pointed forces in the plane. Suppose that these forces sum up to zero and their net torques also sum up to zero. One can show that there exists a system of springs whose boundary forces exactly counter-balance these pointed forces. We will generalize to higher dimensions using the Cauchy stress tensor for elastic materials. Given a system of springs, we can multiply the length of each spring with its corresponding spring constant and then sum these products up. The result is called the total mass of the system. We are interested in the Plateau problem of the existence of the minimal spring system given a boundary condition. This minimization problem was first introduced in 1904 by A. Michell. He showed that a minimizer could smear out. The Michell Truss became known in mechanical engineering. It raised attention in optimal design, such as minimizing costs in building bridges. In 1960s and 1970s, the problem was developed using PDE and convex analysis by introducing an equivalent dual maximization problem. In 2008, Bouchitté, Gangbo, and Sppecher introduced lines of principal actions to generalize Hencky-Prandtle net to higher dimensional duality and proved that the minimizer can be found provided that it exists. In the unpublished notes of Gangbo, he also showed that if springs of the same kind are optimal. In this paper, we are going to solve the Plateau problem using two different tools in GMT: first, a minimizer can be viewed as a flat chain complex; second, a minimizer can also be viewed as a current. At the end, we are going to show one progress in discovering the topological properties of minimizers: compressed and stretched springs must be perpendicular to each other at non-boundary points. I appreciate my advisor Prof. Robert Hardt for communicating with me regularly on this problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chengcheng Yang. 2025-02-01. The Plateau Problem of Michell Trusses and Orthogonality in Springs. https://arxiv.org/abs/2501.17214

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC