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

Journal of Optimization Theory and Applications最新文献

筛选
英文 中文
On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints.
IF 1.6 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2025-01-01 Epub Date: 2025-01-23 DOI: 10.1007/s10957-024-02593-1
Immanuel Bomze, Bo Peng, Yuzhou Qiu, E Alper Yıldırım
{"title":"On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints.","authors":"Immanuel Bomze, Bo Peng, Yuzhou Qiu, E Alper Yıldırım","doi":"10.1007/s10957-024-02593-1","DOIUrl":"10.1007/s10957-024-02593-1","url":null,"abstract":"<p><p>Standard quadratic optimization problems (StQPs) provide a versatile modelling tool in various applications. In this paper, we consider StQPs with a hard sparsity constraint, referred to as sparse StQPs. We focus on various tractable convex relaxations of sparse StQPs arising from a mixed-binary quadratic formulation, namely, the linear optimization relaxation given by the reformulation-linearization technique, the Shor relaxation, and the relaxation resulting from their combination. We establish several structural properties of these relaxations in relation to the corresponding relaxations of StQPs without any sparsity constraints, and pay particular attention to the rank-one feasible solutions retained by these relaxations. We then utilize these relations to establish several results about the quality of the lower bounds arising from different relaxations. We also present several conditions that ensure the exactness of each relaxation.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"204 3","pages":"38"},"PeriodicalIF":1.6,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11757943/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143048194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Effects of patient education on the oral behavior of patients with temporomandibular degenerative joint disease: a prospective case series study. 患者教育对颞下颌关节退行性疾病患者口腔行为的影响：前瞻性病例系列研究。
IF 1.6 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2025-01-01 Epub Date: 2022-06-09 DOI: 10.1080/08869634.2022.2085410
Shasha Liu, Bin Cai, Shuai Fan, Yuxin Zhang, Shenji Lu, Lili Xu
{"title":"Effects of patient education on the oral behavior of patients with temporomandibular degenerative joint disease: a prospective case series study.","authors":"Shasha Liu, Bin Cai, Shuai Fan, Yuxin Zhang, Shenji Lu, Lili Xu","doi":"10.1080/08869634.2022.2085410","DOIUrl":"10.1080/08869634.2022.2085410","url":null,"abstract":"<p><strong>Objective: </strong>To evaluate the effects of patient education and related factors on oral behaviors (OBs) in patients with temporomandibular joint degenerative diseases.</p><p><strong>Methods: </strong>Sixty-three patients were included. Temporomandibular joint specialists conducted clinical examinations, provided patient education, and administered the Oral Behavior Checklist (OBC) questionnaire at baseline. Patients were followed up at 6 months.</p><p><strong>Results: </strong>Eight OBs showed a high incidence among patients. At the 6-month follow-up, the incidence of 6 of the OBs decreased, all of which were high incidence OBs. The frequency of 9 OBs decreased, of which 8 were high incidence OBs. The average OBC score decreased from 22.97 ± 9.30 to 17.90 ± 9.28. Age, education level, and original OBC score had a significant effect on OB improvement.</p><p><strong>Conclusion: </strong>Patient education and the corresponding treatment are conducive to OB improvement. The related factors affecting the improvement in patients' OBs were age, education level, and OB severity.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"158 1","pages":"100-109"},"PeriodicalIF":1.6,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74072873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Simultaneous Diagonalization Under Weak Regularity and a Characterization 弱规则性下的同时对角线化及其特征
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-09-17 DOI: 10.1007/s10957-024-02526-y
Fabián Flores-Bazán, Felipe Opazo
{"title":"Simultaneous Diagonalization Under Weak Regularity and a Characterization","authors":"Fabián Flores-Bazán, Felipe Opazo","doi":"10.1007/s10957-024-02526-y","DOIUrl":"https://doi.org/10.1007/s10957-024-02526-y","url":null,"abstract":"<p>We analyze the fulfillment of the simultaneous diagonalization (SD via congruence) property for any two real matrices, and develop sufficient conditions expressed in different way to those appeared in the last few years. These conditions are established under a different perspective, and in any case, they supplement and clarify other similar results published elsewhere. Following our point of view reflected in a previous work, we offer some necessary and sufficient conditions, different in nature to those in Jiang and Li (SIAM J Optim 26:1649–1668, 2016), for SD: roughly speaking our approach is more geometric and needs to compute images and kernels of matrices; whereas that in Jiang and Li (SIAM J Optim 26:1649–1668, 2016) requires to compute determinant and canonical forms. The bidimensional situation is particularly analyzed, providing new more precise characterizations than those in higher dimension and joint those given earlier by the authors. In addition, we also establish the connection of our characterization of SD with that provided in Jiang and Li (SIAM J Optim 26:1649–1668, 2016).</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"41 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Seeking Consensus on Subspaces in Federated Principal Component Analysis 在联合主成分分析中寻求子空间共识
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-09-14 DOI: 10.1007/s10957-024-02523-1
Lei Wang, Xin Liu, Yin Zhang
{"title":"Seeking Consensus on Subspaces in Federated Principal Component Analysis","authors":"Lei Wang, Xin Liu, Yin Zhang","doi":"10.1007/s10957-024-02523-1","DOIUrl":"https://doi.org/10.1007/s10957-024-02523-1","url":null,"abstract":"<p>In this paper, we develop an algorithm for federated principal component analysis (PCA) with emphases on both communication efficiency and data privacy. Generally speaking, federated PCA algorithms based on direct adaptations of classic iterative methods, such as simultaneous subspace iterations, are unable to preserve data privacy, while algorithms based on variable-splitting and consensus-seeking, such as alternating direction methods of multipliers (ADMM), lack in communication-efficiency. In this work, we propose a novel consensus-seeking formulation by equalizing subspaces spanned by splitting variables instead of equalizing variables themselves, thus greatly relaxing feasibility restrictions and allowing much faster convergence. Then we develop an ADMM-like algorithm with several special features to make it practically efficient, including a low-rank multiplier formula and techniques for treating subproblems. We establish that the proposed algorithm can better protect data privacy than classic methods adapted to the federated PCA setting. We derive convergence results, including a worst-case complexity estimate, for the proposed ADMM-like algorithm in the presence of the nonlinear equality constraints. Extensive empirical results are presented to show that the new algorithm, while enhancing data privacy, requires far fewer rounds of communication than existing peer algorithms for federated PCA.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"18 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142260878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Multilevel Method for Self-Concordant Minimization 自洽最小化的多层次方法
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-09-14 DOI: 10.1007/s10957-024-02509-z
Nick Tsipinakis, Panos Parpas
{"title":"A Multilevel Method for Self-Concordant Minimization","authors":"Nick Tsipinakis, Panos Parpas","doi":"10.1007/s10957-024-02509-z","DOIUrl":"https://doi.org/10.1007/s10957-024-02509-z","url":null,"abstract":"<p>The analysis of second-order optimization methods based either on sub-sampling, randomization or sketching has two serious shortcomings compared to the conventional Newton method. The first shortcoming is that the analysis of the iterates has only been shown to be scale-invariant only under specific assumptions on the problem structure. The second shortfall is that the fast convergence rates of second-order methods have only been established by making assumptions regarding the input data. In this paper, we propose a randomized Newton method for self-concordant functions to address both shortfalls. We propose a Self-concordant Iterative-minimization-Galerkin-based Multilevel Algorithm (SIGMA) and establish its super-linear convergence rate using the theory of self-concordant functions. Our analysis is based on the connections between multigrid optimization methods, and the role of coarse-grained or reduced-order models in the computation of search directions. We take advantage of the insights from the analysis to significantly improve the performance of second-order methods in machine learning applications. We report encouraging initial experiments that suggest SIGMA outperforms other state-of-the-art sub-sampled/sketched Newton methods for both medium and large-scale problems.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"87 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142261102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces 希尔伯特空间非光滑多目标优化的后裔方法
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-09-12 DOI: 10.1007/s10957-024-02520-4
Konstantin Sonntag, Bennet Gebken, Georg Müller, Sebastian Peitz, Stefan Volkwein
{"title":"A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces","authors":"Konstantin Sonntag, Bennet Gebken, Georg Müller, Sebastian Peitz, Stefan Volkwein","doi":"10.1007/s10957-024-02520-4","DOIUrl":"https://doi.org/10.1007/s10957-024-02520-4","url":null,"abstract":"<p>The efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from Gebken and Peitz (J Optim Theory Appl 188:696–723, 2021) is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points, where in each iteration, an approximation of the Clarke subdifferential is computed in an efficient manner and then used to compute a common descent direction for all objective functions. To prove convergence, we present some new optimality results for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these, we can show that every accumulation point of the sequence generated by our algorithm is Pareto critical under common assumptions. Computational efficiency for finding Pareto critical points is numerically demonstrated for multiobjective optimal control of an obstacle problem.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"46 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Expected Residual Minimization Formulation for Stochastic Absolute Value Equations 随机绝对值方程的期望残差最小化公式
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-09-12 DOI: 10.1007/s10957-024-02527-x
Jingyong Tang, Jinchuan Zhou
{"title":"Expected Residual Minimization Formulation for Stochastic Absolute Value Equations","authors":"Jingyong Tang, Jinchuan Zhou","doi":"10.1007/s10957-024-02527-x","DOIUrl":"https://doi.org/10.1007/s10957-024-02527-x","url":null,"abstract":"<p>In this paper we investigate a class of stochastic absolute value equations (SAVE). After establishing the relationship between the stochastic linear complementarity problem and SAVE, we study the expected residual minimization (ERM) formulation for SAVE and its Monte Carlo sample average approximation. In particular, we show that the ERM problem and its sample average approximation have optimal solutions under the condition of <span>(R_0)</span> pair, and the optimal value of the sample average approximation has uniform exponential convergence. Furthermore, we prove that the solutions to the ERM problem are robust for SAVE. For a class of SAVE problems, we use its special structure to construct a smooth residual and further study the convergence of the stationary points. Finally, a smoothing gradient method is proposed by simultaneously considering sample sampling and smooth techniques for solving SAVE. Numerical experiments exhibit the effectiveness of the method.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"7 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Weak Maximum Principle for Discrete Optimal Control Problems with Mixed Constraints 具有混合约束条件的离散最优控制问题的弱最大原则
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-09-10 DOI: 10.1007/s10957-024-02524-0
Roberto Andreani, John Frank Matos Ascona, Valeriano Antunes de Oliveira
{"title":"A Weak Maximum Principle for Discrete Optimal Control Problems with Mixed Constraints","authors":"Roberto Andreani, John Frank Matos Ascona, Valeriano Antunes de Oliveira","doi":"10.1007/s10957-024-02524-0","DOIUrl":"https://doi.org/10.1007/s10957-024-02524-0","url":null,"abstract":"<p>In this study, first-order necessary optimality conditions, in the form of a weak maximum principle, are derived for discrete optimal control problems with mixed equality and inequality constraints. Such conditions are achieved by using the Dubovitskii–Milyutin formalism approach. Nondegenerate conditions are obtained under the constant rank of the subspace component (CRSC) constraint qualification, which is an important generalization of both the Mangasarian–Fromovitz and constant rank constraint qualifications. Beyond its theoretical significance, CRSC has practical importance because it is closely related to the formulation of optimization algorithms. In addition, an instance of a discrete optimal control problem is presented in which CRSC holds while other stronger regularity conditions do not.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"25 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Gradient Descent Provably Escapes Saddle Points in the Training of Shallow ReLU Networks 在浅层 ReLU 网络的训练中梯度下降可避开鞍点
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-09-10 DOI: 10.1007/s10957-024-02513-3
Patrick Cheridito, Arnulf Jentzen, Florian Rossmannek
{"title":"Gradient Descent Provably Escapes Saddle Points in the Training of Shallow ReLU Networks","authors":"Patrick Cheridito, Arnulf Jentzen, Florian Rossmannek","doi":"10.1007/s10957-024-02513-3","DOIUrl":"https://doi.org/10.1007/s10957-024-02513-3","url":null,"abstract":"<p>Dynamical systems theory has recently been applied in optimization to prove that gradient descent algorithms bypass so-called strict saddle points of the loss function. However, in many modern machine learning applications, the required regularity conditions are not satisfied. In this paper, we prove a variant of the relevant dynamical systems result, a center-stable manifold theorem, in which we relax some of the regularity requirements. We explore its relevance for various machine learning tasks, with a particular focus on shallow rectified linear unit (ReLU) and leaky ReLU networks with scalar input. Building on a detailed examination of critical points of the square integral loss function for shallow ReLU and leaky ReLU networks relative to an affine target function, we show that gradient descent circumvents most saddle points. Furthermore, we prove convergence to global minima under favourable initialization conditions, quantified by an explicit threshold on the limiting loss.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"58 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimized Fractional-Order Type-2 Fuzzy PID Attitude Controller for Fixed-Wing Aircraft 用于固定翼飞机的优化分数阶 2 型模糊 PID 姿态控制器
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-09-09 DOI: 10.1007/s10957-024-02512-4
Wenfan Wang, Jun Zhang, Ruili Jiao
{"title":"Optimized Fractional-Order Type-2 Fuzzy PID Attitude Controller for Fixed-Wing Aircraft","authors":"Wenfan Wang, Jun Zhang, Ruili Jiao","doi":"10.1007/s10957-024-02512-4","DOIUrl":"https://doi.org/10.1007/s10957-024-02512-4","url":null,"abstract":"<p>This paper addresses the design of attitude controller for a fixed-wing unmanned aerial vehicle. To address the complexity of the coupled nonlinear model of a fixed-wing aircraft, this paper introduces a Fractional-Order Type-2 Fuzzy PID (FOTFPID) controller. The adoption of interval valued type-2 fuzzy sets, as an extension of conventional fuzzy sets, has endowed decision makers with the ability to assign membership and non-membership values as intervals. This enhanced capability facilitates more resilient decision-making processes. The Bat optimization algorithm is also employed to fine-tune the membership functions, scaling factors, and primary controller parameters, aiming to minimize the integrated absolute error index. Numerical simulations are conducted to demonstrate effectiveness of the proposed controllers in comparison to classical PID controllers, while subjecting the aircraft system to various disturbance conditions.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"32 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142186659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"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学术官方微信