A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
From MaRDI portal
Publication:726145
DOI10.1016/J.INS.2013.10.017zbMath1341.90101OpenAlexW1988557613MaRDI QIDQ726145
Chun-Hsu Ko, Jein-Shan Chen, Xin-He Miao
Publication date: 8 July 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.10.017
Related Items (5)
A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems ⋮ A projection neural network for circular cone programming ⋮ A power penalty method for second-order cone nonlinear complementarity problems ⋮ Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions ⋮ Grasping torque optimization for a dexterous robotic hand using the linearization of constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synchronization control of a class of memristor-based recurrent neural networks
- Neural networks for solving second-order cone constrained variational inequality problem
- ``Neural computation of decisions in optimization problems
- Solving convex programming problems with equality constaints by neural networks
- An infeasible-interior-point algorithm for linear complementarity problems
- Second-order cone programming
- Neural networks for nonlinear and mixed complementarity problems and their applications
- An iterative adaptive dynamic programming algorithm for optimal control of unknown discrete-time nonlinear systems with constrained inputs
- 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
- Global exponential periodicity and stability of a class of memristor-based recurrent neural networks with multiple delays
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Nonsmooth Equations: Motivation and Algorithms
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A projection neural network and its application to constrained optimization problems
- Convex programming and variational inequalities
- Mathematical control theory: an introduction
- 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: A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
