Convergence Theorems for Least-Change Secant Update Methods

From MaRDI portal
Publication:3042291

DOI10.1137/0718067zbMath0527.65032OpenAlexW2118040915MaRDI QIDQ3042291

Homer F. Walker, John E. jun. Dennis

Publication date: 1981

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0718067



Related Items

A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization, Iterative solution of integral equations by a quasi-Newton method, A symmetric grouped and ordered multi-secant Quasi-Newton update formula, The column-updating method for solving nonlinear equations in Hilbert space, An extension of the theory of secant preconditioners, Convergence theory for the structured BFGS secant method with an application to nonlinear least squares, A pointwise quasi-Newton method for unconstrained optimal control problems, Least change update methods for nonlinear systems with nondifferentiable terms, Quasi-Newton methods with derivatives, Augmented penalty algorithms based on BFGS secant approximations and trust regions, A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares, Adapting Broyden method to handle linear constraints imposed via Lagrange multipliers, A regularization method for constrained nonlinear least squares, Sparse two-sided rank-one updates for nonlinear equations, Local andQ-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡, Direct Secant Updates of Matrix Factorizations, Approximate quasi-Newton methods, On the convergence of quasi-newton methods for nonsmooth problems, Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares, Accelerating the solution of a physics model inside a tokamak using the (inverse) column updating method, A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information, Local and superlinear convergence for truncated iterated projections methods, Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy, On simulation and optimization of macroeconometric models, Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems, Multilevel least-change Newton-like methods for equality constrained optimization problems, Local convergence of quasi-Newton methods for B-differentiable equations, A new structured quasi-Newton algorithm using partial information on Hessian, Efficient estimation of sparse Jacobian matrices by differences, Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms, Secant update generalized version of PSB: a new approach, Quasi-newton methods for monlinear equations and unconstrained optimization problems, New theoretical results on recursive quadratic programming algorithms, On the order of convergence of Broyden's method. Faster convergence on mixed linear-nonlinear systems of equations and a conjecture on the q-order, Numerical methods for nonlinear equations, Structured symmetric rank-one method for unconstrained optimization, Scaled nonlinear conjugate gradient methods for nonlinear least squares problems, A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares, Local convergence analysis for partitioned quasi-Newton updates, On Secant Updates for Use in General Constrained Optimization, A Kantorovich theorem for the structured PSB update in Hilbert space., Convergence of Newton-like-iterative methods, On the generation of updates for quasi-Newton methods, Practical quasi-Newton methods for solving nonlinear systems, Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations, A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm, A comparison of numerical methods for optimal shape design problems, Optimal matrix approximants in structural identification, Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms