In recent years,numerous recurrent neural network(RNN)models have been reported for solving time-dependent nonlinear optimization problems.However,few existing RNN models simultaneously involve nonlinear equality cons...In recent years,numerous recurrent neural network(RNN)models have been reported for solving time-dependent nonlinear optimization problems.However,few existing RNN models simultaneously involve nonlinear equality constraints,direct discretization,and noise suppression.This limitation presents challenges when existing models are applied to practical engineering problems.Additionally,most current discrete-time RNN models are derived from continuous-time models,which may not perform well for solving essentially discrete problems.To handle these issues,a robust direct-discretized RNN(RDD-RNN)model is proposed to efficiently realize time-dependent optimization constrained by nonlinear equalities(TDOCNE)in the presence of various time-dependent noises.Theoretical analyses are provided to reveal that the proposed RDD-RNN model possesses excellent convergence and noise-suppressing capability.Furthermore,numerical experiments and manipulator control instances are conducted and analyzed to validate the superior robustness of the proposed RDD-RNN model under various time-dependent noises,particularly quadratic polynomial noise.Eventually,small target detection experiments further demonstrate the practicality of the RDD-RNN model in image processing applications.展开更多
In this paper,we present a smoothing Newton-like method for solving nonlinear systems of equalities and inequalities.By using the so-called max function,we transfer the inequalities into a system of semismooth equalit...In this paper,we present a smoothing Newton-like method for solving nonlinear systems of equalities and inequalities.By using the so-called max function,we transfer the inequalities into a system of semismooth equalities.Then a smoothing Newton-like method is proposed for solving the reformulated system,which only needs to solve one system of linear equations and to perform one line search at each iteration. The global and local quadratic convergence are studied under appropriate assumptions. Numerical examples show that the new approach is effective.展开更多
In this paper, we introduce a concept of substationary points and present a new trust region-based method for the optimization problems with general nonlinear equality constraints and simple bounds. Without the linear...In this paper, we introduce a concept of substationary points and present a new trust region-based method for the optimization problems with general nonlinear equality constraints and simple bounds. Without the linear independent assumption on the gradients of the equalitiy constraints, we prove the global convergence results for the main algorithm and indicate that they extend the results on SQP and those on trust region methods for equality constrained optimizstion and for optimization with simple bounds. Moreover, since any nonlinear programming problem can be converted into the standard nonlinear programming by introducing slack variables, the trust region method preseated in this paper can be used for solving general nonlinear programming problems.展开更多
基金supported in part by the National Key Research and Development Program of China(2023YFC3011100)the National Natural Science Foundation of China(62476294)+1 种基金the Science and Technology Planning Project of Guangdong Province,China(2021B1212040017)the Guangdong Basic and Applied Basic Research Foundation(2025A1515010377,2023A1515110697).
文摘In recent years,numerous recurrent neural network(RNN)models have been reported for solving time-dependent nonlinear optimization problems.However,few existing RNN models simultaneously involve nonlinear equality constraints,direct discretization,and noise suppression.This limitation presents challenges when existing models are applied to practical engineering problems.Additionally,most current discrete-time RNN models are derived from continuous-time models,which may not perform well for solving essentially discrete problems.To handle these issues,a robust direct-discretized RNN(RDD-RNN)model is proposed to efficiently realize time-dependent optimization constrained by nonlinear equalities(TDOCNE)in the presence of various time-dependent noises.Theoretical analyses are provided to reveal that the proposed RDD-RNN model possesses excellent convergence and noise-suppressing capability.Furthermore,numerical experiments and manipulator control instances are conducted and analyzed to validate the superior robustness of the proposed RDD-RNN model under various time-dependent noises,particularly quadratic polynomial noise.Eventually,small target detection experiments further demonstrate the practicality of the RDD-RNN model in image processing applications.
基金supported by Guangdong Provincial Zhujiang Scholar Award Project,National Science Foundation of China(10671163,10871031)the National Basic Research Program under the Grant 2005CB321703Scientific Research Fund of Hunan Provincial Education Department(06A069,06C824)
文摘In this paper,we present a smoothing Newton-like method for solving nonlinear systems of equalities and inequalities.By using the so-called max function,we transfer the inequalities into a system of semismooth equalities.Then a smoothing Newton-like method is proposed for solving the reformulated system,which only needs to solve one system of linear equations and to perform one line search at each iteration. The global and local quadratic convergence are studied under appropriate assumptions. Numerical examples show that the new approach is effective.
文摘In this paper, we introduce a concept of substationary points and present a new trust region-based method for the optimization problems with general nonlinear equality constraints and simple bounds. Without the linear independent assumption on the gradients of the equalitiy constraints, we prove the global convergence results for the main algorithm and indicate that they extend the results on SQP and those on trust region methods for equality constrained optimizstion and for optimization with simple bounds. Moreover, since any nonlinear programming problem can be converted into the standard nonlinear programming by introducing slack variables, the trust region method preseated in this paper can be used for solving general nonlinear programming problems.
