Related papers: Combining Nonlinear FETI-DP Methods and Quasi-Newt…
We investigate the potential of quasi-Newton methods in facilitating convergence of monolithic solution schemes for phase field fracture modelling. Several paradigmatic boundary value problems are addressed, spanning the fields of…
Optimization is important in machine learning problems, and quasi-Newton methods have a reputation as the most efficient numerical schemes for smooth unconstrained optimization. In this paper, we consider the explicit superlinear…
This paper focuses on the design of sequential quadratic optimization (commonly known as SQP) methods for solving large-scale nonlinear optimization problems. The most computationally demanding aspect of such an approach is the computation…
Nonlinear model predictive control~(NMPC) generally requires the solution of a non-convex optimization problem at each sampling instant under strict timing constraints, based on a set of differential equations that can often be stiff and/or…
Solving complex optimization problems in engineering and the physical sciences requires repetitive computation of multi-dimensional function derivatives. Commonly, this requires computationally-demanding numerical differentiation such as…
Sequential quadratic programming (SQP) methods have been remarkably successful in solving a broad range of nonlinear optimization problems. These methods iteratively construct and solve quadratic programming (QP) subproblems to compute…
In this paper we consider second order elliptic partial differential equations with highly varying (heterogeneous) coefficients on a two-dimensional region. The problems are discretized by a composite finite element (FE) and discontinuous…
Physics-informed machine learning and inverse modeling require the solution of ill-conditioned non-convex optimization problems. First-order methods, such as SGD and ADAM, and quasi-Newton methods, such as BFGS and L-BFGS, have been applied…
In this paper we take a quasi-Newton approach to nonlinear eigenvalue problems (NEPs) of the type $M(\lambda)v=0$, where $M:\mathbb{C}\rightarrow\mathbb{C}^{n\times n}$ is a holomorphic function. We investigate which types of approximations…
In this paper, we propose a parallel shooting algorithm for solving nonlinear model predictive control problems using sequential quadratic programming. This algorithm is built on a two-phase approach where we first test and assess…
Isogeometric Analysis is a variant of the finite element method, where spline functions are used for the representation of both the geometry and the solution. Splines, particularly those with higher degree, achieve their full approximation…
We study a framework that allows to solve the coarse problem in the FETI-DP method approximately. It is based on the saddle-point formulation of the FETI-DP system with a block-triangular preconditioner. One of the blocks approximates the…
Quasi-Newton techniques approximate the Newton step by estimating the Hessian using the so-called secant equations. Some of these methods compute the Hessian using several secant equations but produce non-symmetric updates. Other…
Recent control algorithms for Markov decision processes (MDPs) have been designed using an implicit analogy with well-established optimization algorithms. In this paper, we adopt the quasi-Newton method (QNM) from convex optimization to…
We consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their…
High-dimensional nonlinear mechanical systems admit quasi-periodic solutions that are essential for the understanding of the dynamical systems. These quasi-periodic solutions stay on some invariant tori governed by complex PDEs in…
A mixed finite element method (MFEM), using dual-parametric piecewise bi-quadratic and affine (DP-Q2-P1) finite element approximations for the deformation and the pressure like Lagrange multiplier respectively, is developed and analyzed for…
Quasi-Newton methods refer to a class of algorithms at the interface between first and second order methods. They aim to progress as substantially as second order methods per iteration, while maintaining the computational complexity of…
Sequential Quadratic Programming (SQP) is a powerful class of algorithms for solving nonlinear optimization problems. Local convergence of SQP algorithms is guaranteed when the Hessian approximation used in each Quadratic Programming…
In Part I of this work, we have proposed a general framework of decentralized stochastic quasi-Newton methods, which converge linearly to the optimal solution under the assumption that the local Hessian inverse approximations have bounded…