Inexact trust region method for large sparse systems of nonlinear equations
From MaRDI portal
Publication:1331125
DOI10.1007/BF02193101zbMath0803.65071MaRDI QIDQ1331125
Publication date: 9 August 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
global convergencenumerical examplestest resultsinexact trust region methodlarge sparse systems of nonlinear equationssmoothed CGS algorithm
Related Items
An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, On an iterative algorithm with superquadratic convergence for solving nonlinear operator equations, A verification method for solutions of nonsmooth equations, A choice of forcing terms in inexact Newton method, A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations, Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations, Practical quasi-Newton algorithms for singular nonlinear systems, Unnamed Item, Sparse two-sided rank-one updates for nonlinear equations, The regularization continuation method for optimization problems with nonlinear equality constraints, A modified Newton-like method for nonlinear equations, A matrix-free quasi-Newton method for solving large-scale nonlinear systems, A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems, A choice of forcing terms in inexact Newton iterations with application to pseudo-transient continuation for incompressible fluid flow computations, Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗, A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound, A nonmonotone Jacobian smoothing inexact Newton method for NCP, Newton-like method with modification of the right-hand-side vector, Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations∗, Solution of systems of nonlinear equations - a semi-implicit approach, On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods, On the global convergence of a new spectral residual algorithm for nonlinear systems of equations, Jacobian smoothing Brown's method for NCP, A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations, Generalized continuation Newton methods and the trust-region updating strategy for the underdetermined system, A new smoothing quasi-Newton method for nonlinear complementarity problems, Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations, Globally convergent Jacobian smoothing inexact Newton methods for NCP, Convergence analysis of a trust-region multidimensional filter method for nonlinear complementarity problems, A hybrid of the Newton-GMRES and electromagnetic meta-heuristic methods for solving systems of nonlinear equations, Inexact methods: Forcing terms and conditioning, Practical quasi-Newton methods for solving nonlinear systems, A nonmonotone hybrid method for nonlinear systems∗, Global Newton-type methods and semismooth reformulations for NCP
Uses Software
Cites Work
- Unnamed Item
- Successive column correction algorithms for solving sparse 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
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Testing Unconstrained Optimization Software
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
- Newton-type methods for unconstrained and linearly constrained optimization
- A New Sparsity Preserving Quasi-Newton Update for Solving Nonlinear Equations
- Numerical Solution of Large Sets of Algebraic Nonlinear Equations