Based on a new idea of successive approximation, this paper proposes a high-performance feedback neural network model for solving convex nonlinear programming problems. Differing from existing neural network optimization models, no dual variables, penalty parameters, or Lagrange multipliers are involved in the proposed network. It has the least number of state variables and is very simple in structure. In particular, the proposed network has better asymptotic stability. For an arbitrarily given initial point, the trajectory of the network converges to an optimal solution of the convex nonlinear programming problem under no more than the standard assumptions. In addition, the network can also solve linear programming and convex quadratic programming problems, and the new idea of a feedback network may be used to solve other optimization problems. Feasibility and efficiency are also substantiated by simulation examples.

Download full-text PDF

Source
http://dx.doi.org/10.1109/TNN.2003.820852DOI Listing

Publication Analysis

Top Keywords

neural network
12
convex nonlinear
12
nonlinear programming
12
programming problems
12
high-performance feedback
8
feedback neural
8
network
8
solving convex
8
proposed network
8
network solve
8

Similar Publications

Deep learning has emerged as a powerful tool in medical imaging, particularly for corneal topographic map classification. However, the scarcity of labeled data poses a significant challenge to achieving robust performance. This study investigates the impact of various data augmentation strategies on enhancing the performance of a customized convolutional neural network model for corneal topographic map classification.

View Article and Find Full Text PDF

Motivation: The drug-disease, gene-disease, and drug-gene relationships, as high-frequency edge types, describe complex biological processes within the biomedical knowledge graph. The structural patterns formed by these three edges are the graph motifs of (disease, drug, gene) triplets. Among them, the triangle is a steady and important motif structure in the network, and other various motifs different from the triangle also indicate rich semantic relationships.

View Article and Find Full Text PDF

Enhancing beer authentication, quality, and control assessment using non-invasive spectroscopy through bottle and machine learning modeling.

J Food Sci

January 2025

Digital Agriculture, Food and Wine Research Group, School of Agriculture, Food and Ecosystem Science, Faculty of Science, The University of Melbourne, Melbourne, Victoria, Australia.

Fraud in alcoholic beverages through counterfeiting and adulteration is rising, significantly impacting companies economically. This study aimed to develop a method using near-infrared (NIR) spectroscopy (1596-2396 nm) through the bottle, along with machine learning (ML) modeling for beer authentication, quality traits, and control assessment. For this study, 25 commercial beers from different brands, styles, and three types of fermentation were used.

View Article and Find Full Text PDF

Bruises can affect the appearance and nutritional value of apples and cause economic losses. Therefore, the accurate detection of bruise levels and bruise time of apples is crucial. In this paper, we proposed a method that combines a self-designed multispectral imaging system with deep learning to accurately detect the level and time of bruising on apples.

View Article and Find Full Text PDF

The image retrieval is the process of retrieving the relevant images to the query image with minimal searching time in internet. The problem of the conventional Content-Based Image Retrieval (CBIR) system is that they produce retrieval results for either colour images or grey scale images alone. Moreover, the CBIR system is more complex which consumes more time period for producing the significant retrieval results.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!