Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
DOI10.1155/2019/4545064zbMATH Open1435.90104OpenAlexW2912097295WikidataQ128392893 ScholiaQ128392893MaRDI QIDQ2298441FDOQ2298441
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
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
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing functions for second-order-cone complementarity problems
- Title not available (Why is that?)
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- 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
- ``Neural computation of decisions in optimization problems
- Generalizations of Slater's constraint qualification for infinite convex programs
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
- Title not available (Why is that?)
- A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems
- Neural network models and its application for solving linear and quadratic programming problems
- Application of projection neural network in solving convex programming problems
- Neural networks for solving second-order cone constrained variational inequality problem
- A projection neural network and its application to constrained optimization problems
- Title not available (Why is that?)
- An infeasible-interior-point algorithm for linear complementarity problems
- Neural networks for nonlinear and mixed complementarity problems and their applications
- 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
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
- Discovery of new complementarity functions for NCP and SOCCP
- Symmetrization of generalized natural residual function for NCP
Cited In (2)
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)
