An Interior Point Recurrent Neural Network for Convex Optimization Problems

DOI10.1007/978-1-4939-1124-0_13MaRDI QIDQ4983087zbMATH OpenOpenAlexFDO

Authors Panagiotis T. Krasopoulos, Nicholas G. Maratos

Publication date 14 April 2015

Published in Mathematics Without Boundaries (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4939-1124-0_13

zbMATH Keywords

convergenceconvex optimizationinterior point methodsrecurrent neural networksbarrier functionsinequality constrains

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• A recurrent neural network for solving a class of generalized convex optimization problems
• A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
• A recurrent neural network for solving convex quadratic program
• A non-penalty recurrent neural network for solving a class of constrained optimization problems
• A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
• A one-layer recurrent neural network for constrained nonconvex optimization
• A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints
• A one-layer recurrent neural network for constrained nonsmooth invex optimization
• A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints

Cited in

(2)

• A neurodynamic approach to convex optimization problems with general constraint
• Deep unfolding of a proximal interior point method for image restoration

This page was built for publication: An Interior Point Recurrent Neural Network for Convex Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983087)