Topology optimization considering contact and stress constraints

Abstract This work advances the field of stress-constrained topology optimization by addressing frictionless unilateral contact problems. The approach focuses on minimizing mass of a contact-constrained structure while enforcing stress-constraints using local or global stress measures. Various contact coupling techniques, i.e. node-to-surface and surface-to-surface formulations, are examined and implemented using Lagrange multipliers or penalty methods. The study emphasizes the importance of accurately modeling contact surface geometries as discretization errors at these surfaces can dominate computed stresses and adversely affect optimization outcomes. Blending functions are introduced to mitigate this issue by enabling exact consideration of contact surface geometry without incurring the prohibitive computational costs associated with very fine discretizations. The results demonstrate that surface-to-surface contact methods outperform node-to-segment approaches due to their superior convergence properties and ability to pass the patch test. Additionally, a detailed comparison of augmented Lagrangian and aggregation-based stress-constraint enforcement reveals the superiority of augmented Lagrangian methods for the contact problem. Finally, a weighted augmented Lagrangian approach is proposed to resolve convergence issues in challenging contact scenarios.

Authors

Institutions

Publication Details

Journal
Computers & Structures
Published
2026-08-28
DOI
https://doi.org/10.1016/j.compstruc.2026.108387
Primary Topic
Advanced Numerical Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Topology optimization considering contact and stress constraints

Robert Seifried, Timo Schmidt, Tom Klare
Computers & Structures
Advanced Numerical Analysis Techniques
article

Topology optimization considering contact and stress constraints

Robert Seifried, Timo Schmidt, Tom Klare
article en

Abstract

Abstract This work advances the field of stress-constrained topology optimization by addressing frictionless unilateral contact problems. The approach focuses on minimizing mass of a contact-constrained structure while enforcing stress-constraints using local or global stress measures. Various contact coupling techniques, i.e. node-to-surface and surface-to-surface formulations, are examined and implemented using Lagrange multipliers or penalty methods. The study emphasizes the importance of accurately modeling contact surface geometries as discretization errors at these surfaces can dominate computed stresses and adversely affect optimization outcomes. Blending functions are introduced to mitigate this issue by enabling exact consideration of contact surface geometry without incurring the prohibitive computational costs associated with very fine discretizations. The results demonstrate that surface-to-surface contact methods outperform node-to-segment approaches due to their superior convergence properties and ability to pass the patch test. Additionally, a detailed comparison of augmented Lagrangian and aggregation-based stress-constraint enforcement reveals the superiority of augmented Lagrangian methods for the contact problem. Finally, a weighted augmented Lagrangian approach is proposed to resolve convergence issues in challenging contact scenarios.

Computers & StructuresVol. 331
Universität Hamburg (DE), Hamburg University of Technology (DE)
Openalex Percentile: Top 99%
Advanced Numerical Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.