A novel approach for solving constrained nonlinear optimization problems using neurofuzzy systems

Author(s):  
I. Nunes da Silva ◽  
A. Nunes de Souza ◽  
M.E. Bordon
2001 ◽  
Vol 11 (03) ◽  
pp. 281-286
Author(s):  
IVAN NUNES DA SILVA ◽  
ANDRÉ NUNES DE SOUZA ◽  
MÁRIO EDUARDO BORDON

A neural network model for solving constrained nonlinear optimization problems with bounded variables is presented in this paper. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points. The network is shown to be completely stable and globally convergent to the solutions of constrained nonlinear optimization problems. A fuzzy logic controller is incorporated in the network to minimize convergence time. Simulation results are presented to validate the proposed approach.


2020 ◽  
Vol 32 (16) ◽  
pp. 12427-12452 ◽  
Author(s):  
Avijit Duary ◽  
Md Sadikur Rahman ◽  
Ali Akbar Shaikh ◽  
Seyed Taghi Akhavan Niaki ◽  
Asoke Kumar Bhunia

Author(s):  
A. Vincent Huffaker ◽  
Leonid Charny

Abstract This paper demonstrates techniques to allow relations on parametric curves in a variational design system. Constraints on the curves, which are normally represented as constrained nonlinear optimization problems, are reduced to systems of nonlinear equations (using the necessary conditions of the NLP). Additional degrees of freedom are constrained through fairing the curve and the resulting NLP is also reduced to its necessary conditions. Although the solution set of the necessary conditions contains the optimum, it contains many other solutions as well. The COAST design consistency algorithm is reviewed and then extended to handle consistency when constraints take the form of relations between objects. An example is given involving distance constraints on Bezier curves.


2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Hui Wang

This paper presents a modified barebones particle swarm optimization (OBPSO) to solve constrained nonlinear optimization problems. The proposed approach OBPSO combines barebones particle swarm optimization (BPSO) and opposition-based learning (OBL) to improve the quality of solutions. A novel boundary search strategy is used to approach the boundary between the feasible and infeasible search region. Moreover, an adaptive penalty method is employed to handle constraints. To verify the performance of OBPSO, a set of well-known constrained benchmark functions is used in the experiments. Simulation results show that our approach achieves a promising performance.


Sign in / Sign up

Export Citation Format

Share Document