The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
From MaRDI portal
Publication:3776508
DOI10.1137/0908024zbMath0636.65053OpenAlexW1964009395MaRDI QIDQ3776508
Nocedal, Jorge, John K. Reid, Iain S. Duff
Publication date: 1987
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0908024
linear programmingNewton's methodtrust region algorithmLevenberg-Marquardt algorithmsystem of nonlinear algebraic equationssparse sets of nonlinear equations
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)
Related Items
A trust region algorithm for minimization of locally Lipschitzian functions, A unified approach to global convergence of trust region methods for nonsmooth optimization, Finding all solutions of nonlinearly constrained systems of equations, Training multi-layered neural network with a trust-region based algorithm, Pattern search method for discrete \(L_{1}\)-approximation, Advances in trust region algorithms for constrained optimization, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Recent advances in trust region algorithms
Uses Software
