A dual neural network for convex quadratic programming subject to linear equality and inequality constraints (Q1600289): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Lagrange programming neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic annealing neural network for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A high performance neural network for solving nonlinear programming problems with hybrid constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Solving Strictly Convex Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Generalization of a Normal Map and Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global asymptotic and exponential stability of a dynamic neural system with asymmetric connection weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank

Revision as of 10:33, 4 June 2024

scientific article
Language Label Description Also known as
English
A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
scientific article

    Statements

    A dual neural network for convex quadratic programming subject to linear equality and inequality constraints (English)
    0 references
    12 June 2002
    0 references
    0 references
    global exponential convergence
    0 references
    optimal solutions
    0 references
    network architecture
    0 references
    0 references
    0 references