An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function
type: Item
instance of: scholarly article
title: An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function
zbMATH Open document ID: 1436.90107
author: D. Kharzeev
published in: Soft Computing
publication date: 2020-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 68T07
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7222003
zbMATH Keywords: one-layer neural networks
zbMATH Keywords: convex programming
zbMATH Keywords: nonlinear complementarity problem
MaRDI profile type: Publication
full work available at URL: s00500-019-04189-8
OpenAlex ID: W2962369353
cites work: Q3932576
cites work: Q3998396
cites work: ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
cites work: A family of NCP functions and a descent method for the nonlinear complementarity problem
cites work: A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
cites work: Q4003375
cites work: A new nonlinear neural network for solving convex nonlinear programming problems
cites work: Neural network models and its application for solving linear and quadratic programming problems
cites work: A novel recurrent nonlinear neural network for solving quadratic programming problems
cites work: A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS
cites work: Structural and stability properties of \(P_0\) nonlinear complementarity problems
cites work: Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
cites work: A special newton-type optimization method
cites work: Solution of monotone complementarity problems with locally Lipschitzian functions
cites work: The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity
cites work: Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
cites work: New NCP-functions and their properties
cites work: Solving nonlinear complementarity problems with neural networks: A reformulation method approach
cites work: Nonlinear complementarity as unconstrained and constrained minimization
cites work: Q3345088
cites work: On generalized convexity of nonlinear complementarity functions
cites work: A dynamic system model for solving convex nonlinear optimization problems
cites work: A deterministic annealing neural network for convex programming
cites work: A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
cites work: Mathematical analysis of some neural networks for solving linear and quadratic programming
cites work: Lagrange programming neural networks
cites work: An adaptive neural network model for nonlinear programming problems
Wikidata QID: Q127518688
DOI: 10.1007/S00500-019-04189-8
Recommended article: A new nonlinear neural network for solving convex nonlinear programming problems
Recommended article: A NEURAL NETWORK FOR THE GENERALIZED NONLINEAR COMPLEMENTARITY PROBLEM OVER A POLYHEDRAL CONE
Recommended article: Q3374724
Recommended article: Neural networks for nonlinear and mixed complementarity problems and their applications
Recommended article: A Neural Network for Solving Nonlinear Convex Programming with Linear Equality and Bounded Constraints
Recommended article: Solving nonlinear complementarity problems with neural networks: A reformulation method approach
description: scientific article; zbMATH DE number 7222003