You might also read
Articles linked to this work by shared authors, journal, and citation graph.
A novel discrete-time Lagrangian network solves convex quadratic programs without penalty parameters. This recurrent neural network guarantees global convergence to optimal solutions for quadratic programming problems.
Area of Science:
Background:
Discussion:
Key Insights:
Outlook: