A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
From MaRDI portal
Publication:2408155
Recommendations
- A manifold-based approach to sparse global constraint satisfaction problems
- scientific article; zbMATH DE number 4192955
- Sparsity considerations in network solution by tearing
- Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations
- Numerical Solution of Large Sets of Algebraic Nonlinear Equations
Cites work
- A Modeling Language for Mathematical Programming
- A quantitative metric for robustness of nonlinear algebraic equation solvers
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
- Algorithm 795
- Benchmarking global optimization and constraint satisfaction codes
- BertiniLab: a MATLAB interface for solving systems of polynomial equations
- Computational Comparison of Convex Underestimators for Use in a Branch-and-Bound Global Optimization Framework
- Computing the block triangular form of a sparse matrix
- Connectivity and Reducibility of Graphs
- Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes
- Corrigendum to ``A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Coverings of Bipartite Graphs
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- Direct Methods for Sparse Linear Systems
- Efficient path tracking methods
- Finding points on real solution components and applications to differential polynomial systems
- Generalized McCormick relaxations
- scientific article; zbMATH DE number 3149610 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 1263318 (Why is no real title available?)
- scientific article; zbMATH DE number 1304541 (Why is no real title available?)
- scientific article; zbMATH DE number 1004901 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Improved constraint consensus methods for seeking feasibility in nonlinear programs
- Interval analysis on directed acyclic graphs for global optimization
- Interval Methods for Systems of Equations
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- LMBOPT: a limited memory method for bound-constrained optimization
- McCormick-Based Relaxations of Algorithms
- Numerically solving polynomial systems with Bertini
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Ordering algorithms for irreducible sparse linear systems
- Partitioning and Tearing Systems of Equations
- Polynomial homotopy continuation with PHCpack
- Reinversion with the preassigned pivot procedure
- Scatter search and local NLP solvers: a multistart framework for global optimization
- Staircase Matrices and Systems
- Symbolic-Numeric Techniques for Solving Nonlinear Systems
- The Consistent Initialization of Differential-Algebraic Systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Two Algorithms for Bipartite Graphs
Cited in
(2)
Describes a project that uses
Uses Software
This page was built for publication: A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408155)
