Partitioned quasi-Newton methods for sparse nonlinear equations

DOI10.1007/s10589-016-9878-1zbMath1370.90144OpenAlexW2523920835MaRDI QIDQ523572

Hui-Ping Cao, Dong-hui Li

Publication date: 21 April 2017

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-016-9878-1

zbMATH Keywords

global convergencesuperlinear convergencepartially separable nonlinear equationpartitioned adjoint Broyden methodpartitioned Broyden's rank one method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Methods of quasi-Newton type (90C53)

Related Items (1)

Solving nonlinear equations with a direct Broyden method and its acceleration

Uses Software

• L-BFGS
• ve08

Cites Work

• Unnamed Item
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares
• Analysis of sparse quasi-Newton updates with positive definite matrix completion
• Recent advances in numerical methods for nonlinear equations and nonlinear least squares
• Convergence analysis of sparse quasi-Newton updates with positive definite matrix completion for two-dimensional functions
• On the local convergence of adjoint Broyden methods
• On the limited memory BFGS method for large scale optimization
• Sparse quasi-Newton updates with positive definite matrix completion
• Global convergence of quasi-Newton methods based on adjoint Broyden updates
• Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
• Partitioned variable metric updates for large structured optimization problems
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
• Quadratic and superlinear convergence of the Huschens method for nonlinear least squares problems
• Local convergence analysis for partitioned quasi-Newton updates
• Recent progress in the global convergence of quasi-Newton methods for nonlinear equations
• Operations research and optimization (ORO)
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• The “global” convergence of Broyden-like methods with suitable line search
• Hybrid Methods for Nonlinear Least Squares
• Convergence Results for Schubert’s Method for Solving Sparse Nonlinear Equations
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
• On the Convergence of a Quasi-Newton Method for Sparse Nonlinear Systems
• On constrained optimization by adjoint based quasi-Newton methods
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• A New Sparsity Preserving Quasi-Newton Update for Solving Nonlinear Equations
• Numerical Solution of Large Sets of Algebraic Nonlinear Equations
• An Optimal Positive Definite Update for Sparse Hessian Matrices
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• A LIMITED MEMORY BROYDEN METHOD TO SOLVE HIGH-DIMENSIONAL SYSTEMS OF NONLINEAR EQUATIONS
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
• The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
• Benchmarking optimization software with performance profiles.

This page was built for publication: Partitioned quasi-Newton methods for sparse nonlinear equations