A neural network measuring the intersection of \(m\)-dimensional convex polyhedra

DOI10.1016/0005-1098(95)98481-KzbMath0832.68082OpenAlexW2092374577MaRDI QIDQ1893014

Jing Yuan

Publication date: 3 July 1995

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0005-1098(95)98481-k

zbMATH Keywords

neural network

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Computational aspects related to convexity (52B55) Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A linear algorithm for determining the separation of convex polyhedra
• Finding the nearest point in A polytope
• Neural networks and physical systems with emergent collective computational abilities.
• An Efficient Computational Procedure for a Generalized Quadratic Programming Problem

This page was built for publication: A neural network measuring the intersection of \(m\)-dimensional convex polyhedra