Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations∗
From MaRDI portal
Publication:3839446
DOI10.1080/10556789808805677zbMath0927.65068OpenAlexW2093911024MaRDI QIDQ3839446
Publication date: 15 June 1999
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://www.nusl.cz/ntk/nusl-33651
global convergencenumerical examplespreconditioningresidual smoothinglarge sparse systemsrobust algorithminexact methodsCGS methodrestarting strategydiscrete Newton methodArmijo-type descent methods
Related Items
An inexact Newton-like conditional gradient method for constrained nonlinear systems, Inverse \(q\)-columns updating methods for solving nonlinear systems of equations, Approximate norm descent methods for constrained nonlinear systems, Newton-like method with modification of the right-hand-side vector, Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications, Preconditioner updates for solving sequences of linear systems in matrix-free environment, Quasi-Newton approaches to interior point methods for quadratic problems, Inexact methods: Forcing terms and conditioning, Practical quasi-Newton methods for solving nonlinear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A quasi-Newton method with modification of one column per iteration
- Successive column correction algorithms for solving sparse nonlinear systems of equations
- On the closed form solution of Troesch's problem
- Representations of quasi-Newton matrices and their use in limited memory methods
- Inexact trust region method for large sparse systems of nonlinear equations
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Software for estimating sparse Jacobian matrices
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- On the global convergence of trust region algorithms for unconstrained minimization
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Testing Unconstrained Optimization Software
- Inexact Newton Methods
- Algorithms Supplement
- Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
- An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
- Optimal Design of an Elastic or Elasto-plastic Beam with Unilateral Elastic Foundation and Rigid Supports
- SOR-Secant Methods
- Efficient Numerical Validation of Solutions of Nonlinear Systems
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Globally Convergent Inexact Newton Methods
- On a Class of Nonlinear Equation Solvers Based on the Residual Norm Reduction over a Sequence of Affine Subspaces
- A New Sparsity Preserving Quasi-Newton Update for Solving Nonlinear Equations
- A Local Convergence Theory for Combined Inexact-Newton/Finite-Difference Projection Methods
- Choosing the Forcing Terms in an Inexact Newton Method
