Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
Publication:2298441
DOI10.1155/2019/4545064zbMath1435.90104OpenAlexW2912097295WikidataQ128392893 ScholiaQ128392893MaRDI QIDQ2298441
Chun-Hsu Ko, Xiao-Ren Wu, Jein-Shan Chen, Juhe Sun, B. Saheya
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/4545064
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neural networks for solving second-order cone constrained variational inequality problem
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- The semismooth-related properties of a merit function 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 family of NCP functions and a descent method for the nonlinear complementarity problem
- ``Neural computation of decisions in optimization problems
- Generalizations of Slater's constraint qualification for infinite convex programs
- An infeasible-interior-point algorithm for linear complementarity problems
- Discovery of new complementarity functions for NCP and SOCCP
- Symmetrization of generalized natural residual function for NCP
- Neural networks for nonlinear and mixed complementarity problems and their applications
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC 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
- Application of projection neural network in solving convex programming problems
- Solving complementarity and variational inequalities problems using neural networks
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A projection neural network and its application to constrained optimization problems
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach
- Stability analysis of gradient-based neural networks for optimization problems
This page was built for publication: Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions