A manifold-based approach to sparse global constraint satisfaction problems

DOI10.1007/S10898-019-00805-XMaRDI QIDQ2010101zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ali Baharev, Arnold Neumaier, Hermann Schichl

Publication date 3 December 2019

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10898-019-00805-x

zbMATH Keywords

sparse matricesdecomposition methodsnumerical instabilitylarge-scale systems of equations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
• Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations
• scientific article; zbMATH DE number 3862321
• scientific article; zbMATH DE number 2217818
• Efficient Algorithms for Solving Systems of Nonlinear Equations with a Block Diagonal Structure

Cites work

• scientific article; zbMATH DE number 6378173 (Why is no real title available?)
• 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 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Modeling Language for Mathematical Programming
• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
• Computing the block triangular form of a sparse matrix
• Connectivity and Reducibility of Graphs
• Coverings of Bipartite Graphs
• Direct Methods for Sparse Linear Systems
• Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Modern multidimensional scaling. Theory and applications.
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Nonmetric multidimensional scaling. A numerical method
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Ordering algorithms for irreducible sparse linear systems
• Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
• Reinversion with the preassigned pivot procedure
• Scikit-learn: machine learning in Python
• Two Algorithms for Bipartite Graphs
• Visualizing data using t-SNE

Cited in

(4)

• Symbolic elimination in dynamic optimization based on block-triangular ordering
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
• ManiSolve
• A new framework for sharp and efficient resolution of NCSP with manifolds of solutions

Describes a project that uses

Uses Software

• GitHub
• t-SNE
• CSparse
• OpenModelica
• Scikit
• Dymola
• Ipopt
• AMPL
• AUTO
• HSL

This page was built for publication: A manifold-based approach to sparse global constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010101)