2019
DOI: 10.1007/s11590-019-01409-w
|View full text |Cite
|
Sign up to set email alerts
|

Mixed-integer programming formulation of a data-driven solver in computational elasticity

Abstract: This paper presents a mixed-integer quadratic programming formulation of an existing data-driven approach to computational elasticity. This formulation is suitable for application of a standard mixed-integer programming solver, which finds a global optimal solution. Therefore, the results obtained by the presented method can be used as benchmark instances for any other algorithm. Preliminary numerical experiments are performed to compare quality of solutions obtained by the proposed method and a heuristic used… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 38 publications
(37 citation statements)
references
References 11 publications
0
36
0
Order By: Relevance
“…27(a) porosity values are very close to each other while permeability values differ considerably and so, after some fixed-point iterations, there is a possibility for the solver to be trapped between several choices each selected from a different data set. It is well-known that heuristic approaches, e.g., fixed-point iteration used in our research, may not find the global optima for combinatorial optimization problems [116,117], i.e., trapped between some local minima. As suggested in [116] an alternative optimization problem can be formulated by a relaxation method which makes the optimization problem convex, and consequently, a global optimum is guaranteed.…”
Section: Multifidelity Simulations Of Berea Sandstone Datamentioning
confidence: 99%
“…27(a) porosity values are very close to each other while permeability values differ considerably and so, after some fixed-point iterations, there is a possibility for the solver to be trapped between several choices each selected from a different data set. It is well-known that heuristic approaches, e.g., fixed-point iteration used in our research, may not find the global optima for combinatorial optimization problems [116,117], i.e., trapped between some local minima. As suggested in [116] an alternative optimization problem can be formulated by a relaxation method which makes the optimization problem convex, and consequently, a global optimum is guaranteed.…”
Section: Multifidelity Simulations Of Berea Sandstone Datamentioning
confidence: 99%
“…A class of Data-Driven problems consists of finding the compatible and equilibrated internal state z ∈ E that minimizes the distance to the global material data set D = D 1 × · · · × D M . To this end, we metrize the local phase spaces Z e by means of norms of the form (5) |z e | e = C e e · e + C −1 e σ e · σ e 1/2 , for some symmetric and positive-definite matrices {C e } M e=1 , with corresponding distance (6) d e (z e , y e ) = |z e − y e | e , for y e , z e ∈ Z e . The local norms induce a metrization of the global phase Z by means of the global norm i. e., we wish to find the point y ∈ D in the material data set that is closest to the constraint set E of compatible and equilibrated internal states or, equivalently, we wish to find the compatible and equilibrated internal state z ∈ E that is closest to the material data set D.…”
Section: Materials Data Distance Minimisation Paradigmmentioning
confidence: 99%
“…and z 0 ∈ Z arbitrary, where P D denotes the closest point projection of a point in Z onto D. Iteration (13) first finds the closest point P D z j to z j on the material data set D and then projects the result back to the constraint set E. The iteration is repeated until P D z j+1 = P D z j , i. e., until the data association to points in the material data set remains unchanged. Note that more sophisticated algorithms can be considered to solve this combinatorial optimization problem [6]. Equations (11) define two standard linear elasticity problems, which can be interpreted as follows.…”
Section: Data-driven Simulation Algorithmmentioning
confidence: 99%
“…the strain-stress couples to calculate (in each finite element of the mesh for instance) and the material states database, under the constraints of satisfying both equilibrium equations and compatibility conditions. Slightly different formulations of this solver have been proposed [20,21].…”
Section: Introductionmentioning
confidence: 99%