A continuous method for convex programming problems
type: Item
instance of: scholarly article
title: A continuous method for convex programming problems
zbMATH Open document ID: 1137.90012
author: Niranjan Chakravarthy
published in: Journal of Optimization Theory and Applications
publication date: 2005-04-29T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 2162407
zbMATH Keywords: Convex programming
zbMATH Keywords: monotone variational inequalities
zbMATH Keywords: continuous methods
MaRDI profile type: Publication
full work available at URL: s10957-004-6473-x
OpenAlex ID: W2087671116
cites work: Improvements of some projection methods for monotone nonlinear variational inequalities
cites work: Neurodynamical optimization
cites work: Neural networks and physical systems with emergent collective computational abilities.
cites work: Neurons with graded response have collective computational properties like those of two-state neurons.
cites work: Stability analysis of gradient-based neural networks for optimization problems
cites work: Solving Convex Programs by Means of Ordinary Differential Equations
cites work: Sliding Modes in Solving Convex Programming Problems
cites work: Solving variational inequalities with coupling contraints with the use of differential equations
cites work: On the basic theorem of complementarity
cites work: Inexact implicit methods for monotone general variational inequalities
DOI: 10.1007/S10957-004-6473-X
description: scientific article; zbMATH DE number 2162407