A continuous method for convex programming problems
From MaRDI portal
Publication:1774044
DOI10.1007/s10957-004-6473-xzbMath1137.90012OpenAlexW2087671116MaRDI QIDQ1774044
Publication date: 29 April 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-004-6473-x
Related Items
Steplengths in the extragradient type methods ⋮ A continuous method model for solving general variational inequality ⋮ Series solution of the multispecies Lotka-Volterra equations by means of the homotopy analysis method ⋮ A novel neural dynamical approach to convex quadratic program and its efficient applications
Cites Work
- Neurodynamical optimization
- Inexact implicit methods for monotone general variational inequalities
- Solving Convex Programs by Means of Ordinary Differential Equations
- Sliding Modes in Solving Convex Programming Problems
- Neural networks and physical systems with emergent collective computational abilities.
- Neurons with graded response have collective computational properties like those of two-state neurons.
- On the basic theorem of complementarity
- Stability analysis of gradient-based neural networks for optimization problems
- Solving variational inequalities with coupling contraints with the use of differential equations
- Improvements of some projection methods for monotone nonlinear variational inequalities
