A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints.
From MaRDI portal
Recommendations
- Smoothing mathematical programmes with equilibrium constraints via neural network function
- A note on smoothing mathematical programs with equilibrium constraints
- A dynamic system model for solving convex nonlinear optimization problems
- scientific article; zbMATH DE number 2052075
- A new smoothing technique for mathematical programs with equilibrium constraints
Cites work
- A hybrid neural network approach to bilevel programming problems
- A neurodynamic optimization technique based on overestimator and underestimator functions for solving a class of non-convex optimization problems
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
- A smoothing method for mathematical programs with equilibrium constraints
- Analysis of the second order matrix Riccati equations
- Complementarity constraints as nonlinear equations: Theory and numerical experience
- Convex two-level optimization
- Efficient recurrent neural network model for the solution of general nonlinear optimization problems
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- scientific article; zbMATH DE number 3879296 (Why is no real title available?)
- scientific article; zbMATH DE number 6025195 (Why is no real title available?)
- Linear and nonlinear programming.
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Neural network for solving convex quadratic bilevel programming problems
- New relaxation method for mathematical programs with complementarity constraints
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On Optimization Problems with Variational Inequality Constraints
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- On the solution of mathematical programming problems with equilibrium constraints
- Optimization by Least Squares
- Optimization problems with equilibrium constraints and their numerical solution.
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints
- Projected dynamical systems and optimization problems
- Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique.
- Solving mathematical programs with equilibrium constraints
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach
Cited in
(3)- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- Augmented Lagrangian neural network for solving mathematical programs with equilibrium constraints
- Lagrangian-based neural network solution method for mathematical programs with vanishing constraints and its application in truss topology
This page was built for publication: A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5122257)
