The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
From MaRDI portal
Publication:3776508
Recommendations
- scientific article; zbMATH DE number 1766634
- Successive linearization methods for large-scale nonlinear programming problems
- Inexact trust region method for large sparse systems of nonlinear equations
- Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations
- scientific article; zbMATH DE number 679863
Cited in
(10)- A trust region algorithm for minimization of locally Lipschitzian functions
- Advances in trust region algorithms for constrained optimization
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Training multi-layered neural network with a trust-region based algorithm
- Recent advances in trust region algorithms
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Solving Large Sparse Nonlinear Programs Using GRG
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Finding all solutions of nonlinearly constrained systems of equations
- Pattern search method for discrete \(L_{1}\)-approximation
This page was built for publication: The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776508)