检索结果-内蒙古大学图书馆

Multi-target elliptic positioning via difference of convex functions programming

SIGNAL PROCESSING 2025年 234卷

作者： Dang, Xudong Liu, Hongwei Yan, Junkun Xidian Univ Natl Key Lab Radar Signal Proc 2 South Taibai Rd Xian 710071 Shaanxi Peoples R China

Multi-target localization in a distributed multiple-input multiple-output radar is quite challenging as the correct measurement-target associations in each transmitter-receiver pair are unknown. In this paper, we address this difficult problem from a joint optimization perspective. The measurement-target association and multi- target localization are jointly formulated as an intractable mixed-integer optimization problem, which contains both discrete and continuous variables. We first develop an equivalent difference of convex functions (DC) representation for the non-convex Boolean constraint imposed on the association variables, making the problem tractable. Then, a DC algorithm is derived to efficiently solve the resulting optimization problem. Simulation results demonstrate that the proposed DC method is numerically accurate when compared to state-of-the-art methods.

关键词： Multi-target localization Data association difference of convex functions Distributed MIMO radar convex optimization

来源：评论

学校读者我要写书评

暂无评论

Optimality conditions and DC-Dinkelbach-type algorithm for vector fractional programming problems with ratios of difference of convex functions

引用

OPTIMIZATION 2025年第2期74卷 427-457页

作者： Ghazi, A. Roubi, A. Hassan First Univ Fac Sci Tech Lab MISI Settat Morocco

\In this work, necessary optimality conditions of KKT type for (weak) Pareto optimality are derived and a DC-Dinkelbach-type algorithm is proposed for vector fractional mathematical programs with ratios of difference of convex (DC) functions, and DC constraints, by reducing the latter to a system of scalar parametric problems and using DC tools. The special case of vector fractional programs with ratios of convex functions is also analysed.

关键词： Vector programming fractional programming difference of convex functions optimality conditions Dinkelbach algorithm

来源：评论

学校读者我要写书评

暂无评论

Data fitting with signomial programming compatible difference of convex functions

引用

OPTIMIZATION AND ENGINEERING 2023年第2期24卷 973-987页

作者： Karcher, Cody J. MIT Dept Aeronaut & Astronaut 77 Massachusetts Ave Cambridge MA 02139 USA

Signomial Programming (SP) has proven to be a powerful tool for engineering design optimization, striking a balance between the computational efficiency of Geometric Programming (GP) and the extensibility of more general methods for optimization. While techniques exist for fitting GP compatible models to data, no models have been proposed that take advantage of the increased modeling flexibility available in SP. Here, a new difference of Softmax Affine function is constructed by utilizing existing methods of GP compatible fitting in difference of convex (DC) functions. This new function class is fit to data in log-log space and becomes either a signomial or a set of signomials upon inverse transformation. Examples presented here include simple test cases in 1D and 2D, and a fit to the performance data of the NACA 24xx family of airfoils. In each case, RMS error is driven to less than 1%.

关键词： Data fitting Signomial programming Log-log convexity difference of convex functions

来源：评论

学校读者我要写书评

暂无评论

THE BOOSTED difference of convex functions ALGORITHM FOR NONSMOOTH functions

引用

SIAM JOURNAL ON OPTIMIZATION 2020年第1期30卷 980-1006页

作者： Aragon Artacho, Francisco J. Vuong, Phan T. Univ Alicante Dept Math Alicante Spain Univ Southampton Sch Math Sci Southampton SO17 1BJ Hants England

The boosted difference of convex functions algorithm (BDCA) was recently proposed for minimizing smooth difference of convex (DC) functions. BDCA accelerates the convergence of the classical difference of convex functions algorithm (DCA) thanks to an additional line search step. The purpose of this paper is twofold. First, we show that this scheme can be generalized and successfully applied to certain types of nonsmooth DC functions, namely, those that can be expressed as the difference of a smooth function and a possibly nonsmooth one. Second, we show that there is complete freedom in the choice of the trial step size for the line search, which is something that can further improve its performance. We prove that any limit point of the BDCA iterative sequence is a critical point of the problem under consideration and that the corresponding objective value is monotonically decreasing and convergent. The global convergence and convergence rate of the iterations are obtained under the Kurdyka-Lojasiewicz property. Applications and numerical experiments for two problems in data science are presented, demonstrating that BDCA outperforms DCA. Specifically, for the minimum sum-of-squares clustering problem, BDCA was on average 16 times faster than DCA, and for the multidimensional scaling problem, BDCA was 3 times faster than DCA.

关键词： difference of convex functions boosted difference of convex functions algorithm Kurdyka-Lojasiewicz property clustering problem multidimensional scaling problem

来源：评论

学校读者我要写书评

暂无评论

Optimality Conditions and a Method of Centers for Minimax Fractional Programs with difference of convex functions

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2020年第1期187卷 105-132页

作者： Boufi, Karima El Haffari, Mostafa Roubi, Ahmed Univ Hassan 1 Fac Sci & Tech Lab MISI Settat Morocco Univ Abdelmalek Essaadi Lab MISI Tetouan Morocco Univ Abdelmalek Essaadi Ecole Normale Super Tetouan Morocco

We are concerned in this paper with minimax fractional programs whose objective functions are the maximum of finite ratios of difference of convex functions, with constraints also described by difference of convex functions. Like Dinkelbach-type algorithms, the method of centers for generalized fractional programs fails to work for such problems, since the parametric subproblems may be nonconvex, whereas the latters need a global optimal solution for these subproblems. We first give necessary optimality conditions for these problems, by means of convex analysis tools, and then extend the last method to solve such programs. The method is based on solving a sequence of parametric convex problems. We show that every cluster point of the sequence of optimal solutions of these subproblems satisfies necessary optimality conditions of Karush-Kuhn-Tucker criticality type.

关键词： Fractional programming difference of convex functions Optimality conditions Method of centers

来源：评论

学校读者我要写书评

暂无评论

Alternating direction method of multipliers with difference of convex functions

引用

ADVANCES IN COMPUTATIONAL MATHEMATICS 2018年第3期44卷 723-744页

作者： Sun, Tao Yin, Penghang Cheng, Lizhi Jiang, Hao Natl Univ Def Technol Coll Sci Changsha 410073 Hunan Peoples R China Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA Natl Univ Def Technol Coll Sci Changsha 410073 Hunan Peoples R China Natl Univ Def Technol State Key Lab High Performance Computat Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Coll Comp Changsha 410073 Hunan Peoples R China

In this paper, we consider the minimization of a class of nonconvex composite functions with difference of convex structure under linear constraints. While this kind of problems in theory can be solved by the celebrated alternating direction method of multipliers (ADMM), a direct application of ADMM often leads to difficult nonconvex subproblems. To address this issue, we propose to convexify the subproblems through a linearization technique as done in the difference of convex functions algorithm (DCA). By assuming the Kurdyka-Aojasiewicz property, we prove that the resulting algorithm sequentially converges to a critical point. It turns out that in the applications of signal and image processing such as compressed sensing and image denoising, the proposed algorithm usually enjoys closed-form solutions of the subproblems and thus can be very efficient. We provide numerical experiments to demonstrate the effectiveness of our algorithm.

关键词： Nonconvex Alternating direction method of multipliers difference of convex functions Kurdyka-Lojasiewicz property

来源：评论

学校读者我要写书评

暂无评论

Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region

引用

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2013年第1-2期41卷 153-169页

作者： Pei, Yonggang Zhu, Detong Shanghai Normal Univ Math & Sci Coll Shanghai 200234 Peoples R China Shanghai Normal Univ Business Coll Shanghai 200234 Peoples R China

A global optimization algorithm is presented for maximizing the sum of difference of convex functions ratios problem over nonconvex feasible region. This algorithm is based on branch and bound framework. To obtain a difference of convex programming, the considered problem is first reformulated by introducing new variables as few as possible. By using subgradient and convex envelope, the fundamental problem of estimating lower bound in the branch and bound algorithm is transformed into a relaxed linear programming problem which can be solved efficiently. Furthermore, the size of the relaxed linear programming problem does not change during the algorithm search. Lastly, the convergence of the algorithm is analyzed and the numerical results are reported.

关键词： Global optimization Sum of ratios difference of convex functions Branch and bound

来源：评论

学校读者我要写书评

暂无评论

Nonconvex Optimization Problems for Maximum Hands-Off Control

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第3期70卷 1905-1912页

作者： Ikeda, Takuya Univ Kitakyushu Fac Environm Engn Fukuoka 8080135 Japan

Maximum hands-off control is the optimal solution to the L(0 )optimal control problem. While convex approximation is typically used to relax this problem, it does not necessarily result in maximum hands-off control. Therefore, this study introduces a nonconvex approximation method and a class of nonconvex optimal control problems that are always equivalent to the maximum hands-off control problem. A computation method based on difference of convex functions optimization is then derived and numerically validated.

关键词： Optimal control Optimization Vectors Cost function Approximation methods convex functions Sparse approximation State estimation Standards Optimization methods difference of convex functions nonconvex approximation optimal control sparse control

来源：评论

学校读者我要写书评

暂无评论

Solving global optimization problems using reformulations and signomial transformations

引用

COMPUTERS & CHEMICAL ENGINEERING 2018年 116卷 122-134页

作者： Lundell, A. Westerlund, T. Abo Akad Univ Math & Stat Tuomiokirkontori 1 FIN-20500 Turku Finland Abo Akad Univ Proc Design & Syst Engn Piispankatu 8 FIN-20500 Turku Finland

In this paper, a framework for reformulating nonconvex mixed-integer nonlinear programming (MINLP) problems containing twice-differentiable (C-2) functions to convex relaxed form is discussed. To provide flexibility and for utilizing more effective transformation strategies, the twice-differentiable functions can be partitioned into convex, signomial and general nonconvex functions. The latter two can then be convexified using lifting transformations in combination with approximations using piecewise linear functions (PLFs). However, since there are many degrees of freedom in how to select the set of transformations, an optimization-based method is proposed for finding an optimal set. The lifting transformations are based on single-variable power and exponential transformations for signomials. For nonconvex C-2-functions the alpha reformulation (alpha R) technique as well as more generally the method of difference of convex functions can be applied. In the alpha R, the alpha BB convex underestimator can be used. The framework is utilized in the alpha signomial global optimization (alpha SGO) algorithm to find the epsilon-global solution to a nonconvex problem by iteratively updating the approximations provided by the PLFs. The framework can also be used to directly obtain a convex relaxation of any nonconvex MINLP problem of the specified type to a determined accuracy. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Global optimization Nonconvex MINLP Reformulation techniques Signomial functions Twice-differentiable nonconvex functions Power transformations Exponential transformations alpha reformulation alpha BB convex underestimator difference of convex functions

来源：评论

学校读者我要写书评

暂无评论

Unified global optimality conditions for smooth minimization problems with mixed variables

引用

RAIRO-OPERATIONS RESEARCH 2008年第3期42卷 361-370页

作者： Jeyakumar, Vaithilingam Srisatkunarajah, Sivakolundu Huy, Nguyen Quang Univ New S Wales Dept Appl Math Sydney NSW 2052 Australia Hanoi Pedagog Univ Hanoi Vietnam

In this paper we establish necessary as well as sufficient conditions for a given feasible point to be a global minimizer of smooth minimization problems with mixed variables. These problems, for instance, cover box constrained smooth minimization problems and bivalent optimization problems. In particular, our results provide necessary global optimality conditions for difference convex minimization problems, whereas our sufficient conditions give easily veri. able conditions for global optimality of various classes of nonconvex minimization problems, including the class of difference of convex and quadratic minimization problems. We discuss numerical examples to illustrate the optimality conditions.

关键词： nonconvex optimization global optimization optimality conditions discrete constraints box constraints difference of convex functions quadratic minimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：