Neural networks for solving second-order cone constrained variational inequality problem
From MaRDI portal
Recommendations
- A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems
- Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
- Neural networks for a class of linearly constrained linear variational inequalities
- Neural networks for solving second-order cone programs based on complementarity functions
- Solving complementarity and variational inequalities problems using neural networks
Cites work
- scientific article; zbMATH DE number 3879296 (Why is no real title available?)
- scientific article; zbMATH DE number 3716008 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3200865 (Why is no real title available?)
- 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
- 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
- Convex programming and variational inequalities
- Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- 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
- On some non-linear elliptic differential functional equations
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Smoothing functions for second-order-cone complementarity problems
- Solving asymmetric variational inequalities via convex optimization
- 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
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- Three-dimensional quasi-static frictional contact by using second-order cone linear complementarity problem
- Variational inequalities
- ``Neural computation of decisions in optimization problems
Cited in
(20)- Neural networks for solving second-order cone programs based on complementarity functions
- Neural networks for a class of bi-level variational inequalities
- Stabilization of a class of nonlinear control systems via a neural network scheme with convergence analysis
- A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems
- Results on the stability of neural network for solving variational inequalities
- Neural networks for a class of linearly constrained linear variational inequalities
- The second-order differential equation method for solving the variational inequality problem
- CENN: conservative energy method based on neural networks with subdomains for solving variational problems involving heterogeneous and complex geometries
- An inexact semismooth Newton method for variational inequality with symmetric cone constraints
- An inexact modified Newton method for VISCC and application in grasping force
- Optimality conditions for vector optimization problem governed by the cone constrained generalized equations
- Grasping torque optimization for a dexterous robotic hand using the linearization of constraints
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
- Machine Learning: ECML 2004
- An Implementable Augmented Lagrangian Method for Solving Second-Order Cone Constrained Variational Inequalities
- A practical nonlinear dynamic framework for solving a class of fractional programming problems
- Neural network based on systematically generated smoothing functions for absolute value equation
- A new neural network model for solving random interval linear programming problems
- Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
- Nonlinear fractional optimal control problems with neural network and dynamic optimization schemes
This page was built for publication: Neural networks for solving second-order cone constrained variational inequality problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429451)
