Continuous dynamical systems that realize discrete optimization on the hypercube

DOI10.1016/j.sysconle.2004.02.008zbMath1157.90483OpenAlexW2112223201MaRDI QIDQ2503628

Rodolphe J. Sepulchre, Pierre-Antoine Absil

Publication date: 21 September 2006

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2004.02.008

zbMATH Keywords

Lyapunov stabilityInterior point methodsGradient-like systems0--1 programmingMultilinear functions

Mathematics Subject Classification ID

Interior-point methods (90C51) Boolean programming (90C09)

Related Items (3)

Łojasiewicz inequality and exponential convergence of the full‐range model of CNNs ⋮ Comparison of convergence and stability properties for the state and output solutions of neural networks ⋮ On the stable equilibrium points of gradient systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian structure of dynamical systems which solve linear programming problems
• Simple Local Search Problems that are Hard to Solve
• Nonlinear 0–1 programming: I. Linearization techniques
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Neural networks, error-correcting codes, and polynomials over the binary n-cube
• Minimum-seeking properties of analog neural networks with multilinear objective functions
• On Dominating Sets and Independent Sets of Graphs
• Neural networks and physical systems with emergent collective computational abilities.
• Neurons with graded response have collective computational properties like those of two-state neurons.
• Proof of the gradient conjecture of R. Thom.

This page was built for publication: Continuous dynamical systems that realize discrete optimization on the hypercube