Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
From MaRDI portal
Publication:2298441
Recommendations
- Neural networks for solving second-order cone constrained variational inequality problem
- Neural networks for solving second-order cone programs based on complementarity functions
- A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems
- Advances in Neural Networks – ISNN 2005
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
Cites work
- scientific article; zbMATH DE number 3879296 (Why is no real title available?)
- scientific article; zbMATH DE number 735099 (Why is no real title available?)
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
- A projection neural network and its application to constrained optimization problems
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
- A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- An infeasible-interior-point algorithm for linear complementarity problems
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Application of projection neural network in solving convex programming problems
- Discovery of new complementarity functions for NCP and SOCCP
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Generalizations of Slater's constraint qualification for infinite convex programs
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Neural network models and its application for solving linear and quadratic programming problems
- Neural networks for nonlinear and mixed complementarity problems and their applications
- Neural networks for solving second-order cone constrained variational inequality problem
- Smoothing functions for second-order-cone complementarity problems
- Solving complementarity and variational inequalities problems using neural networks
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach
- Stability analysis of gradient-based neural networks for optimization problems
- Symmetrization of generalized natural residual function for NCP
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- ``Neural computation of decisions in optimization problems
Cited in
(4)- An Implementable Augmented Lagrangian Method for Solving Second-Order Cone Constrained Variational Inequalities
- Neural networks for solving second-order cone constrained variational inequality problem
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
- Neural networks for solving second-order cone programs based on complementarity functions
This page was built for publication: Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298441)
