SearcharxivSearch

arXiv · 2605.06011

Distortion-minimized de-homogenization for optimization of cell-size distribution in TPMS structures

Abstract

This paper presents a homogenized topology optimization (TO) method for spatially optimizing cell-size distribution of triply-periodic minimal surface (TPMS) structures, with high accuracy in the optimized structural response after de-homogenization. To achieve this, we introduce a novel de-homogenization technique that directly minimizes the difference between the wavenumbers obtained from the target and actual size distributions. This minimization problem is efficiently solved as a typical Poisson's equation utilizing the discrete cosine transform. We first verify the proposed de-homogenization method through numerical examples, showcasing its capability in significantly reducing the known distortion of the de-homogenized TPMS structures from the conventional periodic modulation (PM) method. Then, we apply the proposed method to a stiffness maximization problem, to demonstrate its effectiveness in improving the structural response compared to the PM method. The proposed method successfully reduced the distortion of the de-homogenized structures compared to the PM method, leading to 0.8% difference in the strain energy compared to the homogenized model, as opposed to 63.6% difference in the PM method. The optimized structure from the proposed method shows a significant improvement in the strain energy by 50.1% compared to the uniform case in the FE analysis on the de-homogenized models, while the PM method results in a significant decrease of 45.8%. The experimental validation shows that the effective stiffness of the optimized structure from the proposed method is 54.2% higher than that of the uniform case, while the PM method results in a significant decrease by 77.3%. These results exhibit the proposed method effectively increases the accuracy of the de-homogenization, thereby maximizing the potential of the homogenized TO for the spatial cell-size optimization of TPMS structures.

Explore related subjects

Keep this discovery

BibTeXRIS

Hiroki Kawabe, Kaito Ohtani, Yusibo Yang, Musaddiq Al Ali, Kentaro Yaji. 2026-05-07. Distortion-minimized de-homogenization for optimization of cell-size distribution in TPMS structures. https://doi.org/10.1016/j.addma.2026.105311

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC