Frictional contact is one of the most challenging problems in computational mechanics. Typically, it is a tough non-linear problem often requiring several Newton iterations to …
In this article, we address the efficient numerical solution of linear and quadratic programming problems, often of large scale. With this aim, we devise an infeasible interior …
The aim of this study is to present the numerical solutions of the Liénard nonlinear model by designing the structure of the computational Gudermannian neural networks (GNNs) along …
In this paper we present general-purpose preconditioners for regularized augmented systems, and their corresponding normal equations, arising from optimization problems. We …
In this paper we analyze a zeroth-order proximal stochastic gradient method suitable for the minimization of weakly convex stochastic optimization problems. We consider nonsmooth …
Optimal control problems including partial differential equation (PDE) as well as integer constraints merge the combinatorial difficulties of integer programming and the challenges …
In this paper we present an efficient active-set method for the solution of convex quadratic programming problems with general piecewise-linear terms in the objective, with …
G Zilli, L Bergamaschi - ANNALI DELL'UNIVERSITA'DI FERRARA, 2022 - Springer
In this paper, we address the preconditioned iterative solution of the saddle-point linear systems arising from the (regularized) Interior Point method applied to linear and quadratic …
We present a quasi-Newton interior-point method appropriate for optimization problems with pointwise inequality constraints in Hilbert function spaces. Among others, our methodology …