Paulo S. B. Nigro
Paulo S. B. Nigro has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
E.T. Simões
Virtual.PYXIS Optimization São Caetano do Sul Brazil
1 shared publication- Felix Steinmetz
Institute of Applied Mechanics RWTH Aachen University Aachen Germany
1 shared publication J. Schröder
Institute of Mechanics University of Duisburg‐Essen Essen Germany
1 shared publication- Jörg Schröder
Universität Duisburg-Essen
1 shared publication - Lisa Scheunemann
Universität Duisburg-Essen, Fakultät für Ingenieurwissenschaften, Abteilung Bauwissenschaften, Institut für Mechanik, Universitätsstr. 15, 45141 Essen
1 shared publication - Lisa Scheunemann
Fachbereich Maschinenbau und Verfahrenstechnik, Lehrstuhl für Technische Mechanik, RPTU Kaiserslautern-Landau, Kaiserslautern, Germany
1 shared publication
Latest Publications
- Open Access
- 14 August 2024
- Published by Springer Nature in Archive of Applied Mechanics
- Vol. 94 (9) , 2565-2582
Comparison of barrier update strategies for interior point algorithms in single-crystal plasticity
This contribution discusses the influence of different barrier update strategies on the performance and robustness of an interior point algorithm for single-crystal plasticity at small strains. To this end, single-crystal plasticity is first briefly presented in the framework of a primal-dual interior point algorithm to outline the general algorithmic structure. The manner in which the barrier parameter is modified within the interior point method, steering the penalization of constraints, plays a crucial role for the robustness and efficiency of the overall algorithm. In this paper, we compare and analyze different strategies in the framework of crystal plasticity. In a thorough analysis of a numerical example covering a broad range of settings in monocrystals, we investigate robust hyperparameter ranges and identify the most efficient and robust barrier parameter update strategies.
- 14 August 2024
- Published by Springer Nature in Archive of Applied Mechanics
- Vol. 94 (9) , 2565-2582
Open AccessComparison of barrier update strategies for interior point algorithms in single-crystal plasticity
This contribution discusses the influence of different barrier update strategies on the performance and robustness of an interior point algorithm for single-crystal plasticity at small strains. To this end, single-crystal plasticity is first briefly presented in the framework of a primal-dual interior point algorithm to outline the general algorithmic structure. The manner in which the barrier parameter is modified within the interior point method, steering the penalization of constraints, plays a crucial role for the robustness and efficiency of the overall algorithm. In this paper, we compare and analyze different strategies in the framework of crystal plasticity. In a thorough analysis of a numerical example covering a broad range of settings in monocrystals, we investigate robust hyperparameter ranges and identify the most efficient and robust barrier parameter update strategies.
- Open Access
- 14 December 2021
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 21 (1) , e202100212
Remarks on a primal‐dual interior point algorithm for single crystal plasticity
In the field of single crystal plasticity, different algorithms exist for the solution of the constitutive equations. They can be grouped into rate independent and rate dependent approaches, where both classes are governed by inherent shortcomings, as discussed in, e.g., [3]. This contribution outlines an algorithmic formulation for single crystal plasticity at small strains for the rate independent case relying on an infeasible primal‐dual interior point method, which has been presented in [5]. It is able to bypass several issues known in rate independent algorithms. Besides a brief overview of the continuum mechanical and algorithmic framework, aspects on different formulations related to the Karush‐Kuhn‐Tucker (KKT) conditions are discussed.
- 14 December 2021
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 21 (1) , e202100212
Open AccessRemarks on a primal‐dual interior point algorithm for single crystal plasticity
In the field of single crystal plasticity, different algorithms exist for the solution of the constitutive equations. They can be grouped into rate independent and rate dependent approaches, where both classes are governed by inherent shortcomings, as discussed in, e.g., [3]. This contribution outlines an algorithmic formulation for single crystal plasticity at small strains for the rate independent case relying on an infeasible primal‐dual interior point method, which has been presented in [5]. It is able to bypass several issues known in rate independent algorithms. Besides a brief overview of the continuum mechanical and algorithmic framework, aspects on different formulations related to the Karush‐Kuhn‐Tucker (KKT) conditions are discussed.
- Open Access
- 29 July 2019
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 120 (12) , 1310-1348
Model order reduction with Galerkin projection applied to nonlinear optimization with infeasible primal‐dual interior point method
Summary: It is not new that model order reduction (MOR) methods are employed in almost all fields of engineering to reduce the processing time of complex computational simulations. At the same time, interior point methods (IPMs), a method to deal with inequality constraint problems (which is little explored in engineering), can be applied in many fields such as plasticity theory, contact mechanics, micromechanics, and topology optimization. In this work, a MOR based in Galerkin projection is coupled with the infeasible primal‐dual IPM. Such research concentrates on how to develop a Galerkin projection in one field with the interior point method; the combination of both methods, coupled with Schur complement, permits to solve this MOR similar to problems without constraints, leading to new approaches to adaptive strategies. Moreover, this research develops an analysis of error from the Galerkin projection related to the primal and dual variables. Finally, this work also suggests an adaptive strategy to alternate the Galerkin projection operator, between primal and dual variable, according to the error during the processing of a problem.
- 29 July 2019
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 120 (12) , 1310-1348
Open AccessModel order reduction with Galerkin projection applied to nonlinear optimization with infeasible primal‐dual interior point method
Summary: It is not new that model order reduction (MOR) methods are employed in almost all fields of engineering to reduce the processing time of complex computational simulations. At the same time, interior point methods (IPMs), a method to deal with inequality constraint problems (which is little explored in engineering), can be applied in many fields such as plasticity theory, contact mechanics, micromechanics, and topology optimization. In this work, a MOR based in Galerkin projection is coupled with the infeasible primal‐dual IPM. Such research concentrates on how to develop a Galerkin projection in one field with the interior point method; the combination of both methods, coupled with Schur complement, permits to solve this MOR similar to problems without constraints, leading to new approaches to adaptive strategies. Moreover, this research develops an analysis of error from the Galerkin projection related to the primal and dual variables. Finally, this work also suggests an adaptive strategy to alternate the Galerkin projection operator, between primal and dual variable, according to the error during the processing of a problem.
- 2 January 2016
- Published by Springer Nature in Computational Mechanics
- Vol. 57 (4) , 537-554
An adaptive model order reduction by proper snapshot selection for nonlinear dynamical problems
- 2 January 2016
- Published by Springer Nature in Computational Mechanics
- Vol. 57 (4) , 537-554
An adaptive model order reduction by proper snapshot selection for nonlinear dynamical problems