A practical nonlinear dynamic framework for solving a class of fractional programming problems

DOI10.1007/S11071-015-2219-6zbMATH Open1348.90576OpenAlexW744858739MaRDI QIDQ330727FDOQ330727

Authors: Alireza Nazemi, Narges Tahmasbi 

Publication date: 26 October 2016

Published in: Nonlinear Dynamics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11071-015-2219-6

Recommendations

• scientific article; zbMATH DE number 6179040
• Solving a class of geometric programming problems by an efficient dynamic model
• A recurrent neural network for nonlinear fractional programming
• A dynamic system model for solving convex nonlinear optimization problems
• An efficient algorithm for solving a class of fractional programming problems

zbMATH Keywords

convergencestabilityconvex programmingneural networkfractional programmingsecond-order cone programmingdynamic model

Mathematics Subject Classification ID

Fractional programming (90C32) Neural networks for/in biological studies, artificial life and related topics (92B20) Lyapunov and storage functions (93D30)

Cites Work

• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Ordinary differential equations. An introduction to nonlinear analysis. Transl. from the German by Gerhard Metzen
• Title not available (Why is that?)
• Robust optimization
• Numerical mathematics.
• Applications of second-order cone programming
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• A sixth bibliography of fractional programming
• A fifth bibliography of fractional programming^*
• Title not available (Why is that?)
• Title not available (Why is that?)
• Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
• Fractional programming
• Title not available (Why is that?)
• Global optimization of fractional programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems
• Lower bound of transition time in multidimensional time-optimal problems
• Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
• A neural network for the linear complementarity problem
• Generalized Lagrange function and generalized weak saddle points for a class of multiobjective fractional optimal control problems
• Neural network models and its application for solving linear and quadratic programming problems
• Application of projection neural network in solving convex programming problems
• Feature selection for consistent biclustering via fractional 0-1 programming
• A new neural network for solving nonlinear projection equations
• The optimization technique for solving a class of non-differentiable programming based on neural network method
• Efficient recurrent neural network model for the solution of general nonlinear optimization problems
• Solving a class of geometric programming problems by an efficient dynamic model
• A capable neural network model for solving the maximum flow problem
• Neural networks for solving second-order cone constrained variational inequality problem
• Dimensional reduction in vector space methods for natural language processing: products and projections
• A dynamic system model for solving convex nonlinear optimization problems
• A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
• Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
• A projection neural network and its application to constrained optimization problems
• Advances in Neural Networks – ISNN 2005
• A high performance neural network for solving nonlinear programming problems with hybrid constraints
• A dynamical model for solving degenerate quadratic minimax problems with constraints
• A feedback neural network for solving convex constraint optimization problems
• Conversion of some classes of fractional programming to second-order cone programming and solving it by potential reduction interior point method

Cited In (3)

• Solving a class of geometric programming problems by an efficient dynamic model
• A recurrent neural network for nonlinear fractional programming
• On linear fractional programming problem and its computation using a neural network model

This page was built for publication: A practical nonlinear dynamic framework for solving a class of fractional programming problems

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