A manifold-based approach to sparse global constraint satisfaction problems
From MaRDI portal
Publication:2010101
DOI10.1007/s10898-019-00805-xzbMath1455.65073OpenAlexW2959183106WikidataQ91736858 ScholiaQ91736858MaRDI QIDQ2010101
Hermann Schichl, Arnold Neumaier, Ali Baharev
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00805-x
Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Uses Software
Cites Work
- A Modeling Language for Mathematical Programming
- Ordering algorithms for irreducible sparse linear systems
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Nonmetric multidimensional scaling. A numerical method
- Coverings of Bipartite Graphs
- Connectivity and Reducibility of Graphs
- Direct Methods for Sparse Linear Systems
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
- Computing the block triangular form of a sparse matrix
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
- Reinversion with the preassigned pivot procedure
- Two Algorithms for Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
