Nonsmooth exclusion test for finding all solutions of nonlinear equations
branch-and-bound algorithmconvergenceglobal optimizationnumerical examplesalgorithmconvex relaxationinterval analysissystems of nonlinear equationsNewton methodsinclusionGauss-Seidelinterval Newton-type methodsKrawczyk operatorMcCormick's non-smooth convex relaxationnon-convex problemquasi-Newton type methods
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53) Numerical computation of solutions to systems of equations (65H10) General methods in interval analysis (65G40)
- A new algorithm for solving all the real roots of a nonlinear system of equations in a given feasible region
- A new method for global solution of systems of nonlinear equations
- scientific article; zbMATH DE number 6004882
- On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods
- Numerical methods for finding all real roots of systems of nonlinear equations
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 1456803 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Simple Test for Accuracy of Approximate Solutions to Nonlinear (or Linear) Systems
- A Test for Existence of Solutions to Nonlinear Systems
- A modified Newton method for the solution of ill-conditioned systems of nonlinear equations with application to multiple shooting
- Abstract Generalized Bisection and a Cost Bound
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Algorithm 811: NDA
- Bounding solutions of systems of equations using interval analysis
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Finding all solutions of nonlinearly constrained systems of equations
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Interval Methods for Systems of Equations
- McCormick-Based Relaxations of Algorithms
- On the role of natural level functions to achieve global convergence for damped Newton methods
- Preconditioners for the Interval Gauss–Seidel Method
- Rigorous global search: continuous problems
- Survey of Bundle Methods for Nonsmooth Optimization
- Testing Unconstrained Optimization Software
- scientific article; zbMATH DE number 1500131 (Why is no real title available?)
- Topographical global initialization for finding all solutions of nonlinear systems with constraints
- A simple reliable solver for all the roots of a nonlinear function in a given domain
- An improved verification algorithm for nonlinear systems of equations based on Krawczyk operator
- Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
- On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
This page was built for publication: Nonsmooth exclusion test for finding all solutions of nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616162)
