An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function

DOI10.1007/s00500-019-04189-8zbMath1436.90107OpenAlexW2962369353WikidataQ127518688 ScholiaQ127518688MaRDI QIDQ781395

D. Kharzeev

Publication date: 16 July 2020

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-019-04189-8

zbMATH Keywords

convex programmingnonlinear complementarity problemone-layer neural networks

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Finite time convergent recurrent neural network for variational inequality problems subject to equality constraints, A dynamic model to solve weighted linear complementarity problems, Unnamed Item, An inverse-free dynamical system for solving the absolute value equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic system model for solving convex nonlinear optimization problems
• A novel recurrent nonlinear neural network for solving quadratic programming problems
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
• Nonlinear complementarity as unconstrained and constrained minimization
• A deterministic annealing neural network for convex programming
• Solution of monotone complementarity problems with locally Lipschitzian functions
• New NCP-functions and their properties
• An adaptive neural network model for nonlinear programming problems
• Mathematical analysis of some neural networks for solving linear and quadratic programming
• On generalized convexity of nonlinear complementarity functions
• A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
• Neural network models and its application for solving linear and quadratic programming problems
• A new nonlinear neural network for solving convex nonlinear programming problems
• Structural and Stability Properties of P ₀ Nonlinear Complementarity Problems
• A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS
• Lagrange programming neural networks
• A special newton-type optimization method
• A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
• The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity
• ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
• Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
• Solving nonlinear complementarity problems with neural networks: A reformulation method approach