A manifold-based approach to sparse global constraint satisfaction problems

DOI10.1007/S10898-019-00805-XzbMATH Open1455.65073DBLPjournals/jgo/BaharevNS19OpenAlexW2959183106WikidataQ91736858 ScholiaQ91736858MaRDI QIDQ2010101FDOQ2010101

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

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)

Cites Work

• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Direct Methods for Sparse Linear Systems
• Modern multidimensional scaling. Theory and applications.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Modeling Language for Mathematical Programming
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Nonmetric multidimensional scaling. A numerical method
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
• Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
• Coverings of Bipartite Graphs
• Title not available (Why is that?)
• Computing the block triangular form of a sparse matrix
• Ordering algorithms for irreducible sparse linear systems
• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two Algorithms for Bipartite Graphs
• Reinversion with the preassigned pivot procedure
• Connectivity and Reducibility of Graphs
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations

Cited In (2)

• Symbolic elimination in dynamic optimization based on block-triangular ordering
• ManiSolve

Uses Software

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

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)