Hardware/software partitioning is an important step in the design of embedded systems. In this paper, the hardware/software partitioning problem is modeled as a constrained binary integer programming problem, which is...Hardware/software partitioning is an important step in the design of embedded systems. In this paper, the hardware/software partitioning problem is modeled as a constrained binary integer programming problem, which is further converted equivalently to an unconstrained binary integer programming problem by a penalty method. A local search method, HSFM, is developed to obtain a discrete local minimizer of the unconstrained binary integer programming problem. Next, an auxiliary function, which has the same global optimal solutions as the unconstrained binary integer programming problem, is constructed, and its properties are studied. We show that applying HSFM to minimize the auxiliary function can escape from previous local optima by the increase of the parameter value successfully. Finally, a discrete dynamic convexized method is developed to solve the hardware/software partitioning problem. Computational results and comparisons indicate that the proposed algorithm can get high-quality solutions.展开更多
Given an undirected graph with edge weights,the max-cut problem is to find a partition of the vertices into twosubsets,such that the sumof theweights of the edges crossing different subsets ismaximized.Heuristics base...Given an undirected graph with edge weights,the max-cut problem is to find a partition of the vertices into twosubsets,such that the sumof theweights of the edges crossing different subsets ismaximized.Heuristics based on auxiliary function can obtain high-quality solutions of the max-cut problem,but suffer high solution cost when instances grow large.In this paper,we combine clustered adaptive multistart and discrete dynamic convexized method to obtain high-quality solutions in a reasonable time.Computational experiments on two sets of benchmark instances from the literature were performed.Numerical results and comparisons with some heuristics based on auxiliary function show that the proposed algorithm is much faster and can obtain better solutions.Comparisons with several state-ofthe-science heuristics demonstrate that the proposed algorithm is competitive.展开更多
A debris flow descending through an erodible convex colluvial bed,originating from a landslide dam and its upstream deposits,can entrain massive amounts of sediment,dramatically increasing the debris flow volume.Most ...A debris flow descending through an erodible convex colluvial bed,originating from a landslide dam and its upstream deposits,can entrain massive amounts of sediment,dramatically increasing the debris flow volume.Most existing erosion models assume that bed sediments are fully saturated,although this condition is rarely observed in nature.Therefore,a thorough understanding of debris flow overtopping erosion on a convex unsaturated bed is crucial for quantifying disaster risk.In this study,we experimentally investigated the effects of sediment composition,specifically coarse-grain size distribution and fine particle content,on the pore pressure evolution and entrainment of debris flows overriding a convex unsaturated colluvial bed.The average entrainment rate at convex sites for continuously graded bed sediment was higher than its discontinuous counterpart.The measured pore pressures within the unsaturated bed sediments were primarily generated by the passing debris flows.Furthermore,it was found that these pressures decreased as the fine particle content increased and the coarse-grain size of the erodible substrates decreased.When the coarse-grain size of the debris flow was smaller than that of the bed sediment,only a portion of the eroded material was entrained by the moving debris flow.In contrast,when the coarse-grain size of the debris flow was equal to or greater than that of the bed sediment,nearly all of the eroded material was entrained.The findings of this study could contribute to the assessment of hazard amplification and inform the design of mitigation and prevention strategies.展开更多
We investigated the impact of convexity and isoperimetric deficits on the accuracy of sectional area estimates of tree stems using traditional methods(caliper,tape,formulas based on stem diameter and circumference).In...We investigated the impact of convexity and isoperimetric deficits on the accuracy of sectional area estimates of tree stems using traditional methods(caliper,tape,formulas based on stem diameter and circumference).In two complementary experiments,the use of photographs to estimate cross-sectional areas was first validated,then the use of a caliper and diameter tape was computer-simulated.The results indicated that the photographic method offers high precision,with mean relative errors below 0.1%,minimal deviation,and no significant bias,and the traditional methods led to substantial and systematic errors,with deviations from circularity and convexity significantly increasing the errors in area estimation.展开更多
Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recov...Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery. We first derive the projection formulas for a vector onto the feasible sets. The centralized circumcentered-reflection method is designed to solve the convex feasibility problem. Some numerical experiments demonstrate the feasibility and effectiveness of the proposed algorithm, showing superior performance compared to conventional alternating projection methods.展开更多
Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic e...Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe.展开更多
Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequent...Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A^(*)Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time.展开更多
The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex b...The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex body.The Orlicz Minkowski problem for loga-rithmic capacity includes the Minkowski problem for logarithmic capacity and the Lp Minkowski problem for logarithmic capacity as special cases.The discrete case has been solved by the researchers.In this paper,we solve the Orlicz Minkowski problem for logarithmic capacity with respect to general Borel measures by applying an approximation scheme.展开更多
An upper estimate of the new curvature entropy is provided,via the integral inequality of a concave function.For two origin-symmetric convex bodies in R^(n),this bound is sharper than the log-Minkowski inequality of c...An upper estimate of the new curvature entropy is provided,via the integral inequality of a concave function.For two origin-symmetric convex bodies in R^(n),this bound is sharper than the log-Minkowski inequality of curvature entropy.As its application,a novel proof of the log-Minkowski inequality of curvature entropy in the plane is given.展开更多
In this paper,we use the solution of the even functional Minkowski problem to show that there is a minimizing affine Minkowski total variation of the function of bounded variation.Moreover,for the Minkowski total vari...In this paper,we use the solution of the even functional Minkowski problem to show that there is a minimizing affine Minkowski total variation of the function of bounded variation.Moreover,for the Minkowski total variation,we use the method of convexation to establish the same conclusion as the convex body space.展开更多
In this paper,we develop an inexact symmetric proximal alternating direction method of multipliers(ISPADMM)with two convex combinations(ISPADMM-tcc)for solving two-block separable convex optimization problems with lin...In this paper,we develop an inexact symmetric proximal alternating direction method of multipliers(ISPADMM)with two convex combinations(ISPADMM-tcc)for solving two-block separable convex optimization problems with linear equality constraints.Specifically,the convex combination technique is incorporated into the proximal centers of both subproblems.We then approximately solve these two subproblems based on relative error criteria.The global convergence,and O(1/N)ergodic sublinear convergence rate measured by the function value residual and constraint violation are established under some mild conditions,where N denotes the number of iterations.Finally,numerical experiments on solving the l1-regularized analysis sparse recovery and the elastic net regularization regression problems illustrate the feasibility and effectiveness of the proposed method.展开更多
Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient c...Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient conditions on V such that ifΩis convex,the solution u is log-concave.We also determine sufficient conditions ensuring that λ_(V),as a function of the setΩ,verifies a convexity inequality with respect to the Minkowski addition of sets.展开更多
This study aims to develop a high-precision and cost-efficient method for the threedimensional reconstruction of large particles in natural gravel and blasted rock fragments,utilizing Structure from Motion(SfM)and Mul...This study aims to develop a high-precision and cost-efficient method for the threedimensional reconstruction of large particles in natural gravel and blasted rock fragments,utilizing Structure from Motion(SfM)and Multi-View Stereo(MVS)techniques.The proposed approach was applied to characterize the three-dimensional morphology of rockfill dam materials at a real construction site.Particle shape was quantitatively analyzed using shape indices of sphericity,convexity,and angularity.The predominant morphology of natural gravel is characterized as slightly elongated and slightly flat,while rock fragments are slightly elongated and not flat.Probability density distributions of shape indices follow a skewed normal distribution:sphericity and convexity show leftward skewness,whereas angularity is right-skewed.Skewness parameters of sphericity and angularity are consistent between natural gravel and blasted rock fragments,indicating comparable shape asymmetry.Convexity skewness is significantly higher in natural gravel compared to rock fragments,by approximately an order of magnitude.The relationship between size and particle shape shows that form ratios and associated shape descriptors change linearly with the logarithm of size;larger particles approach spherical or cubic forms.The innovative measurements contribute to the particle shape data set of rockfill dam materials,providing valuable insights into the three-dimensional and statistical morphological characteristics of relatively large particles in natural gravel and blasted rock fragments.This approach enhances understanding of particle morphology's impact on the mechanical behavior of granular materials.展开更多
In this paper,we consider the distributed online optimization problem on a time-varying network,where each agent on the network has its own time-varying objective function and the goal is to minimize the overall loss ...In this paper,we consider the distributed online optimization problem on a time-varying network,where each agent on the network has its own time-varying objective function and the goal is to minimize the overall loss accumulated.Moreover,we focus on distributed algorithms which do not use gradient information and projection operators to improve the applicability and computational efficiency.By introducing the deterministic differences and the randomized differences to substitute the gradient information of the objective functions and removing the projection operator in the traditional algorithms,we design two kinds of gradient-free distributed online optimization algorithms without projection step,which can economize considerable computational resources as well as has less limitations on the applicability.We prove that both of two algorithms achieves consensus of the estimates and regrets of\(O\left(\log(T)\right)\)for local strongly convex objective,respectively.Finally,a simulation example is provided to verify the theoretical results.展开更多
Isoperimetric type inequalities for integral geometric invariants of random lines in the Euclidean space are shown.Entropy inequalities of probability densities on the affine Grassmann manifold of lines are given.
In the paper,a class of functions with bounded turnings involving cardioid domain,are studied in the region of the unit disc.The bounds of|a_(5)|,|a_(6)|,|a_(7)|and the fourth Hankel determinant are obtained,which are...In the paper,a class of functions with bounded turnings involving cardioid domain,are studied in the region of the unit disc.The bounds of|a_(5)|,|a_(6)|,|a_(7)|and the fourth Hankel determinant are obtained,which are more accurate than those obtained by Srivastava.展开更多
With the development of integrated power and gas distribution systems(IPGS)incorporating renewable energy sources(RESs),coordinating the restoration processes of the power distribution system(PS)and the gas distributi...With the development of integrated power and gas distribution systems(IPGS)incorporating renewable energy sources(RESs),coordinating the restoration processes of the power distribution system(PS)and the gas distribution system(GS)by utilizing the benefits of RESs enhances service restoration.In this context,this paper proposes a coordinated service restoration framework that considers the uncertainty in RESs and the bi-directional restoration interactions between the PS and GS.Additionally,a coordinated service restoration model is developed considering the two systems’interdependency and the GS’s dynamic characteristics.The objective is to maximize the system resilience index while adhering to operational,dynamic,restoration logic,and interdependency constraints.A method for managing uncertainties in RES output is employed,and convexification techniques are applied to address the nonlinear constraints arising from the physical laws of the IPGS,thereby reducing solution complexity.As a result,the service restoration optimization problem of the IPGS can be formulated as a computationally tractable mixed-integer second-order cone programming problem.The effectiveness and superiority of the proposed framework are demonstrated through numerical simulations conducted on the interdependent IEEE 13-bus PS and 9-node GS.The comparative results show that the proposed framework improves the system resilience index by at least 65.07%compared to traditional methods.展开更多
In this paper,an online midcourse guidance method for intercepting high-speed maneuvering targets is proposed.Firstly,the affine system is used to build a dynamic model and analyze the state constraints.The midcourse ...In this paper,an online midcourse guidance method for intercepting high-speed maneuvering targets is proposed.Firstly,the affine system is used to build a dynamic model and analyze the state constraints.The midcourse guidance problem is transformed into a continuous time optimization problem.Secondly,the problem is transformed into a discrete convex programming problem by affine control variable relaxation,Gaussian pseudospectral discretization and constraints linearization.Then,the off-line midcourse guidance trajectory is generated before midcourse guidance.It is used as the initial reference trajectory for online correction of midcourse guidance.An online guidance framework is used to eliminate the error caused by calculation of guidance instruction time.And the design of discrete points decreases with flight time to improve the solving efficiency.In addition,it is proposed that the terminal guidance capture is used innovatively space to judge the success of midcourse guidance.Numerical simulation shows the feasibility and effectiveness of the proposed method.展开更多
基金Supported by the National Natural Science Foundation of China(11301255)the Fund by Collaborative Innovation Center of IoT Industrialization and Intelligent Production,Minjiang University(IIC1703)+1 种基金Foundation of Minjiang University(MYK17032)the Program for New Century Excellent Talents in Fujian Province University
文摘Hardware/software partitioning is an important step in the design of embedded systems. In this paper, the hardware/software partitioning problem is modeled as a constrained binary integer programming problem, which is further converted equivalently to an unconstrained binary integer programming problem by a penalty method. A local search method, HSFM, is developed to obtain a discrete local minimizer of the unconstrained binary integer programming problem. Next, an auxiliary function, which has the same global optimal solutions as the unconstrained binary integer programming problem, is constructed, and its properties are studied. We show that applying HSFM to minimize the auxiliary function can escape from previous local optima by the increase of the parameter value successfully. Finally, a discrete dynamic convexized method is developed to solve the hardware/software partitioning problem. Computational results and comparisons indicate that the proposed algorithm can get high-quality solutions.
基金supported partially by the National Natural Science Foundation of China(Nos.11226236 and 11301255)the Natural Science Foundation of Fujian Province of China(No.2012J05007)the Science and Technology Project of the Education Bureau of Fujian,China(Nos.JA13246 and JK2012037).
文摘Given an undirected graph with edge weights,the max-cut problem is to find a partition of the vertices into twosubsets,such that the sumof theweights of the edges crossing different subsets ismaximized.Heuristics based on auxiliary function can obtain high-quality solutions of the max-cut problem,but suffer high solution cost when instances grow large.In this paper,we combine clustered adaptive multistart and discrete dynamic convexized method to obtain high-quality solutions in a reasonable time.Computational experiments on two sets of benchmark instances from the literature were performed.Numerical results and comparisons with some heuristics based on auxiliary function show that the proposed algorithm is much faster and can obtain better solutions.Comparisons with several state-ofthe-science heuristics demonstrate that the proposed algorithm is competitive.
基金supported by the National Key R&D Program of China(Grant No.2018YFC1505205)the Science and Technology Research Program of the Institute of Mountain Hazards and Environment,Chinese Academy of Sciences(Grant No.IMHE-ZDRW-01)Sichuan Science and Technology Program(Grant No.2024NSFSC0781).
文摘A debris flow descending through an erodible convex colluvial bed,originating from a landslide dam and its upstream deposits,can entrain massive amounts of sediment,dramatically increasing the debris flow volume.Most existing erosion models assume that bed sediments are fully saturated,although this condition is rarely observed in nature.Therefore,a thorough understanding of debris flow overtopping erosion on a convex unsaturated bed is crucial for quantifying disaster risk.In this study,we experimentally investigated the effects of sediment composition,specifically coarse-grain size distribution and fine particle content,on the pore pressure evolution and entrainment of debris flows overriding a convex unsaturated colluvial bed.The average entrainment rate at convex sites for continuously graded bed sediment was higher than its discontinuous counterpart.The measured pore pressures within the unsaturated bed sediments were primarily generated by the passing debris flows.Furthermore,it was found that these pressures decreased as the fine particle content increased and the coarse-grain size of the erodible substrates decreased.When the coarse-grain size of the debris flow was smaller than that of the bed sediment,only a portion of the eroded material was entrained by the moving debris flow.In contrast,when the coarse-grain size of the debris flow was equal to or greater than that of the bed sediment,nearly all of the eroded material was entrained.The findings of this study could contribute to the assessment of hazard amplification and inform the design of mitigation and prevention strategies.
文摘We investigated the impact of convexity and isoperimetric deficits on the accuracy of sectional area estimates of tree stems using traditional methods(caliper,tape,formulas based on stem diameter and circumference).In two complementary experiments,the use of photographs to estimate cross-sectional areas was first validated,then the use of a caliper and diameter tape was computer-simulated.The results indicated that the photographic method offers high precision,with mean relative errors below 0.1%,minimal deviation,and no significant bias,and the traditional methods led to substantial and systematic errors,with deviations from circularity and convexity significantly increasing the errors in area estimation.
基金Supported by the Natural Science Foundation of Guangxi Province(Grant Nos.2023GXNSFAA026067,2024GXN SFAA010521)the National Natural Science Foundation of China(Nos.12361079,12201149,12261026).
文摘Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery. We first derive the projection formulas for a vector onto the feasible sets. The centralized circumcentered-reflection method is designed to solve the convex feasibility problem. Some numerical experiments demonstrate the feasibility and effectiveness of the proposed algorithm, showing superior performance compared to conventional alternating projection methods.
基金supported by the National Natural Science Foundation of China(61503408)。
文摘Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe.
基金supported by the National Natural Science Foundation of China(No.62203256)。
文摘Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A^(*)Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time.
基金Supported by Postgraduate Scientific Research Innovation Project of Hunan Province(CX20231033)Science and Technology Research Project of Jiangxi Provincial Education Department(GJJ210815)+2 种基金Jiangxi Provincial Natural Science Foundation(20232BAB201005)the National Natural Science Founda-tion of China(12461010,12161043)the Scientific Research Fund of Hunan Provincial Education Department(24A0338)。
文摘The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex body.The Orlicz Minkowski problem for loga-rithmic capacity includes the Minkowski problem for logarithmic capacity and the Lp Minkowski problem for logarithmic capacity as special cases.The discrete case has been solved by the researchers.In this paper,we solve the Orlicz Minkowski problem for logarithmic capacity with respect to general Borel measures by applying an approximation scheme.
基金supported by the NSFC(12171378)supported by the Characteristic innovation projects of universities in Guangdong province(2023K-TSCX381)+3 种基金supported by the Young Top-Talent program of Chongqing(CQYC2021059145)the Major Special Project of NSFC(12141101)the Science and Technology Research Program of Chongqing Municipal Education Commission(KJZD-K202200509)the Natural Science Foundation Project of Chongqing(CSTB2024NSCQ-MSX0937).
文摘An upper estimate of the new curvature entropy is provided,via the integral inequality of a concave function.For two origin-symmetric convex bodies in R^(n),this bound is sharper than the log-Minkowski inequality of curvature entropy.As its application,a novel proof of the log-Minkowski inequality of curvature entropy in the plane is given.
文摘A survey of recent progress on the multiplicity and stability problems for closed characteristics on compact convex hypersurfaces in R^(2n) is given.
基金Supported in part by NSFC(No.11971005)the Fundamental Research Funds for the Central Universities(Nos.GK202101008,GK202102012)。
文摘In this paper,we use the solution of the even functional Minkowski problem to show that there is a minimizing affine Minkowski total variation of the function of bounded variation.Moreover,for the Minkowski total variation,we use the method of convexation to establish the same conclusion as the convex body space.
基金supported by the National Natural Science Foundation of China(12171106)the Guangxi Science and Technology Program(AD23023001)+4 种基金the Natural Science Foundation of Guangxi Province(2023GXNSFBA026029)the National Natural Science Foundation of China(12401403,12361063)the Research Project of Guangxi Minzu University(2022KJQD03)the Middle-aged and Young Teachers’Basic Ability Promotion Project of Guangxi Province(2023KY0168)the Xiangsihu Young Scholars Innovative Research Team of Guangxi Minzu University(2022GXUNXSHQN04).
文摘In this paper,we develop an inexact symmetric proximal alternating direction method of multipliers(ISPADMM)with two convex combinations(ISPADMM-tcc)for solving two-block separable convex optimization problems with linear equality constraints.Specifically,the convex combination technique is incorporated into the proximal centers of both subproblems.We then approximately solve these two subproblems based on relative error criteria.The global convergence,and O(1/N)ergodic sublinear convergence rate measured by the function value residual and constraint violation are established under some mild conditions,where N denotes the number of iterations.Finally,numerical experiments on solving the l1-regularized analysis sparse recovery and the elastic net regularization regression problems illustrate the feasibility and effectiveness of the proposed method.
基金supported by the project Disuguaglianze analitiche e geometriche,funded by the Gruppo per Analisi Matematica la Probabilitàe le loro Applicazioni.
文摘Given an open bounded subset Ω of ℝ^(n) we consider the eigenvalue problem{Δu-(■u,■V)=-λvu,u>0inΩ,u=0 onδΩ,where V is a given function defined inΩandλV is the relevant eigenvalue.We determine sufficient conditions on V such that ifΩis convex,the solution u is log-concave.We also determine sufficient conditions ensuring that λ_(V),as a function of the setΩ,verifies a convexity inequality with respect to the Minkowski addition of sets.
基金National Natural Science Foundation of China,Grant/Award Numbers:51809290,51979093,52239009Project funded by Tibet Autonomous Region Key R&D Plan,Grant/Award Number:XZ202101ZY0002GPostgraduate Research&Practice Innovation Program of Jiangsu Province,Grant/Award Number:No.KYCX22_0656。
文摘This study aims to develop a high-precision and cost-efficient method for the threedimensional reconstruction of large particles in natural gravel and blasted rock fragments,utilizing Structure from Motion(SfM)and Multi-View Stereo(MVS)techniques.The proposed approach was applied to characterize the three-dimensional morphology of rockfill dam materials at a real construction site.Particle shape was quantitatively analyzed using shape indices of sphericity,convexity,and angularity.The predominant morphology of natural gravel is characterized as slightly elongated and slightly flat,while rock fragments are slightly elongated and not flat.Probability density distributions of shape indices follow a skewed normal distribution:sphericity and convexity show leftward skewness,whereas angularity is right-skewed.Skewness parameters of sphericity and angularity are consistent between natural gravel and blasted rock fragments,indicating comparable shape asymmetry.Convexity skewness is significantly higher in natural gravel compared to rock fragments,by approximately an order of magnitude.The relationship between size and particle shape shows that form ratios and associated shape descriptors change linearly with the logarithm of size;larger particles approach spherical or cubic forms.The innovative measurements contribute to the particle shape data set of rockfill dam materials,providing valuable insights into the three-dimensional and statistical morphological characteristics of relatively large particles in natural gravel and blasted rock fragments.This approach enhances understanding of particle morphology's impact on the mechanical behavior of granular materials.
文摘In this paper,we consider the distributed online optimization problem on a time-varying network,where each agent on the network has its own time-varying objective function and the goal is to minimize the overall loss accumulated.Moreover,we focus on distributed algorithms which do not use gradient information and projection operators to improve the applicability and computational efficiency.By introducing the deterministic differences and the randomized differences to substitute the gradient information of the objective functions and removing the projection operator in the traditional algorithms,we design two kinds of gradient-free distributed online optimization algorithms without projection step,which can economize considerable computational resources as well as has less limitations on the applicability.We prove that both of two algorithms achieves consensus of the estimates and regrets of\(O\left(\log(T)\right)\)for local strongly convex objective,respectively.Finally,a simulation example is provided to verify the theoretical results.
文摘Isoperimetric type inequalities for integral geometric invariants of random lines in the Euclidean space are shown.Entropy inequalities of probability densities on the affine Grassmann manifold of lines are given.
基金Supported by the Natural Science Foundation of Anhui Provincial Department of Education(Grant Nos.KJ2020A 0993KJ2020ZD74)+2 种基金the High-Level Talent Research Start-Up Project(Grant No.DC2300000286)the Foundation of Guangzhou Civil Aviation College(Grant Nos.22X041824X4412).
文摘In the paper,a class of functions with bounded turnings involving cardioid domain,are studied in the region of the unit disc.The bounds of|a_(5)|,|a_(6)|,|a_(7)|and the fourth Hankel determinant are obtained,which are more accurate than those obtained by Srivastava.
基金funded by the Science and Technology Project of State Grid Shanxi Electric Power Company(5205E0230001).
文摘With the development of integrated power and gas distribution systems(IPGS)incorporating renewable energy sources(RESs),coordinating the restoration processes of the power distribution system(PS)and the gas distribution system(GS)by utilizing the benefits of RESs enhances service restoration.In this context,this paper proposes a coordinated service restoration framework that considers the uncertainty in RESs and the bi-directional restoration interactions between the PS and GS.Additionally,a coordinated service restoration model is developed considering the two systems’interdependency and the GS’s dynamic characteristics.The objective is to maximize the system resilience index while adhering to operational,dynamic,restoration logic,and interdependency constraints.A method for managing uncertainties in RES output is employed,and convexification techniques are applied to address the nonlinear constraints arising from the physical laws of the IPGS,thereby reducing solution complexity.As a result,the service restoration optimization problem of the IPGS can be formulated as a computationally tractable mixed-integer second-order cone programming problem.The effectiveness and superiority of the proposed framework are demonstrated through numerical simulations conducted on the interdependent IEEE 13-bus PS and 9-node GS.The comparative results show that the proposed framework improves the system resilience index by at least 65.07%compared to traditional methods.
文摘In this paper,an online midcourse guidance method for intercepting high-speed maneuvering targets is proposed.Firstly,the affine system is used to build a dynamic model and analyze the state constraints.The midcourse guidance problem is transformed into a continuous time optimization problem.Secondly,the problem is transformed into a discrete convex programming problem by affine control variable relaxation,Gaussian pseudospectral discretization and constraints linearization.Then,the off-line midcourse guidance trajectory is generated before midcourse guidance.It is used as the initial reference trajectory for online correction of midcourse guidance.An online guidance framework is used to eliminate the error caused by calculation of guidance instruction time.And the design of discrete points decreases with flight time to improve the solving efficiency.In addition,it is proposed that the terminal guidance capture is used innovatively space to judge the success of midcourse guidance.Numerical simulation shows the feasibility and effectiveness of the proposed method.
