2015
DOI: 10.1016/j.cma.2014.10.008
|View full text |Cite
|
Sign up to set email alerts
|

Efficient numerical computations of yield stress fluid flows using second-order cone programming

Abstract: International audienceThis work addresses the numerical computation of the two-dimensional flow of yield stress fluids (with Bingham and Herschel-Bulkley models) based on a variational approach and a finite element discretization. The main goal of this paper is to propose an alternative op-timization method to existing procedures such as penalization and augmented Lagrangian techniques. It is shown that the minimum principle for Bingham and Herschel-Bulkley yield stress fluid steady flows can, indeed, be formu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
50
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 41 publications
(51 citation statements)
references
References 22 publications
(32 reference statements)
1
50
0
Order By: Relevance
“…It usually requires reformulating the considered problem as the minimization of a linear function under specific convex constraints: linear equality/inequality constraints for LP, second-order cone constraints for SOCP and semi-definite constraints for SDP. As shown in [12], the viscoplastic problem can be rewritten into a second-order cone program by introducing additional optimization variables and conic constraints to fit the standard formulation required by industrial IP softwares like Mosek. However, we will take advantage of the particular structure of the problem, namely an objective function which can be decomposed into a smooth (viscous) and a non-smooth (plastic) part to reformulate only the non-smooth part using second-order cone constraints and keep the non-linear but smooth part of the objective function as such.…”
Section: Second-order Cone Programming Formulation and Optimality Conmentioning
confidence: 99%
See 4 more Smart Citations
“…It usually requires reformulating the considered problem as the minimization of a linear function under specific convex constraints: linear equality/inequality constraints for LP, second-order cone constraints for SOCP and semi-definite constraints for SDP. As shown in [12], the viscoplastic problem can be rewritten into a second-order cone program by introducing additional optimization variables and conic constraints to fit the standard formulation required by industrial IP softwares like Mosek. However, we will take advantage of the particular structure of the problem, namely an objective function which can be decomposed into a smooth (viscous) and a non-smooth (plastic) part to reformulate only the non-smooth part using second-order cone constraints and keep the non-linear but smooth part of the objective function as such.…”
Section: Second-order Cone Programming Formulation and Optimality Conmentioning
confidence: 99%
“…However, we will take advantage of the particular structure of the problem, namely an objective function which can be decomposed into a smooth (viscous) and a non-smooth (plastic) part to reformulate only the non-smooth part using second-order cone constraints and keep the non-linear but smooth part of the objective function as such. This leads to an important saving on the number of auxiliary variables compared to what has been proposed in [12].…”
Section: Second-order Cone Programming Formulation and Optimality Conmentioning
confidence: 99%
See 3 more Smart Citations