A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints

DOI10.14736/kyb-2020-3-0383zbMath1474.90475OpenAlexW3034105278MaRDI QIDQ5122257

S. Ezazipour, Ahmad Golbabai

Publication date: 22 September 2020

Published in: Kybernetika (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/148306

zbMATH Keywords

global convergenceneural networkasymptotically stabilitymathematical programming with equilibrium constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neural network for solving convex quadratic bilevel programming problems
• Solving mathematical programs with equilibrium constraints
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Optimization problems with equilibrium constraints and their numerical solution.
• Linear and nonlinear programming.
• Analysis of the second order matrix Riccati equations
• Convex two-level optimization
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• A smoothing method for mathematical programs with equilibrium constraints
• On the solution of mathematical programming problems with equilibrium constraints
• New relaxation method for mathematical programs with complementarity constraints
• Projected dynamical systems and optimization problems
• A neurodynamic optimization technique based on overestimator and underestimator functions for solving a class of non-convex optimization problems
• A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
• A hybrid neural network approach to bilevel programming problems
• Partial augmented Lagrangian method and mathematical programs with complementarity constraints
• A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• Efficient recurrent neural network model for the solution of general nonlinear optimization problems
• Complementarity constraints as nonlinear equations: Theory and numerical experience
• Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique
• Exact Penalization of Mathematical Programs with Equilibrium Constraints
• On Optimization Problems with Variational Inequality Constraints
• ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
• Lower-order penalty methods for mathematical programs with complementarity constraints
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Optimization by Least Squares
• Mathematical Programs with Equilibrium Constraints
• Solving nonlinear complementarity problems with neural networks: A reformulation method approach

This page was built for publication: A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints