In this study,we examine the problem of sliced inverse regression(SIR),a widely used method for sufficient dimension reduction(SDR).It was designed to find reduced-dimensional versions of multivariate predictors by re...In this study,we examine the problem of sliced inverse regression(SIR),a widely used method for sufficient dimension reduction(SDR).It was designed to find reduced-dimensional versions of multivariate predictors by replacing them with a minimally adequate collection of their linear combinations without loss of information.Recently,regularization methods have been proposed in SIR to incorporate a sparse structure of predictors for better interpretability.However,existing methods consider convex relaxation to bypass the sparsity constraint,which may not lead to the best subset,and particularly tends to include irrelevant variables when predictors are correlated.In this study,we approach sparse SIR as a nonconvex optimization problem and directly tackle the sparsity constraint by establishing the optimal conditions and iteratively solving them by means of the splicing technique.Without employing convex relaxation on the sparsity constraint and the orthogonal constraint,our algorithm exhibits superior empirical merits,as evidenced by extensive numerical studies.Computationally,our algorithm is much faster than the relaxed approach for the natural sparse SIR estimator.Statistically,our algorithm surpasses existing methods in terms of accuracy for central subspace estimation and best subset selection and sustains high performance even with correlated predictors.展开更多
This paper mainly focuses on the velocity-constrained consensus problem of discrete-time heterogeneous multi-agent systems with nonconvex constraints and arbitrarily switching topologies,where each agent has first-ord...This paper mainly focuses on the velocity-constrained consensus problem of discrete-time heterogeneous multi-agent systems with nonconvex constraints and arbitrarily switching topologies,where each agent has first-order or second-order dynamics.To solve this problem,a distributed algorithm is proposed based on a contraction operator.By employing the properties of the stochastic matrix,it is shown that all agents’position states could converge to a common point and second-order agents’velocity states could remain in corresponding nonconvex constraint sets and converge to zero as long as the joint communication topology has one directed spanning tree.Finally,the numerical simulation results are provided to verify the effectiveness of the proposed algorithms.展开更多
This paper addresses the distributed nonconvex optimization problem, where both the global cost function and local inequality constraint function are nonconvex. To tackle this issue, the p-power transformation and pen...This paper addresses the distributed nonconvex optimization problem, where both the global cost function and local inequality constraint function are nonconvex. To tackle this issue, the p-power transformation and penalty function techniques are introduced to reframe the nonconvex optimization problem. This ensures that the Hessian matrix of the augmented Lagrangian function becomes local positive definite by choosing appropriate control parameters. A multi-timescale primal-dual method is then devised based on the Karush-Kuhn-Tucker(KKT) point of the reformulated nonconvex problem to attain convergence. The Lyapunov theory guarantees the model's stability in the presence of an undirected and connected communication network. Finally, two nonconvex optimization problems are presented to demonstrate the efficacy of the previously developed method.展开更多
A cautious projection BFGS method is proposed for solving nonconvex unconstrained optimization problems.The global convergence of this method as well as a stronger general convergence result can be proven without a gr...A cautious projection BFGS method is proposed for solving nonconvex unconstrained optimization problems.The global convergence of this method as well as a stronger general convergence result can be proven without a gradient Lipschitz continuity assumption,which is more in line with the actual problems than the existing modified BFGS methods and the traditional BFGS method.Under some additional conditions,the method presented has a superlinear convergence rate,which can be regarded as an extension and supplement of BFGS-type methods with the projection technique.Finally,the effectiveness and application prospects of the proposed method are verified by numerical experiments.展开更多
We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the con...We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the convex and nonconvex problems.We also show the existence of extremal periodic solutions and provide a strong relaxation theorem.Finally,we provide an application to nonlinear periodic control systems.展开更多
Impulse noise removal is an important task in image restoration.In this paper,we introduce a general nonsmooth nonconvex model for recovering images degraded by blur and impulsive noise,which can easily include some p...Impulse noise removal is an important task in image restoration.In this paper,we introduce a general nonsmooth nonconvex model for recovering images degraded by blur and impulsive noise,which can easily include some prior information,such as box constraint or low rank,etc.To deal with the nonconvex problem,we employ the proximal linearized minimization algorithm.For the subproblem,we use the alternating direction method of multipliers to solve it.Furthermore,based on the assumption that the objective function satisfies the KurdykaLojasiewicz property,we prove the global convergence of the proposed algorithm.Numerical experiments demonstrate that our method outperforms both the l1TV and Nonconvex TV models in terms of subjective and objective quality measurements.展开更多
In this paper, our focus lies on addressing a two-block linearly constrained nonseparable nonconvex optimization problem with coupling terms. The most classical algorithm, the alternating direction method of multiplie...In this paper, our focus lies on addressing a two-block linearly constrained nonseparable nonconvex optimization problem with coupling terms. The most classical algorithm, the alternating direction method of multipliers (ADMM), is employed to solve such problems typically, which still requires the assumption of the gradient Lipschitz continuity condition on the objective function to ensure overall convergence from the current knowledge. However, many practical applications do not adhere to the conditions of smoothness. In this study, we justify the convergence of variant Bregman ADMM for the problem with coupling terms to circumvent the issue of the global Lipschitz continuity of the gradient. We demonstrate that the iterative sequence generated by our approach converges to a critical point of the issue when the corresponding function fulfills the Kurdyka-Lojasiewicz inequality and certain assumptions apply. In addition, we illustrate the convergence rate of the algorithm.展开更多
A number of previous papers have studied the problem of recovering low-rank matrices with noise, further combining the noisy and perturbed cases, we propose a nonconvex Schatten p-norm minimization method to deal with...A number of previous papers have studied the problem of recovering low-rank matrices with noise, further combining the noisy and perturbed cases, we propose a nonconvex Schatten p-norm minimization method to deal with the recovery of fully perturbed low-rank matrices. By utilizing the p-null space property (p-NSP) and the p-restricted isometry property (p-RIP) of the matrix, sufficient conditions to ensure that the stable and accurate reconstruction for low-rank matrix in the case of full perturbation are derived, and two upper bound recovery error estimation ns are given. These estimations are characterized by two vital aspects, one involving the best r-approximation error and the other concerning the overall noise. Specifically, this paper obtains two new error upper bounds based on the fact that p-RIP and p-NSP are able to recover accurately and stably low-rank matrix, and to some extent improve the conditions corresponding to RIP.展开更多
In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is ext...In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is extended to largely uncertain and non-convex sets of uncertainties and the combinational convex modeling is developed. The presented method not only extends applications of convex modeling, but also improves its accuracy in uncertain problems and computational efficiency. The numerical example illustrates the efficiency of the proposed method.展开更多
The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is considered.This problem is an important component of...The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is considered.This problem is an important component of many machine learning techniques with data parallelism,such as deep learning and federated learning.We propose a distributed primal-dual stochastic gradient descent(SGD)algorithm,suitable for arbitrarily connected communication networks and any smooth(possibly nonconvex)cost functions.We show that the proposed algorithm achieves the linear speedup convergence rate O(1/(√nT))for general nonconvex cost functions and the linear speedup convergence rate O(1/(nT)) when the global cost function satisfies the Polyak-Lojasiewicz(P-L)condition,where T is the total number of iterations.We also show that the output of the proposed algorithm with constant parameters linearly converges to a neighborhood of a global optimum.We demonstrate through numerical experiments the efficiency of our algorithm in comparison with the baseline centralized SGD and recently proposed distributed SGD algorithms.展开更多
In this paper, we consider the convergence of the generalized alternating direction method of multipliers（GADMM） for solving linearly constrained nonconvex minimization model whose objective contains coupled functio...In this paper, we consider the convergence of the generalized alternating direction method of multipliers（GADMM） for solving linearly constrained nonconvex minimization model whose objective contains coupled functions. Under the assumption that the augmented Lagrangian function satisfies the Kurdyka-Lojasiewicz inequality, we prove that the sequence generated by the GADMM converges to a critical point of the augmented Lagrangian function when the penalty parameter in the augmented Lagrangian function is sufficiently large. Moreover, we also present some sufficient conditions guaranteeing the sublinear and linear rate of convergence of the algorithm.展开更多
Let B2,p:= {z ∈ C2: |z1|2+ |z2|p< 1}（0 < p < 1）. Then, B2,p（0 < p < 1） is a non-convex complex ellipsoid in C2 without smooth boundary. In this article, we establish a boundary Schwarz lemma at z0 ...Let B2,p:= {z ∈ C2: |z1|2+ |z2|p< 1}（0 < p < 1）. Then, B2,p（0 < p < 1） is a non-convex complex ellipsoid in C2 without smooth boundary. In this article, we establish a boundary Schwarz lemma at z0 ∈ ?B2,p for holomorphic self-mappings of the non-convex complex ellipsoid B2,p, where z0 is any smooth boundary point of B2,p.展开更多
This paper addresses a nonlinear partial differential control system arising in population dynamics.The system consist of three diffusion equations describing the evolutions of three biological species:prey,predator,a...This paper addresses a nonlinear partial differential control system arising in population dynamics.The system consist of three diffusion equations describing the evolutions of three biological species:prey,predator,and food for the prey or vegetation.The equation for the food density incorporates a hysteresis operator of generalized stop type accounting for underlying hysteresis effects occurring in the dynamical process.We study the problem of minimization of a given integral cost functional over solutions of the above system.The set-valued mapping defining the control constraint is state-dependent and its values are nonconvex as is the cost integrand as a function of the control variable.Some relaxationtype results for the minimization problem are obtained and the existence of a nearly optimal solution is established.展开更多
Recent experiments revealed many new phenomena of the macroscopic domain patterns in the stress-induced phase transformation of a superelastic polycrystalline NiTi tube during tensile loading. The new phenomena includ...Recent experiments revealed many new phenomena of the macroscopic domain patterns in the stress-induced phase transformation of a superelastic polycrystalline NiTi tube during tensile loading. The new phenomena include deformation instability with the formation of a helical domain, domain topology transition from helix to cylinder, domain-front branching and loading-path dependence of domain patterns. In this paper, we model the polycrystal as an elastic continuum with nonconvex strain energy and adopt the non-local strain gradient energy to account for the energy of the diffusive domain front. We simulate the equilibrium domain patterns and their evolution in the tubes under tensile loading by a non-local Finite Element Method （FEM）. It is revealed that the observed loading-path dependence and topology transition of do- main patterns are due to the thermodynamic metastability of the tube system. The computation also shows that the tube-wall thickness has a significant effect on the domain patterns： with fixed material properties and interfacial energy density, a large tube-wall thickness leads to a long and slim helical domain and a severe branching of the cylindrical-domain front.展开更多
A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, ...A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, with the new objective function, the proposed algorithm can work well in online blind source separation （BSS） for the first time, although this family of algorithms is always thought to be valid only in batch-mode BSS by far. Simulations show that it is a very competitive joint diagonalization algorithm.展开更多
This paper studies the system stability problems of a class of nonconvex differential inclusions. At first, a basic stability result is obtained by virtue of locally Lipschitz continuous Lyapunov functions. Moreover, ...This paper studies the system stability problems of a class of nonconvex differential inclusions. At first, a basic stability result is obtained by virtue of locally Lipschitz continuous Lyapunov functions. Moreover, a generalized invariance principle and related attraction conditions are proposed and proved to overcome the technical difficulties due to the absence of convexity. In the technical analysis, a novel set-valued derivative is proposed to deal with nonsmooth systems and nonsmooth Lyapunov functions. Additionally, the obtained results are consistent with the existing ones in the case of convex differential inclusions with regular Lyapunov functions. Finally, illustrative examples are given to show the effectiveness of the methods.展开更多
Seismic data typically contain random missing traces because of obstacles and economic restrictions,influencing subsequent processing and interpretation.Seismic data recovery can be expressed as a low-rank matrix appr...Seismic data typically contain random missing traces because of obstacles and economic restrictions,influencing subsequent processing and interpretation.Seismic data recovery can be expressed as a low-rank matrix approximation problem by assuming a low-rank structure for the complete seismic data in the frequency–space(f–x)domain.The nuclear norm minimization(NNM)(sum of singular values)approach treats singular values equally,yielding a solution deviating from the optimal.Further,the log-sum majorization–minimization(LSMM)approach uses the nonconvex log-sum function as a rank substitution for seismic data interpolation,which is highly accurate but time-consuming.Therefore,this study proposes an efficient nonconvex reconstruction model based on the nonconvex Geman function(the nonconvex Geman low-rank(NCGL)model),involving a tighter approximation of the original rank function.Without introducing additional parameters,the nonconvex problem is solved using the Karush–Kuhn–Tucker condition theory.Experiments using synthetic and field data demonstrate that the proposed NCGL approach achieves a higher signal-to-noise ratio than the singular value thresholding method based on NNM and the projection onto convex sets method based on the data-driven threshold model.The proposed approach achieves higher reconstruction efficiency than the singular value thresholding and LSMM methods.展开更多
The margin maximization problem in digital subscriber line（DSL） systems is investigated.The particle swarm optimization（PSO） theory is applied to the nonconvex margin optimization problem with the target power and...The margin maximization problem in digital subscriber line（DSL） systems is investigated.The particle swarm optimization（PSO） theory is applied to the nonconvex margin optimization problem with the target power and rate constraints.PSO is a new evolution algorithm based on the social behavior of swarms, which can solve discontinuous, nonconvex and nonlinear problems efficiently.The proposed algorithm can converge to the global optimal solution, and numerical example demonstrates that the proposed algorithm can guarantee the fast convergence within a few iterations.展开更多
Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are present...Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are presented.The necessary condition is expressed without dual variables.The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.展开更多
文摘In this study,we examine the problem of sliced inverse regression(SIR),a widely used method for sufficient dimension reduction(SDR).It was designed to find reduced-dimensional versions of multivariate predictors by replacing them with a minimally adequate collection of their linear combinations without loss of information.Recently,regularization methods have been proposed in SIR to incorporate a sparse structure of predictors for better interpretability.However,existing methods consider convex relaxation to bypass the sparsity constraint,which may not lead to the best subset,and particularly tends to include irrelevant variables when predictors are correlated.In this study,we approach sparse SIR as a nonconvex optimization problem and directly tackle the sparsity constraint by establishing the optimal conditions and iteratively solving them by means of the splicing technique.Without employing convex relaxation on the sparsity constraint and the orthogonal constraint,our algorithm exhibits superior empirical merits,as evidenced by extensive numerical studies.Computationally,our algorithm is much faster than the relaxed approach for the natural sparse SIR estimator.Statistically,our algorithm surpasses existing methods in terms of accuracy for central subspace estimation and best subset selection and sustains high performance even with correlated predictors.
基金2024 Jiangsu Province Youth Science and Technology Talent Support Project2024 Yancheng Key Research and Development Plan(Social Development)projects,“Research and Application of Multi Agent Offline Distributed Trust Perception Virtual Wireless Sensor Network Algorithm”and“Research and Application of a New Type of Fishery Ship Safety Production Monitoring Equipment”。
文摘This paper mainly focuses on the velocity-constrained consensus problem of discrete-time heterogeneous multi-agent systems with nonconvex constraints and arbitrarily switching topologies,where each agent has first-order or second-order dynamics.To solve this problem,a distributed algorithm is proposed based on a contraction operator.By employing the properties of the stochastic matrix,it is shown that all agents’position states could converge to a common point and second-order agents’velocity states could remain in corresponding nonconvex constraint sets and converge to zero as long as the joint communication topology has one directed spanning tree.Finally,the numerical simulation results are provided to verify the effectiveness of the proposed algorithms.
基金supported in part by the National Natural Science Foundation of China(62236002,62403004,62203001,62303009,62136008)the Open Project of Anhui Key Laboratory of Industrial Energy-Saving and Safety,Anhui University(KFKT202405)
文摘This paper addresses the distributed nonconvex optimization problem, where both the global cost function and local inequality constraint function are nonconvex. To tackle this issue, the p-power transformation and penalty function techniques are introduced to reframe the nonconvex optimization problem. This ensures that the Hessian matrix of the augmented Lagrangian function becomes local positive definite by choosing appropriate control parameters. A multi-timescale primal-dual method is then devised based on the Karush-Kuhn-Tucker(KKT) point of the reformulated nonconvex problem to attain convergence. The Lyapunov theory guarantees the model's stability in the presence of an undirected and connected communication network. Finally, two nonconvex optimization problems are presented to demonstrate the efficacy of the previously developed method.
基金supported by the Guangxi Science and Technology base and Talent Project(AD22080047)the National Natural Science Foundation of Guangxi Province(2023GXNFSBA 026063)+1 种基金the Innovation Funds of Chinese University(2021BCF03001)the special foundation for Guangxi Ba Gui Scholars.
文摘A cautious projection BFGS method is proposed for solving nonconvex unconstrained optimization problems.The global convergence of this method as well as a stronger general convergence result can be proven without a gradient Lipschitz continuity assumption,which is more in line with the actual problems than the existing modified BFGS methods and the traditional BFGS method.Under some additional conditions,the method presented has a superlinear convergence rate,which can be regarded as an extension and supplement of BFGS-type methods with the projection technique.Finally,the effectiveness and application prospects of the proposed method are verified by numerical experiments.
基金supported by the NSFC(12071413)the Guangxi Natural Sci-ence Foundation(2023GXNSFAA026085)the European Union's Horizon 2020 Research and Innovation Programme under the Marie Sklodowska-Curie grant agreement No.823731 CONMECH。
文摘We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the convex and nonconvex problems.We also show the existence of extremal periodic solutions and provide a strong relaxation theorem.Finally,we provide an application to nonlinear periodic control systems.
基金Supported by the National Natural Science Foundations of China(Grant No.12061045,12031003)the Guangzhou Education Scientific Research Project 2024(Grant No.202315829)the Natural Science Foundation of Jiangxi Province(Grant No.20224ACB211004)。
文摘Impulse noise removal is an important task in image restoration.In this paper,we introduce a general nonsmooth nonconvex model for recovering images degraded by blur and impulsive noise,which can easily include some prior information,such as box constraint or low rank,etc.To deal with the nonconvex problem,we employ the proximal linearized minimization algorithm.For the subproblem,we use the alternating direction method of multipliers to solve it.Furthermore,based on the assumption that the objective function satisfies the KurdykaLojasiewicz property,we prove the global convergence of the proposed algorithm.Numerical experiments demonstrate that our method outperforms both the l1TV and Nonconvex TV models in terms of subjective and objective quality measurements.
文摘In this paper, our focus lies on addressing a two-block linearly constrained nonseparable nonconvex optimization problem with coupling terms. The most classical algorithm, the alternating direction method of multipliers (ADMM), is employed to solve such problems typically, which still requires the assumption of the gradient Lipschitz continuity condition on the objective function to ensure overall convergence from the current knowledge. However, many practical applications do not adhere to the conditions of smoothness. In this study, we justify the convergence of variant Bregman ADMM for the problem with coupling terms to circumvent the issue of the global Lipschitz continuity of the gradient. We demonstrate that the iterative sequence generated by our approach converges to a critical point of the issue when the corresponding function fulfills the Kurdyka-Lojasiewicz inequality and certain assumptions apply. In addition, we illustrate the convergence rate of the algorithm.
文摘A number of previous papers have studied the problem of recovering low-rank matrices with noise, further combining the noisy and perturbed cases, we propose a nonconvex Schatten p-norm minimization method to deal with the recovery of fully perturbed low-rank matrices. By utilizing the p-null space property (p-NSP) and the p-restricted isometry property (p-RIP) of the matrix, sufficient conditions to ensure that the stable and accurate reconstruction for low-rank matrix in the case of full perturbation are derived, and two upper bound recovery error estimation ns are given. These estimations are characterized by two vital aspects, one involving the best r-approximation error and the other concerning the overall noise. Specifically, this paper obtains two new error upper bounds based on the fact that p-RIP and p-NSP are able to recover accurately and stably low-rank matrix, and to some extent improve the conditions corresponding to RIP.
基金The project supported by the National Outstanding Youth Science Foundation of China the National Post Doctor Science Foundation of China
文摘In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is extended to largely uncertain and non-convex sets of uncertainties and the combinational convex modeling is developed. The presented method not only extends applications of convex modeling, but also improves its accuracy in uncertain problems and computational efficiency. The numerical example illustrates the efficiency of the proposed method.
基金supported by the Knut and Alice Wallenberg Foundationthe Swedish Foundation for Strategic Research+1 种基金the Swedish Research Councilthe National Natural Science Foundation of China(62133003,61991403,61991404,61991400)。
文摘The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is considered.This problem is an important component of many machine learning techniques with data parallelism,such as deep learning and federated learning.We propose a distributed primal-dual stochastic gradient descent(SGD)algorithm,suitable for arbitrarily connected communication networks and any smooth(possibly nonconvex)cost functions.We show that the proposed algorithm achieves the linear speedup convergence rate O(1/(√nT))for general nonconvex cost functions and the linear speedup convergence rate O(1/(nT)) when the global cost function satisfies the Polyak-Lojasiewicz(P-L)condition,where T is the total number of iterations.We also show that the output of the proposed algorithm with constant parameters linearly converges to a neighborhood of a global optimum.We demonstrate through numerical experiments the efficiency of our algorithm in comparison with the baseline centralized SGD and recently proposed distributed SGD algorithms.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1157117811801455)the Fundamental Research Funds of China West Normal University(Grant No.17E084)
文摘In this paper, we consider the convergence of the generalized alternating direction method of multipliers（GADMM） for solving linearly constrained nonconvex minimization model whose objective contains coupled functions. Under the assumption that the augmented Lagrangian function satisfies the Kurdyka-Lojasiewicz inequality, we prove that the sequence generated by the GADMM converges to a critical point of the augmented Lagrangian function when the penalty parameter in the augmented Lagrangian function is sufficiently large. Moreover, we also present some sufficient conditions guaranteeing the sublinear and linear rate of convergence of the algorithm.
基金The project supported in part by the National Natural Science Foundation of China(11671306)
文摘Let B2,p:= {z ∈ C2: |z1|2+ |z2|p< 1}（0 < p < 1）. Then, B2,p（0 < p < 1） is a non-convex complex ellipsoid in C2 without smooth boundary. In this article, we establish a boundary Schwarz lemma at z0 ∈ ?B2,p for holomorphic self-mappings of the non-convex complex ellipsoid B2,p, where z0 is any smooth boundary point of B2,p.
基金supported by National Natural Science Foundation of China(12071165 and 62076104)Natural Science Foundation of Fujian Province(2020J01072)+2 种基金Program for Innovative Research Team in Science and Technology in Fujian Province University,Quanzhou High-Level Talents Support Plan(2017ZT012)Scientific Research Funds of Huaqiao University(605-50Y 19017,605-50Y14040)supported by Ministry of Science and Higher Education of Russian Federation(075-15-2020-787,large scientific project"Fundamentals,methods and technologies for digital monitoring and forecasting of the environmental situation on the Baikal natural territory")。
文摘This paper addresses a nonlinear partial differential control system arising in population dynamics.The system consist of three diffusion equations describing the evolutions of three biological species:prey,predator,and food for the prey or vegetation.The equation for the food density incorporates a hysteresis operator of generalized stop type accounting for underlying hysteresis effects occurring in the dynamical process.We study the problem of minimization of a given integral cost functional over solutions of the above system.The set-valued mapping defining the control constraint is state-dependent and its values are nonconvex as is the cost integrand as a function of the control variable.Some relaxationtype results for the minimization problem are obtained and the existence of a nearly optimal solution is established.
文摘Recent experiments revealed many new phenomena of the macroscopic domain patterns in the stress-induced phase transformation of a superelastic polycrystalline NiTi tube during tensile loading. The new phenomena include deformation instability with the formation of a helical domain, domain topology transition from helix to cylinder, domain-front branching and loading-path dependence of domain patterns. In this paper, we model the polycrystal as an elastic continuum with nonconvex strain energy and adopt the non-local strain gradient energy to account for the energy of the diffusive domain front. We simulate the equilibrium domain patterns and their evolution in the tubes under tensile loading by a non-local Finite Element Method （FEM）. It is revealed that the observed loading-path dependence and topology transition of do- main patterns are due to the thermodynamic metastability of the tube system. The computation also shows that the tube-wall thickness has a significant effect on the domain patterns： with fixed material properties and interfacial energy density, a large tube-wall thickness leads to a long and slim helical domain and a severe branching of the cylindrical-domain front.
基金supported partly by the Key Program of National Natural Science Foundation of China (U0635001U0835003)+3 种基金the National Natural Science Foundation of China (60505005 60674033 60774094)the Natural Science Fundof Guangdong Province (05006508).
文摘A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, with the new objective function, the proposed algorithm can work well in online blind source separation （BSS） for the first time, although this family of algorithms is always thought to be valid only in batch-mode BSS by far. Simulations show that it is a very competitive joint diagonalization algorithm.
基金This work was supported by the geijing Natural Science Foundation （No. 4152057）, the Natural Science Foundation of China （Nos. 61333001, 61573344）, and the China Postdoctoral Science Foundation （No. 2015M581190）.
文摘This paper studies the system stability problems of a class of nonconvex differential inclusions. At first, a basic stability result is obtained by virtue of locally Lipschitz continuous Lyapunov functions. Moreover, a generalized invariance principle and related attraction conditions are proposed and proved to overcome the technical difficulties due to the absence of convexity. In the technical analysis, a novel set-valued derivative is proposed to deal with nonsmooth systems and nonsmooth Lyapunov functions. Additionally, the obtained results are consistent with the existing ones in the case of convex differential inclusions with regular Lyapunov functions. Finally, illustrative examples are given to show the effectiveness of the methods.
基金financially supported by the National Key R&D Program of China(No.2018YFC1503705)the Science and Technology Research Project of Hubei Provincial Department of Education(No.B2017597)+1 种基金the Hubei Subsurface Multiscale Imaging Key Laboratory(China University of Geosciences)(No.SMIL-2018-06)the Fundamental Research Funds for the Central Universities(No.CCNU19TS020).
文摘Seismic data typically contain random missing traces because of obstacles and economic restrictions,influencing subsequent processing and interpretation.Seismic data recovery can be expressed as a low-rank matrix approximation problem by assuming a low-rank structure for the complete seismic data in the frequency–space(f–x)domain.The nuclear norm minimization(NNM)(sum of singular values)approach treats singular values equally,yielding a solution deviating from the optimal.Further,the log-sum majorization–minimization(LSMM)approach uses the nonconvex log-sum function as a rank substitution for seismic data interpolation,which is highly accurate but time-consuming.Therefore,this study proposes an efficient nonconvex reconstruction model based on the nonconvex Geman function(the nonconvex Geman low-rank(NCGL)model),involving a tighter approximation of the original rank function.Without introducing additional parameters,the nonconvex problem is solved using the Karush–Kuhn–Tucker condition theory.Experiments using synthetic and field data demonstrate that the proposed NCGL approach achieves a higher signal-to-noise ratio than the singular value thresholding method based on NNM and the projection onto convex sets method based on the data-driven threshold model.The proposed approach achieves higher reconstruction efficiency than the singular value thresholding and LSMM methods.
基金supported by the National Natural Science Foundation of China for Distinguished Young Scholars (60525303)the National Natural Science Foundation of China (60904048+2 种基金 60404022 60604012)the Natural Science Foundation of Hebei province (F2005000390)
文摘The margin maximization problem in digital subscriber line（DSL） systems is investigated.The particle swarm optimization（PSO） theory is applied to the nonconvex margin optimization problem with the target power and rate constraints.PSO is a new evolution algorithm based on the social behavior of swarms, which can solve discontinuous, nonconvex and nonlinear problems efficiently.The proposed algorithm can converge to the global optimal solution, and numerical example demonstrates that the proposed algorithm can guarantee the fast convergence within a few iterations.
文摘Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper.Global optimality conditions for these problems,including a necessary condition and some sufficient conditions,are presented.The necessary condition is expressed without dual variables.The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.
