pith. machine review for the scientific record. sign in

arxiv: 2605.11994 · v1 · submitted 2026-05-12 · 🧮 math.NA · cs.NA

Recognition: 2 theorem links

· Lean Theorem

The SiMPL Method for Multi-Material Topology Optimization

Brendan Keith, Dohyun Kim, Peter Gangl, Thomas M. Surowiec

Pith reviewed 2026-05-13 04:36 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords multi-material topology optimizationdensity-based methodsmirror descentBregman divergencepolytopal constraintsstructural designanisotropic materialsmagnetic flux optimization
0
0 comments X

The pith

The SiMPL method generates a sequence of valid multi-material designs by penalizing each iterate with a geometry-based distance function.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces the SiMPL method to solve multi-material topology optimization problems. It combines mirror descent ideas with constraints that require only one material choice at each point in the design space. The approach creates improving designs by measuring and penalizing deviations from the prior step using a distance function matched to the allowed combinations of materials. This keeps every intermediate design strictly valid on a point-by-point basis. Global limits such as total material usage are then satisfied by solving a small separate optimization problem, which simplifies implementation and supports use in structural and electromagnetic design tasks.

Core claim

By penalizing the design space around the previous iterate with a Bregman divergence tailored to the convex geometry of the n-dimensional polytope, the framework generates a descending sequence of iterates that strictly satisfies the point-wise constraints. Global constraints such as bounds on structural mass are then enforced by solving a small finite-dimensional dual problem. The resulting algorithm is simple to implement and shows robustness and efficiency when paired with an Armijo-type line search, as demonstrated on problems involving isotropic and anisotropic materials as well as magnetic flux optimization.

What carries the argument

The Bregman divergence, a generalized distance function matched to the geometry of the material-choice polytope, which smooths the landscape and enforces local feasibility at each step.

If this is right

  • Every iterate satisfies point-wise material constraints by construction, removing the need for separate feasibility fixes.
  • Global constraints are met by solving one small dual problem after the main sequence is generated.
  • The method applies directly to structural designs using both isotropic and anisotropic materials.
  • It extends to magnetic flux optimization tasks such as those arising in electric motors.
  • Robustness follows when the main loop is combined with an Armijo line search.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same penalization idea could be tested on other engineering problems that require discrete choices at many locations, such as fluid or thermal layout tasks.
  • Adopting this approach might reduce or eliminate post-processing steps that currently enforce material purity in final designs.
  • The built-in feasibility could make it practical to optimize significantly larger three-dimensional structures than current methods allow.
  • Similar distance-based updates might improve performance in other constrained optimization settings outside topology design.

Load-bearing premise

That the chosen distance function can be evaluated quickly for large problems and that the sequence reaches a useful optimum without further regularization or post-processing.

What would settle it

Running the algorithm on a standard multi-material benchmark problem and verifying that every spatial point in the final design uses exactly one material while the objective value decreases at each iteration.

Figures

Figures reproduced from arXiv: 2605.11994 by Brendan Keith, Dohyun Kim, Peter Gangl, Thomas M. Surowiec.

Figure 1
Figure 1. Figure 1: Polytopes parametrized using ∇R∗ (ψ); cf. Theorem 3.6. (a) A hexagon and (b) a bipyramid with an octagonal base. Colors indicate the magnitude of the latent variable |ψ|. This relationship allows us to define a latent variable ψ ∈ L∞(Ω; R n) parameterizing the design variable via η = ∇R∗ (ψ). In turn, the update rule (3.3) becomes ψ k+1/2 = ψ k − αk∇F(η k (3.4a) ), ψ k+1 = ψ k+1/2 − W⊤µ k (3.4b) , where µ … view at source ↗
Figure 2
Figure 2. Figure 2: Optimized designs for compliance minimization using isotropic materials with [PITH_FULL_IMAGE:figures/full_fig_p016_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Convergence history for (a) compliance F(η k ), (b) gap residual resk, and (c) step size αk for 2D compliance minimization with isotropic materials. of h = 2−8 . The indicator space is discretized using piecewise constant elements, while both the filtered indicator space and the displacement space are approximated using continuous piecewise bilinear elements. The optimal design for each interpolation schem… view at source ↗
Figure 4
Figure 4. Figure 4: (a) Optimized design for compliance minimization using orthotropic material [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Optimization of electric motor: (a) Cross-section of the sector of an electric [PITH_FULL_IMAGE:figures/full_fig_p020_5.png] view at source ↗
read the original abstract

We introduce an efficient and scalable method for density-based multi-material topology optimization, integrating classical mirror descent techniques with point-wise polytopal design constraints. Such constraints arise naturally in this class of problems, wherein the vertices of convex polytopes correspond to distinct design states, only one of which should be occupied at each point in space. The framework generates a descending sequence of iterates by penalizing the design space around the previous iterate with a generalized distance function tailored to the convex geometry of the $n$-dimensional polytope. This distance function, called a Bregman divergence, smooths the optimization landscape, ensuring that each iterate strictly satisfies the point-wise constraints. Subsequently, global constraints (e.g., bounds on the structural mass) can be enforced easily by solving a small, finite-dimensional dual problem. The resulting method is simple to implement and demonstrates robustness and efficiency when combined with an Armijo-type line search algorithm. We validate the method in structural design problems involving the optimal arrangement of both isotropic and anisotropic materials, as well as magnetic flux optimization in electric motors.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 1 minor

Summary. The paper introduces the SiMPL method for density-based multi-material topology optimization. It integrates classical mirror descent with Bregman divergences adapted to the convex geometry of n-dimensional polytopes (whose vertices represent distinct material states) to generate a descending sequence of iterates that strictly satisfy point-wise constraints. Global constraints such as mass bounds are then enforced via an inexpensive finite-dimensional dual correction. The approach is combined with an Armijo line search and is validated on structural problems involving isotropic and anisotropic materials as well as magnetic flux optimization in electric motors.

Significance. If the central algorithmic claims hold, the method supplies a theoretically grounded and implementable framework for multi-material topology optimization that directly exploits the polytopal structure of the design space to enforce feasibility without penalties or post-processing. Its reliance on standard mirror-descent theory and a small dual problem for global constraints is a clear strength, and the absence of free parameters (as indicated by the construction) enhances reproducibility. Successful validation across structural and electromagnetic applications would position SiMPL as a practical alternative to existing projection or relaxation techniques in engineering optimization.

major comments (3)
  1. [Abstract] Abstract: the claim that the Bregman divergence 'ensures that each iterate strictly satisfies the point-wise constraints' is load-bearing for the entire framework, yet the abstract supplies neither the explicit form of the divergence nor a derivation showing strict feasibility; without this in the main text the descent property cannot be verified.
  2. [Abstract] Abstract and validation description: the manuscript states that the method 'demonstrates robustness and efficiency' on structural and magnetic problems but provides no quantitative metrics, mesh sizes, iteration counts, or comparisons with existing multi-material methods; this absence prevents assessment of the scalability claim central to the contribution.
  3. [Method] Method outline: although the construction is internally consistent with mirror-descent theory, no convergence analysis, sufficient-decrease guarantee under the Armijo rule, or error bound is referenced; for a paper in numerical analysis (math.NA) these are required to substantiate that the sequence converges to a useful optimum.
minor comments (1)
  1. [Abstract] Abstract: the phrase 'n-dimensional polytope' would benefit from an immediate concrete example (e.g., the 3-simplex for three materials) to aid readers unfamiliar with the geometry.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive and detailed report. The comments highlight important aspects for clarity, completeness, and suitability for a numerical analysis venue. We address each major comment point by point below and propose targeted revisions to strengthen the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim that the Bregman divergence 'ensures that each iterate strictly satisfies the point-wise constraints' is load-bearing for the entire framework, yet the abstract supplies neither the explicit form of the divergence nor a derivation showing strict feasibility; without this in the main text the descent property cannot be verified.

    Authors: The explicit form of the Bregman divergence (adapted to the n-dimensional polytope via a suitable barrier function) and the proof that the mirror-descent update strictly preserves point-wise feasibility are derived in Section 3 of the main text, specifically in the statement and proof of the feasibility preservation property following the definition of the update rule. The abstract is intentionally concise and therefore omits these details. We will revise the abstract to include a brief parenthetical reference to the specific divergence and the feasibility result, while leaving the full derivation in the main text where it belongs. revision: yes

  2. Referee: [Abstract] Abstract and validation description: the manuscript states that the method 'demonstrates robustness and efficiency' on structural and magnetic problems but provides no quantitative metrics, mesh sizes, iteration counts, or comparisons with existing multi-material methods; this absence prevents assessment of the scalability claim central to the contribution.

    Authors: The abstract is a high-level summary and therefore does not contain numerical details. The full manuscript reports concrete results in Sections 5–6, including mesh resolutions, iteration counts, objective values, and comparisons against standard multi-material SIMP variants. To improve accessibility, we will augment the abstract with one or two representative quantitative highlights (e.g., typical iteration counts and mesh sizes) and ensure that a compact summary table of performance metrics appears early in the results section. revision: yes

  3. Referee: [Method] Method outline: although the construction is internally consistent with mirror-descent theory, no convergence analysis, sufficient-decrease guarantee under the Armijo rule, or error bound is referenced; for a paper in numerical analysis (math.NA) these are required to substantiate that the sequence converges to a useful optimum.

    Authors: We agree that an explicit convergence discussion is expected in a math.NA paper. The current manuscript relies on standard mirror-descent theory but does not spell out the sufficient-decrease property under the Armijo line search or provide an error bound. We will add a short dedicated subsection (approximately one page) that (i) recalls the relevant convergence theorem for mirror descent with Bregman divergences on convex sets, (ii) proves the sufficient-decrease guarantee guaranteed by the Armijo rule, and (iii) derives a simple a-posteriori error bound based on the duality gap of the global-constraint correction step. Appropriate references to the mirror-descent literature will be included. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The SiMPL framework is assembled from standard mirror-descent updates on convex polytopes, using a Bregman divergence chosen to match the geometry of the design simplex so that each iterate remains feasible by construction; the subsequent dual correction for global constraints and the Armijo line search are conventional safeguards whose descent guarantees follow from established convex-optimization theory rather than from any fitted parameter or self-referential definition inside the paper. No equation reduces a claimed performance metric to an input that was itself obtained by fitting the same quantity, and no load-bearing step rests on a uniqueness theorem or ansatz imported solely via self-citation. The derivation therefore remains self-contained against external benchmarks of mirror descent and convex geometry.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The approach rests on standard convex-optimization assumptions and the existence of a suitable Bregman divergence for the material polytope; no new entities or fitted constants are introduced in the abstract.

axioms (2)
  • domain assumption Material choices at each point correspond to vertices of a convex polytope, with only one vertex occupied.
    Explicitly stated as arising naturally in the problem class.
  • domain assumption A Bregman divergence exists that is tailored to the polytope geometry and can be used to generate strictly feasible iterates.
    Central to the smoothing step described in the abstract.

pith-pipeline@v0.9.0 · 5486 in / 1295 out tokens · 46987 ms · 2026-05-13T04:36:15.303197+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

Reference graph

Works this paper leans on

64 extracted references · 64 canonical work pages

  1. [1]

    2025 , eprint =

    A novel multi-thickness topology optimization method for balancing structural performance and manufacturability , author =. 2025 , eprint =

    work page 2025

  2. [2]

    1970 , publisher =

    Convex Analysis , author =. 1970 , publisher =

    work page 1970

  3. [3]

    Mirror descent and nonlinear projected subgradient methods for convex optimization , volume =

    Beck, Amir and Teboulle, Marc , year =. Mirror descent and nonlinear projected subgradient methods for convex optimization , volume =. Operations Research Letters , publisher =. doi:10.1016/s0167-6377(02)00231-6 , number =

    work page doi:10.1016/s0167-6377(02)00231-6

  4. [4]

    Larsen, S. D. and Sigmund, O. and Groen, J. P. , journal =. Optimal truss and frame design from projected homogenization-based topology optimization , year =. doi:10.1007/s00158-018-1948-9 , refid =

    work page doi:10.1007/s00158-018-1948-9 1948

  5. [5]

    On approaches for avoiding low-stiffness regions in variable thickness sheet and homogenization-based topology optimization , year =

    Giele, Reinier and Groen, Jeroen and Aage, Niels and Andreasen, Casper Schousboe and Sigmund, Ole , journal =. On approaches for avoiding low-stiffness regions in variable thickness sheet and homogenization-based topology optimization , year =. doi:10.1007/s00158-021-02933-z , refid =

    work page doi:10.1007/s00158-021-02933-z

  6. [6]

    Multi-material topology optimization using ordered

    Zuo, Wenjie and Saitou, Kazuhiro , journal =. Multi-material topology optimization using ordered. 2017 , issn =. doi:10.1007/s00158-016-1513-3 , refid =

    work page doi:10.1007/s00158-016-1513-3 2017

  7. [7]

    and Lund, E

    Stegmann, J. and Lund, E. , journal =. Discrete material optimization of general composite shell structures , year =. doi:https://doi.org/10.1002/nme.1259 , keywords =

    work page doi:10.1002/nme.1259

  8. [8]

    On structural optimization of composite shell structures using a discrete constitutive parametrization , year =

    Lund, Erik and Stegmann, Jan , journal =. On structural optimization of composite shell structures using a discrete constitutive parametrization , year =. doi:https://doi.org/10.1002/we.132 , keywords =

    work page doi:10.1002/we.132

  9. [9]

    Material interpolation schemes for unified topology and multi-material optimization , year =

    Hvejsel, Christian Frier and Lund, Erik , journal =. Material interpolation schemes for unified topology and multi-material optimization , year =. doi:10.1007/s00158-011-0625-z , refid =

    work page doi:10.1007/s00158-011-0625-z

  10. [10]

    doi:10.48550/arXiv.2107.08011 , title =

    Antonakopoulos, Kimon and Mertikopoulos, Panayotis , booktitle =. doi:10.48550/arXiv.2107.08011 , title =

    work page doi:10.48550/arxiv.2107.08011

  11. [11]

    doi:10.1142/9789812815750_0009 , year =

    Nonlinearity and Functional Analysis: Lectures on Nonlinear Problems in Mathematical Analysis , author =. doi:10.1142/9789812815750_0009 , year =

    work page doi:10.1142/9789812815750_0009

  12. [12]

    1988 , issn =

    Generating optimal topologies in structural design using a homogenization method , journal =. 1988 , issn =. doi:10.1016/0045-7825(88)90086-2 , author =

    work page doi:10.1016/0045-7825(88)90086-2 1988

  13. [13]

    and Bolte, J\'

    Bauschke, Heinz H. and Bolte, J\'. A Descent Lemma Beyond. Mathematics of Operations Research , volume =. 2017 , doi =

    work page 2017

  14. [14]

    B. S. Lazarov and O. Sigmund , title =. Numerical Methods in Engineering , volume =. 2011 , pages =

    work page 2011

  15. [15]

    Lazarov and Mattias Schevenels , keywords =

    Oded Amir and Ole Sigmund and Boyan S. Lazarov and Mattias Schevenels , keywords =. Efficient reanalysis techniques for robust topology optimization , journal =. 2012 , doi =

    work page 2012

  16. [16]

    and Svanberg, K

    Stolpe, M. and Svanberg, K. , date =. An alternative interpolation scheme for minimum compliance topology optimization , volume =. Structural and Multidisciplinary Optimization , number =. doi:10.1007/s001580100129 , id =

    work page doi:10.1007/s001580100129

  17. [17]

    International Journal for Numerical Methods in Engineering , volume =

    Bourdin, Blaise , title =. International Journal for Numerical Methods in Engineering , volume =. doi:10.1002/nme.116 , year =

    work page doi:10.1002/nme.116

  18. [18]

    , date =

    Sigmund, O. , date =. A 99 line topology optimization code written in. Structural and Multidisciplinary Optimization , number =. doi:10.1007/s001580050176 , id =

    work page doi:10.1007/s001580050176

  19. [19]

    On Equivalence Between Optimality Criteria and Projected Gradient Methods with Application to Topology Optimization Problem , volume =

    Ananiev, Sergey , date =. On Equivalence Between Optimality Criteria and Projected Gradient Methods with Application to Topology Optimization Problem , volume =. Multibody System Dynamics , number =. doi:10.1007/s11044-005-2530-y , id =

    work page doi:10.1007/s11044-005-2530-y

  20. [20]

    , date =

    Zillober, C. , date =. A globally convergent version of the method of moving asymptotes , volume =. Structural optimization , number =. doi:10.1007/BF01743509 , id =

    work page doi:10.1007/bf01743509

  21. [21]

    Topology Optimization , doi =

    Bends. Topology Optimization , doi =. 2004 , address =

    work page 2004

  22. [22]

    International Journal for Numerical Methods in Engineering , volume =

    Svanberg, Krister , title =. International Journal for Numerical Methods in Engineering , volume =. doi:10.1002/nme.1620240207 , year =

    work page doi:10.1002/nme.1620240207

  23. [23]

    2023 , eprint =

    Proximal Galerkin: A structure-preserving finite element method for pointwise bound constraints , author =. 2023 , eprint =

    work page 2023

  24. [24]

    , title = "

    BARZILAI, JONATHAN and BORWEIN, JONATHAN M. , title = ". IMA Journal of Numerical Analysis , volume =. 1988 , month =

    work page 1988

  25. [25]

    A simplified view of first order methods for optimization , volume =

    Teboulle, Marc , date =. A simplified view of first order methods for optimization , volume =. Mathematical Programming , number =. doi:10.1007/s10107-018-1284-2 , id =

    work page doi:10.1007/s10107-018-1284-2

  26. [26]

    Krister Svanberg , title =

    work page

  27. [27]

    Topology optimization using

    Aage, Niels and Andreassen, Erik and Lazarov, Boyan Stefanov , date-added =. Topology optimization using. Structural and Multidisciplinary Optimization , number =. doi:10.1007/s00158-014-1157-0 , id =

    work page doi:10.1007/s00158-014-1157-0

  28. [28]

    One-shot procedures for efficient minimum compliance topology optimization , volume =

    Amir, Oded , date-added =. One-shot procedures for efficient minimum compliance topology optimization , volume =. Structural and Multidisciplinary Optimization , number =. doi:10.1007/s00158-024-03763-5 , id =

    work page doi:10.1007/s00158-024-03763-5

  29. [29]

    Topology optimization of multi-story buildings under fully non-stationary stochastic seismic ground motion , volume =

    Angelucci, Giulia and Quaranta, Giuseppe and Mollaioli, Fabrizio , date =. Topology optimization of multi-story buildings under fully non-stationary stochastic seismic ground motion , volume =. Structural and Multidisciplinary Optimization , number =. doi:10.1007/s00158-022-03319-5 , id =

    work page doi:10.1007/s00158-022-03319-5

  30. [30]

    Bridge topology optimisation with stress, displacement and frequency constraints , doi =

    Guan, Hong and Chen, Yin-Jung and Loo, Yew-Chaye and Xie, Yi-Min and Steven, Grant P , journal =. Bridge topology optimisation with stress, displacement and frequency constraints , doi =. 2003 , publisher =

    work page 2003

  31. [31]

    High-performance finite elements with

    Julian Andrej and Nabil Atallah and Jan-Phillip B\". High-performance finite elements with. 2024 , eprint =

    work page 2024

  32. [32]

    2020 , month =

    Modular Finite Element Methods , author =. 2020 , month =. doi:10.11578/dc.20200303.5 , howpublished =

    work page doi:10.11578/dc.20200303.5 2020

  33. [33]

    INFORMS Journal on Optimization , volume =

    Lu, Haihao , title =. INFORMS Journal on Optimization , volume =. 2019 , doi =

    work page 2019

  34. [34]

    2004 , issn =

    Structural optimization using sensitivity analysis and a level-set method , journal =. 2004 , issn =. doi:10.1016/j.jcp.2003.09.032 , author =

    work page doi:10.1016/j.jcp.2003.09.032 2004

  35. [35]

    On the (non-)optimality of Michell structures , volume =

    Sigmund, Ole and Aage, Niels and Andreassen, Erik , year =. On the (non-)optimality of Michell structures , volume =. Structural and Multidisciplinary Optimization , publisher =. doi:10.1007/s00158-016-1420-7 , number =

    work page doi:10.1007/s00158-016-1420-7

  36. [36]

    , howpublished =

    Kim, D. , howpublished =

    work page

  37. [37]

    Lazarov and Thomas M

    Brendan Keith and Dohyun Kim and Boyan S. Lazarov and Thomas M. Surowiec , year =. Analysis of the. SIAM Journal on Optimization , number =

    work page

  38. [38]

    Lazarov and Thomas M

    Dohyun Kim and Boyan S. Lazarov and Thomas M. Surowiec and Brendan Keith , year =. A simple introduction to the. Structural and Multidisciplinary Optimization , volume =

    work page

  39. [39]

    and Dykstra, Richard L

    Boyle, James P. and Dykstra, Richard L. , year =. A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , ISBN =. doi:10.1007/978-1-4613-9940-7_3 , booktitle =

    work page doi:10.1007/978-1-4613-9940-7_3

  40. [40]

    Dykstras algorithm with

    Bauschke, Heinz H and Lewis, Adrian S , year =. Dykstras algorithm with. Optimization , publisher =. doi:10.1080/02331930008844513 , number =

    work page doi:10.1080/02331930008844513

  41. [41]

    2025 , issn =

    The latent variable proximal point algorithm for variational problems with inequality constraints , journal =. 2025 , issn =. doi:https://doi.org/10.1016/j.cma.2025.118181 , author =

    work page doi:10.1016/j.cma.2025.118181 2025

  42. [42]

    Tyrrell and Wets, Roger J

    Rockafellar, R. Tyrrell and Wets, Roger J. B. , year =. Variational Analysis , ISBN =. doi:10.1007/978-3-642-02431-3 , publisher =

    work page doi:10.1007/978-3-642-02431-3

  43. [43]

    , title =

    Sukumar, N. , title =. International Journal for Numerical Methods in Engineering , volume =. doi:https://doi.org/10.1002/nme.1193 , year =

    work page doi:10.1002/nme.1193

  44. [44]

    IEEE Transactions on Magnetics , title =

    Cherri\`. IEEE Transactions on Magnetics , title =. 2025 , volume =

    work page 2025

  45. [45]

    and Combettes, Patrick L

    Bauschke, Heinz H. and Combettes, Patrick L. , year =. Convex Analysis and Monotone Operator Theory in Hilbert Spaces , ISBN =. doi:10.1007/978-3-319-48311-5 , journal =

    work page doi:10.1007/978-3-319-48311-5

  46. [46]

    and Jarratt, P

    Dowell, M. and Jarratt, P. , year =. A modified regula falsi method for computing the root of an equation , volume =. BIT , publisher =. doi:10.1007/bf01934364 , number =

    work page doi:10.1007/bf01934364

  47. [47]

    SIAM Journal on Imaging Sciences , volume =

    Beck, Amir and Teboulle, Marc , title =. SIAM Journal on Imaging Sciences , volume =. 2009 , doi =

    work page 2009

  48. [48]

    and Lu, Peihuang and Nocedal, Jorge , title =

    Zhu, Ciyou and Byrd, Richard H. and Lu, Peihuang and Nocedal, Jorge , title =. ACM Trans. Math. Softw. , month = dec, pages =. 1997 , issue_date =. doi:10.1145/279232.279236 , abstract =

    work page doi:10.1145/279232.279236 1997

  49. [49]

    2014 , publisher =

    Variational analysis in Sobolev and BV spaces: applications to PDEs and optimization , author =. 2014 , publisher =

    work page 2014

  50. [50]

    Multi-material topology optimization using Wachspress interpolations for designing a 3-phase electrical machine stator , volume =

    Cherrière, Théodore and Laurent, Luc and Hlioui, Sami and Louf, Fran. Multi-material topology optimization using Wachspress interpolations for designing a 3-phase electrical machine stator , volume =. Structural and Multidisciplinary Optimization , publisher =. doi:10.1007/s00158-022-03460-1 , number =

    work page doi:10.1007/s00158-022-03460-1

  51. [51]

    The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential , journal =

    De Loera, Jes\'. The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential , journal =. 2020 , doi =

    work page 2020

  52. [52]

    doi:10.1016/bs.hna.2020.10.004 , author =

    2021 , title =. doi:10.1016/bs.hna.2020.10.004 , author =

    work page doi:10.1016/bs.hna.2020.10.004 2021

  53. [53]

    and Dapogny, C

    Allaire, G. and Dapogny, C. and Delgado, G. and Michailidis, G. , title =. ESAIM: Control, Optimisation and Calculus of Variations , pages =. 2014 , publisher =. doi:10.1051/cocv/2013076 , zbl =

    work page doi:10.1051/cocv/2013076 2014

  54. [54]

    Frédéric and Shapiro, Alexander , year =

    Bonnans, J. Frédéric and Shapiro, Alexander , year =. Perturbation Analysis of Optimization Problems , ISBN =. doi:10.1007/978-1-4612-1394-9 , publisher =

    work page doi:10.1007/978-1-4612-1394-9

  55. [55]

    10.1051/cocv/2022078

    An abstract Lagrangian framework for computing shape derivatives , DOI = "10.1051/cocv/2022078", url = "https://doi.org/10.1051/cocv/2022078", journal =

    work page doi:10.1051/cocv/2022078

  56. [56]

    Analysis and application of a lower envelope method for sharp-interface multiphase problems , url =

    Laurain, Antoine , doi =. Analysis and application of a lower envelope method for sharp-interface multiphase problems , url =. Control and Cybernetics , number =

    work page

  57. [57]

    Gangl , keywords =

    P. Gangl , keywords =. A multi-material topology optimization algorithm based on the topological derivative , journal =. 2020 , issn =. doi:https://doi.org/10.1016/j.cma.2020.113090 , url =

    work page doi:10.1016/j.cma.2020.113090 2020

  58. [58]

    Extended level set method: A multiphase representation with perfect symmetric property, and its application to multi-material topology optimization , journal =

    Masaki Noda and Yuki Noguchi and Takayuki Yamada , keywords =. Extended level set method: A multiphase representation with perfect symmetric property, and its application to multi-material topology optimization , journal =. 2022 , issn =. doi:https://doi.org/10.1016/j.cma.2022.114742 , url =

    work page doi:10.1016/j.cma.2022.114742 2022

  59. [59]

    and Hinterm\"

    Adam, L. and Hinterm\". A. Optimization and Engineering , publisher =. 2018 , month = jul, pages =. doi:10.1007/s11081-018-9394-5 , number =

    work page doi:10.1007/s11081-018-9394-5 2018

  60. [60]

    2025 , eprint =

    Multi-material structural optimization for additive manufacturing based on a phase field approach , author =. 2025 , eprint =

    work page 2025

  61. [61]

    and Sigmund, Ole , year =

    Bendsøe, Martin P. and Sigmund, Ole , year =. Topology Optimization , ISBN =. doi:10.1007/978-3-662-05086-6 , publisher =

    work page doi:10.1007/978-3-662-05086-6

  62. [62]

    Monotonicity-preserving interproximation of

    Clemens Pechstein and Bert Jüttler , doi =. Monotonicity-preserving interproximation of. Journal of Computational and Applied Mathematics , keywords =

    work page

  63. [63]

    Optimization of a Multiphysics Problem in Semiconductor Laser Design , volume =

    Adam, Luk\'. Optimization of a Multiphysics Problem in Semiconductor Laser Design , volume =. SIAM Journal on Applied Mathematics , publisher =. 2019 , month = jan, pages =. doi:10.1137/18m1179183 , number =

    work page doi:10.1137/18m1179183 2019

  64. [64]

    1974 , publisher=

    Conjugate duality and optimization , author=. 1974 , publisher=

    work page 1974