TY - GEN
T1 - A recursive trust-region method for non-convex constrained minimization
AU - Groß, Christian
AU - Krause, Rolf
PY - 2009
Y1 - 2009
N2 - The mathematical modelling of mechanical or biomechanical problems involving large deformations or biological materials often leads to highly nonlinear and constrained minimization problems. For instance, the simulation of soft-tissues, as the deformation of skin, gives rise to a highly non-linear PDE with constraints, which constitutes the first order condition for a minimizer of the corresponding non-linear energy functional. Besides of the pure deformation of the tissue, bones and muscles have a restricting effect on the deformation of the considered material, leading to additional constraints. Although PDEs are usually formulated in the context of Sobolev spaces, their numerical solution is carried out using discretizations as, e.g., finite elements. Thus, in the present work we consider the following finite dimensional constrained minimization problem: u ε B : J (u) =min! where B= {v ε ℝ n | Q ≤ v ≤ Q̄} and Q < Q̄ ε ℝ n and the possibly nonconvex, but differentiable, objective function J : ℝ n → ℝ . Here, the occurring inequalities are to be understood pointwise. In the context of discretized PDEs, n corresponds to the dimension of the finite element space and may therefore be very large.
AB - The mathematical modelling of mechanical or biomechanical problems involving large deformations or biological materials often leads to highly nonlinear and constrained minimization problems. For instance, the simulation of soft-tissues, as the deformation of skin, gives rise to a highly non-linear PDE with constraints, which constitutes the first order condition for a minimizer of the corresponding non-linear energy functional. Besides of the pure deformation of the tissue, bones and muscles have a restricting effect on the deformation of the considered material, leading to additional constraints. Although PDEs are usually formulated in the context of Sobolev spaces, their numerical solution is carried out using discretizations as, e.g., finite elements. Thus, in the present work we consider the following finite dimensional constrained minimization problem: u ε B : J (u) =min! where B= {v ε ℝ n | Q ≤ v ≤ Q̄} and Q < Q̄ ε ℝ n and the possibly nonconvex, but differentiable, objective function J : ℝ n → ℝ . Here, the occurring inequalities are to be understood pointwise. In the context of discretized PDEs, n corresponds to the dimension of the finite element space and may therefore be very large.
UR - http://www.scopus.com/inward/record.url?scp=78651539029&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02677-5_13
DO - 10.1007/978-3-642-02677-5_13
M3 - Conference contribution
AN - SCOPUS:78651539029
SN - 9783642026768
T3 - Lecture Notes in Computational Science and Engineering
SP - 137
EP - 144
BT - Domain Decomposition Methods in Science and Engineering XVIII
T2 - 18th International Conference of Domain Decomposition Methods
Y2 - 12 January 2008 through 17 January 2008
ER -