"Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization"@en . "CIMNE" . "Domain Decomposition Methods in Science and Engineering" . "FETI based domain decomposition turned out to be an efficient tool for the solution of a number of engineering problems including those described by variational inequalities. Our basic algorithm [1,2] combines the active set strategy and augmented Lagrangians with application of the FETI algorithm proposed by Farhat and Roux to the solution of auxiliary linear problems. Starting from the discretized variational inequality, the problem is first reduced by duality to a strictly convex quadratic programming problem with simple bounds and possibly some general equality constraints. Then a variant of the augmented Lagrangian method is used for the solution of the resulting problem that is solved by the algorithm generating the approximations for Lagrange multipliers for the equality constraints in the outer loop while solving the auxiliary quadratic programming problems with simple bounds in the inner loop. The algorithm in the inner loop uses projections and adaptive precision control for the solution o" . . "Barcelona" . . "84-95999-07-2" . "FETI based domain decomposition turned out to be an efficient tool for the solution of a number of engineering problems including those described by variational inequalities. Our basic algorithm [1,2] combines the active set strategy and augmented Lagrangians with application of the FETI algorithm proposed by Farhat and Roux to the solution of auxiliary linear problems. Starting from the discretized variational inequality, the problem is first reduced by duality to a strictly convex quadratic programming problem with simple bounds and possibly some general equality constraints. Then a variant of the augmented Lagrangian method is used for the solution of the resulting problem that is solved by the algorithm generating the approximations for Lagrange multipliers for the equality constraints in the outer loop while solving the auxiliary quadratic programming problems with simple bounds in the inner loop. The algorithm in the inner loop uses projections and adaptive precision control for the solution o"@en . . . "Vondr\u00E1k, V\u00EDt" . . "2000-01-01+01:00"^^ . . "361-370" . "3"^^ . . "27240" . "P(GA101/01/0538), Z(MSM 272400019)" . "Contact shape optimization"@en . . "4"^^ . "0"^^ . "Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization" . "10"^^ . . "0"^^ . "RIV/61989100:27240/02:00006692" . "662999" . . . . "[E4F8D5272FBF]" . "Szweda, Jan" . "Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization"@en . . . "Hor\u00E1k, David" . "Scalabilities of FETI for Variational Inequalities and Contacet Shape Optimization" . "Lyon, France" . "RIV/61989100:27240/02:00006692!RIV/2003/GA0/272403/N" . . . . "Dost\u00E1l, Zden\u011Bk" . .