Fuzzy convex optimization problems with fuzzy coefficients (FCOPFCs) arise in many applications. Although many neurodynamics-based models have been proposed for solving FCOPFCs, most of them are designed for FCOPFCs with equality or inequality constraints only. However, in many applications, the FCOPFCs often come with both equality and inequality constraints (general constraints, for short), so most of the neurodynamics-based models no longer work in these situations. Therefore, this article aims to construct a new model for FCOPFCs with general constraints to extend the applications of neurodynamics-based models. First of all, based on fuzzy set theory, the original FCOPFCs with general constraints is transformed into a series of interval programming tasks and further transformed into crisp optimization problems with weights. Then, a novel continuous-time neurodynamics-based model with a single-layer structure is established to solve the crisp optimization problem with weights. Further, we discuss the global existence and prove the stability of state solutions. The theoretical results show that the state solutions reach the feasible region within finite time and converge to the optimal solution with the smallest 2-norm. Simulation results completed for three kinds of FCOPFCs show the validity of the approach, and the results in real-world applications demonstrate the excellent performance of the proposed model.

Matching is an important prerequisite for point clouds registration, which is to establish a reliable correspondence between two point clouds. This paper aims to improve recent theoretical and algorithmic results on discrete optimal transport (DOT), since it lacks robustness for the point clouds matching problems with large-scale affine or even nonlinear transformation. We first consider the importance of the used prior probability for accurate matching and give some theoretical analysis. Then, to solve the point clouds matching problems with complex deformation and noise, we propose an improved DOT model, which introduces an orthogonal matrix and a diagonal matrix into the classical DOT model. To enhance its capability of dealing with cases with outliers, we further bring forward a relaxed and regularized DOT model. Meantime, we propose two algorithms to solve the brought forward two models. Finally, extensive experiments on some real datasets are designed in the presence of reflection, large-scale rotation, stretch, noise, and outliers. Some state-of-the-art methods, including CPD, APM, RANSAC, TPS-ICP, TPS-RPM, RPMNet, and classical DOT methods, are to be discussed and compared. For different levels of degradation, the numerical results demonstrate that the proposed methods perform more favorably and robustly than the other methods.

This paper considers a class of distributed convex optimization problems with constraints and gives a novel multiagent neurodynamic approach in continuous-time form. The considered distributed optimization is to search for a minimizer of the summation of nonsmooth convex functions on some agents, which have local general constraints. The proposed approach solves the objective function of each agent individually, and the state solutions of all agents reach consensus asymptotically under mild assumptions. In particular, the existence and boundedness of the global state solution to the dynamical system are guaranteed. Moreover, the state solution reaches the feasible region of equivalent optimization problem asymptotically and the output of each agent is convergent to the optimal solution set of the primal distributed problem. In contrast to the existing methods in a distributed manner, the proposed approach is more convenient for general constrained distributed problems and has low structure complexity which could narrow the bandwidth of communication. Finally, the proposed neurodynamic approach is applied to two numerical examples and a class of power system optimal load-sharing problems to support the theoretical results and its efficiency.