发布求助
文献互助 智能选刊 最新文献

Optimization Letters最新文献

筛选
英文 中文
A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization 通过具有可变质量的动态系统实现线性约束凸优化的快速原始双算法
IF 1.6 4区 数学
Optimization Letters Pub Date : 2024-01-28 DOI: 10.1007/s11590-023-02091-9
Ziyi Jiang, Dan Wang, Xinwei Liu
{"title":"A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization","authors":"Ziyi Jiang, Dan Wang, Xinwei Liu","doi":"10.1007/s11590-023-02091-9","DOIUrl":"https://doi.org/10.1007/s11590-023-02091-9","url":null,"abstract":"<p>We aim to solve the linearly constrained convex optimization problem whose objective function is the sum of a differentiable function and a non-differentiable function. We first propose an inertial continuous primal-dual dynamical system with variable mass for linearly constrained convex optimization problems with differentiable objective functions. The dynamical system is composed of a second-order differential equation with variable mass for the primal variable and a first-order differential equation for the dual variable. The fast convergence properties of the proposed dynamical system are proved by constructing a proper energy function. We then extend the results to the case where the objective function is non-differentiable, and a new accelerated primal-dual algorithm is presented. When both variable mass and time scaling satisfy certain conditions, it is proved that our new algorithm owns fast convergence rates for the objective function residual and the feasibility violation. Some preliminary numerical results on the <span>(ell _{1})</span>–<span>(ell _{2})</span> minimization problem demonstrate the validity of our algorithm.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"20 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139583223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Constrained many-to-many point matching in two dimensions 二维受限多对多点匹配
IF 1.6 4区 数学
Optimization Letters Pub Date : 2024-01-26 DOI: 10.1007/s11590-023-02089-3
L. E. Caraballo, R. A. Castro, J. M. Díaz-Báñez, M. A. Heredia, J. Urrutia, I. Ventura, F. J. Zaragoza
{"title":"Constrained many-to-many point matching in two dimensions","authors":"L. E. Caraballo, R. A. Castro, J. M. Díaz-Báñez, M. A. Heredia, J. Urrutia, I. Ventura, F. J. Zaragoza","doi":"10.1007/s11590-023-02089-3","DOIUrl":"https://doi.org/10.1007/s11590-023-02089-3","url":null,"abstract":"<p>In the minimum-weight many-to-many point matching problem, we are given a set <i>R</i> of red points and a set <i>B</i> of blue points in the plane, of total size <i>N</i>, and we want to pair up each point in <i>R</i> to one or more points in <i>B</i> and vice versa so that the sum of distances between the paired points is minimized. This problem can be solved in <span>(O(N^3))</span> time by using a reduction to the minimum-weight perfect matching problem, and thus, it is not fast enough to be used for on-line systems where a large number of tunes need to be compared. Motivated by similarity problems in music theory, in this paper we study several constrained minimum-weight many-to-many point matching problems in which the allowed pairings are given by geometric restrictions, i.e., a bichromatic pair can be matched if and only if the corresponding points satisfy a specific condition of closeness. We provide algorithms to solve these constrained versions in <i>O</i>(<i>N</i>) time when the sets <i>R</i> and <i>B</i> are given ordered by abscissa.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"136 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139583286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Duality in the problems of optimal control described by Darboux-type differential inclusions 达尔布型微分结论描述的最优控制问题中的对偶性
IF 1.6 4区 数学
Optimization Letters Pub Date : 2024-01-25 DOI: 10.1007/s11590-023-02088-4
Sevilay Demir Sağlam
{"title":"Duality in the problems of optimal control described by Darboux-type differential inclusions","authors":"Sevilay Demir Sağlam","doi":"10.1007/s11590-023-02088-4","DOIUrl":"https://doi.org/10.1007/s11590-023-02088-4","url":null,"abstract":"<p>This paper is devoted to the optimization of the Mayer problem with hyperbolic differential inclusions of the Darboux type and duality. We use the discrete approximation method to get sufficient conditions of optimality for the convex problem given by Darboux differential inclusions and the polyhedral problem for a hyperbolic differential inclusion with state constraint. We formulate the adjoint inclusions in the Euler-Lagrange inclusion and Hamiltonian forms. Then, we construct the dual problem to optimal control problem given by Darboux differential inclusions with state constraint and prove so-called duality results. Moreover, we show that each pair of primal and dual problem solutions satisfy duality relations and that the optimal values in the primal convex and dual concave problems are equal. Finally, we establish the dual problem to the polyhedral Darboux problem and provide an example to demonstrate the main constructions of our approach.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"138 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139583678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Differentially private k-center problems 差分私有 K 中心问题
IF 1.6 4区 数学
Optimization Letters Pub Date : 2024-01-25 DOI: 10.1007/s11590-023-02090-w
Fan Yuan, Dachuan Xu, Donglei Du, Min Li
{"title":"Differentially private k-center problems","authors":"Fan Yuan, Dachuan Xu, Donglei Du, Min Li","doi":"10.1007/s11590-023-02090-w","DOIUrl":"https://doi.org/10.1007/s11590-023-02090-w","url":null,"abstract":"<p>Data privacy has become one of the most important concerns in the big data era. Because of its broad applications in machine learning and data analysis, many algorithms and theoretical results have been established for privacy clustering problems, such as <i>k</i>-means and <i>k</i>-median problems with privacy protection. However, there is little work on privacy protection in <i>k</i>-center clustering. Our research focuses on the <i>k</i>-center problem, its distributed variant, and the distributed <i>k</i>-center problem under differential privacy constraints. These problems model the concept of safeguarding the privacy of individual input elements, with the integration of differential privacy aimed at ensuring the security of individual information during data processing and analysis. We propose three approximation algorithms for these problems, respectively, and achieve a constant factor approximation ratio.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"5 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139583288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Representation of positive polynomials on a generalized strip and its application to polynomial optimization 正多项式在广义条带上的表示及其在多项式优化中的应用
IF 1.6 4区 数学
Optimization Letters Pub Date : 2024-01-11 DOI: 10.1007/s11590-023-02087-5
{"title":"Representation of positive polynomials on a generalized strip and its application to polynomial optimization","authors":"","doi":"10.1007/s11590-023-02087-5","DOIUrl":"https://doi.org/10.1007/s11590-023-02087-5","url":null,"abstract":"<h3>Abstract</h3> <p>We study the representation of nonnegative polynomials in two variables on a certain class of unbounded closed basic semi-algebraic sets (which are called generalized strips). This class includes the strip <span> <span>([a,b] times {mathbb {R}})</span> </span> which was studied by Marshall in (Proc Am Math Soc 138(5):1559–1567, 2010). A denominator-free Nichtnegativstellensätz holds true on a generalized strip when the width of the generalized strip is constant and fails otherwise. As a consequence, we confirm that the standard hierarchy of semidefinite programming relaxations defined for the compact case can indeed be adapted to the generalized strip with constant width. For polynomial optimization problems on the generalized strip with non-constant width, we follow Ha-Pham’s work: Solving polynomial optimization problems via the truncated tangency variety and sums of squares. </p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"84 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139458753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Determining optimal channel partition for 2:4 fine grained structured sparsity 确定 2:4 细粒度结构稀疏性的最佳信道分区
IF 1.6 4区 数学
Optimization Letters Pub Date : 2024-01-11 DOI: 10.1007/s11590-023-02084-8
{"title":"Determining optimal channel partition for 2:4 fine grained structured sparsity","authors":"","doi":"10.1007/s11590-023-02084-8","DOIUrl":"https://doi.org/10.1007/s11590-023-02084-8","url":null,"abstract":"<h3>Abstract</h3> <p>Deep Neural Networks (DNNs) have demonstrated tremendous success in many applications, but incur high computational burden on the inference side. The 2:4 sparsity pruning method has recently been developed to effectively compress and accelerate DNNs with little to no loss in performance. The method comprises a training phase followed by a pruning step where 2 out of 4 consecutive weights are eliminated to obtain a pruned matrix, which is then retrained to fine-tune the remaining weights. The accuracy of the resultant sparse network is maximized by permuting the matrix along the channel dimension in a way that maximizes the total magnitude of weights preserved during pruning. While earlier works have proposed heuristic methods to generate good permutations, we formalized the problem as a discrete optimization problem. In this paper, we propose four different mathematical programs to determine the optimal permutations and compare their performance for small-sized instances using a standard solver. Further, we develop a complementary column generation scheme to solve DNNs with realistic number of channels. </p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"57 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139465305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A reduced Jacobian method with full convergence property 具有完全收敛特性的减雅各布方法
IF 1.6 4区 数学
Optimization Letters Pub Date : 2024-01-07 DOI: 10.1007/s11590-023-02083-9
M. El Maghri, Y. Elboulqe
{"title":"A reduced Jacobian method with full convergence property","authors":"M. El Maghri, Y. Elboulqe","doi":"10.1007/s11590-023-02083-9","DOIUrl":"https://doi.org/10.1007/s11590-023-02083-9","url":null,"abstract":"<p>In this paper, we propose a variant of the reduced Jacobian method (RJM) introduced by El Maghri and Elboulqe (J Optim Theory Appl 179:917–943, 2018) for multicriteria optimization under linear constraints. Motivation is that, contrarily to RJM which has only global convergence to Pareto KKT-stationary points in the classical sense of accumulation points, this new variant possesses the full convergence property in the sense that the entire sequence converges whenever the objectives are quasiconvex. Simulations are reported showing the performance of this variant compared to RJM and the nondominated sorting genetic algorithm (NSGA-II).</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"7 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139396430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection 单机调度，最大限度降低工作拒绝的迟到/迟到成本
IF 1.6 4区 数学
Optimization Letters Pub Date : 2024-01-05 DOI: 10.1007/s11590-023-02086-6
Matan Atsmony, Gur Mosheiov
{"title":"Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection","authors":"Matan Atsmony, Gur Mosheiov","doi":"10.1007/s11590-023-02086-6","DOIUrl":"https://doi.org/10.1007/s11590-023-02086-6","url":null,"abstract":"<p>We study a single machine due-date assignment problem with a common due-date. The objective function is minimizing the maximum earliness/tardiness cost. The scheduler may process only a subset of the jobs and the remaining jobs are rejected. Job-dependent rejection-costs are considered, and an upper bound on the total permitted rejection cost is assumed. The problem is proved to be NP-Hard. We present and test a pseudo-polynomial dynamic programming solution algorithm. An extension to the setting containing additional due-date cost component is also discussed. An efficient implementation of the algorithm is introduced, and medium size problems (containing hundreds of jobs) are shown to be solved in very reasonable running time. In addition, an intuitive heuristic is introduced, tested numerically, and is shown to produce very small optimality gaps.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"59 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139375462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Random-reshuffled SARAH does not need full gradient computations 随机消隐 SARAH 不需要完整梯度计算
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-12-11 DOI: 10.1007/s11590-023-02081-x
Aleksandr Beznosikov, Martin Takáč
{"title":"Random-reshuffled SARAH does not need full gradient computations","authors":"Aleksandr Beznosikov, Martin Takáč","doi":"10.1007/s11590-023-02081-x","DOIUrl":"https://doi.org/10.1007/s11590-023-02081-x","url":null,"abstract":"<p>The StochAstic Recursive grAdient algoritHm (SARAH) algorithm is a variance reduced variant of the Stochastic Gradient Descent algorithm that needs a gradient of the objective function from time to time. In this paper, we remove the necessity of a full gradient computation. This is achieved by using a randomized reshuffling strategy and aggregating stochastic gradients obtained in each epoch. The aggregated stochastic gradients serve as an estimate of a full gradient in the SARAH algorithm. We provide a theoretical analysis of the proposed approach and conclude the paper with numerical experiments that demonstrate the efficiency of this approach.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"53 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138565993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential 通过伪差分论稳健优化问题的约束条件和最优性条件
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-12-11 DOI: 10.1007/s11590-023-02078-6
Mansoureh Alavi Hejazi, Nooshin Movahedian
{"title":"On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential","authors":"Mansoureh Alavi Hejazi, Nooshin Movahedian","doi":"10.1007/s11590-023-02078-6","DOIUrl":"https://doi.org/10.1007/s11590-023-02078-6","url":null,"abstract":"<p>In this paper, a nonsmooth nonconvex robust optimization problem is considered. Using the idea of pseudo-differential, nonsmooth versions of the Robinson, Mangasarian–Fromovitz and Abadie constraint qualifications are introduced and their relations with the existence of a local error bound are investigated. Based on the pseudo-differential notion, new necessary optimality conditions are derived under the Abadie constraint qualification. Moreover, an example is provided to clarify the results.</p>","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"169 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138565994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信