Related papers: A modified BFGS quasi-Newton iterative formula
A new result in convex analysis on the calculation of proximity operators in certain scaled norms is derived. We describe efficient implementations of the proximity calculation for a useful class of functions; the implementations exploit…
A general lattice Boltzmann method for simulation of fluids with tailored transport coefficients is presented. It is based on the recently introduced quasi-equilibrium kinetic models, and a general lattice Boltzmann implementation is…
This paper deals with regularized Newton methods, a flexible class of unconstrained optimization algorithms that is competitive with line search and trust region methods and potentially combines attractive elements of both. The particular…
In [19], a general, inexact, efficient proximal quasi-Newton algorithm for composite optimization problems has been proposed and a sublinear global convergence rate has been established. In this paper, we analyze the convergence properties…
Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving…
A system of equations is obtained for the Cooper gap in nuclei. The system takes two mechanisms of superfluidity into account in an approximation quadratic in the phonon- production amplitude : a Bardeen- Cooper- Schrieffer (BCS) type…
We present a balanced truncation model reduction approach for a class of nonlinear systems with time-varying and uncertain inputs. First, our approach brings the nonlinear system into quadratic-bilinear~(QB) form via a process called…
This article studies Gauss-Newton-type methods for over-determined systems to find solutions to bilevel programming problems. To proceed, we use the lower-level value function reformulation of bilevel programs and consider necessary…
This paper considers the generalized continuation Newton method and thetrust-region updating strategy for the underdetermined system of nonlinear equations. Moreover, in order to improve its computational efficiency, the new method will not…
In this manuscript, we propose a general proximal quasi-Newton method tailored for nonconvex and nonsmooth optimization problems, where we do not require the sequence of the variable metric (or Hessian approximation) to be uniformly bounded…
The main focus in this paper is exact linesearch methods for minimizing a quadratic function whose Hessian is positive definite. We give a class of limited-memory quasi-Newton Hessian approximations which generate search directions parallel…
This paper deals with investigating numerical methods for solving coupled system of nonlinear parabolic problems. We utilize block monotone iterative methods based on Jacobi and Gauss--Seidel methods to solve difference schemes which…
In this paper, we apply a novel approach based on physics-informed neural networks to the computation of quasinormal modes of black hole solutions in modified gravity. In particular, we focus on the case of Einstein-scalar-Gauss-Bonnet…
We study quasi-Jacobi and Jacobi-quasi bialgebroids and their relationships with twisted Jacobi and quasi Jacobi manifolds. We show that we can construct quasi-Lie bialgebroids from quasi-Jacobi bialgebroids, and conversely, and also that…
A continuous analog of Gauss-Newton method for solving nonlinear ill-posed problems is proposed. Its converegence is proved. A numerical example is presented to demonstrate efficiency of the propsed method.
We introduce the primal-dual quasi-Newton (PD-QN) method as an approximated second order method for solving decentralized optimization problems. The PD-QN method performs quasi-Newton updates on both the primal and dual variables of the…
We translate the results of Yansong Xu into the language of~\cite{GGV1}, obtaining nearly the same formulas for the intersection number of Jacobian pairs, but with an inequality instead of an equality.
We provide the rigorous justification of the NLS approximation, in Sobolev regularity, for a class of quasilinear Hamiltonian Klein Gordon equations with quadratic nonlinearities on large one-dimensional tori $\T_L:=\mathbb{R}/(2\pi L…
In this paper, we consider a modified projected Gauss-Newton method for solving constrained nonlinear least-squares problems. We assume that the functional constraints are smooth and the the other constraints are represented by a simple…
An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Convergence results of local type are obtained, as well as an estimate…