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

Journal of Optimization Theory and Applications最新文献

筛选
英文 中文
On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound 论在简化分支与边界中处理简化可行区域边界上的最小值
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-22 DOI: 10.1007/s10957-024-02480-9
Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado, Frédéric Messine
{"title":"On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound","authors":"Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado, Frédéric Messine","doi":"10.1007/s10957-024-02480-9","DOIUrl":"https://doi.org/10.1007/s10957-024-02480-9","url":null,"abstract":"<p>We consider a simplicial branch and bound Global Optimization algorithm, where the search region is a simplex. Apart from using longest edge bisection, a simplicial partition set can be reduced due to monotonicity of the objective function. If there is a direction in which the objective function is monotone over a simplex, depending on whether the facets that may contain the minimum are at the border of the search region, we can remove the simplex completely, or reduce it to some of its border facets. Our research question deals with finding monotone directions and labeling facets of a simplex as border after longest edge bisection and reduction due to monotonicity. Experimental results are shown over a set of global optimization problems where the feasible set is defined as a simplex, and a global minimum point is located at a face of the simplicial feasible area.\u0000</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"1 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737299","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
The Stability of Robustness for Conic Linear Programs with Uncertain Data 具有不确定数据的圆锥线性规划的稳健性
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-21 DOI: 10.1007/s10957-024-02492-5
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li
{"title":"The Stability of Robustness for Conic Linear Programs with Uncertain Data","authors":"Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li","doi":"10.1007/s10957-024-02492-5","DOIUrl":"https://doi.org/10.1007/s10957-024-02492-5","url":null,"abstract":"<p>The robust counterpart of a given conic linear program with uncertain data in the constraints is defined as the robust conic linear program that arises from replacing the nominal feasible set by the robust feasible set of points that remain feasible for any possible perturbation of the data within an uncertainty set. Any minor changes in the size of the uncertainty set can result in significant changes, for instance, in the robust feasible set, robust optimal value and the robust optimal set. The concept of quantifying the extent of these deviations is referred to as the <i>stability of robustness</i>. This paper establishes conditions for the stability of robustness under which minor changes in the size of the uncertainty sets lead to only minor changes in the robust feasible set of a given linear program with cone constraints and ball uncertainty sets.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"36 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737297","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
An Augmented Lagrangian Method for State Constrained Linear Parabolic Optimal Control Problems 状态受限线性抛物线优化控制问题的增量拉格朗日法
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-19 DOI: 10.1007/s10957-024-02494-3
Hailing Wang, Changjun Yu, Yongcun Song
{"title":"An Augmented Lagrangian Method for State Constrained Linear Parabolic Optimal Control Problems","authors":"Hailing Wang, Changjun Yu, Yongcun Song","doi":"10.1007/s10957-024-02494-3","DOIUrl":"https://doi.org/10.1007/s10957-024-02494-3","url":null,"abstract":"<p>In this paper, we consider a class of state constrained linear parabolic optimal control problems. Instead of treating the inequality state constraints directly, we reformulate the problem as an equality-constrained optimization problem, and then apply the augmented Lagrangian method (ALM) to solve it. We prove the convergence of the ALM without any existence or regularity assumptions on the corresponding Lagrange multipliers, which is an essential complement to the classical theoretical results for the ALM because restrictive regularity assumptions are usually required to guarantee the existence of the Lagrange multipliers associated with the state constraints. In addition, under an appropriate choice of penalty parameter sequence, we can obtain a super-linear non-ergodic convergence rate for the ALM. Computationally, we apply a semi-smooth Newton (SSN) method to solve the ALM subproblems and design an efficient preconditioned conjugate gradient method for solving the Newton systems. Some numerical results are given to illustrate the effectiveness and efficiency of our algorithm.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"64 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141737298","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 Globally Convergent Inertial First-Order Optimization Method for Multidimensional Scaling 用于多维扩展的全局收敛惯性一阶优化方法
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-14 DOI: 10.1007/s10957-024-02486-3
Noga Ram, Shoham Sabach
{"title":"A Globally Convergent Inertial First-Order Optimization Method for Multidimensional Scaling","authors":"Noga Ram, Shoham Sabach","doi":"10.1007/s10957-024-02486-3","DOIUrl":"https://doi.org/10.1007/s10957-024-02486-3","url":null,"abstract":"<p>Multidimensional scaling (MDS) is a popular tool for dimensionality reduction and data visualization. Given distances between data points and a target low-dimension, the MDS problem seeks to find a configuration of these points in the low-dimensional space, such that the inter-point distances are preserved as well as possible. We focus on the most common approach to formulate the MDS problem, known as <i>stress</i> minimization, which results in a challenging non-smooth and non-convex optimization problem. In this paper, we propose an inertial version of the well-known SMACOF Algorithm, which we call AI-SMACOF. This algorithm is proven to be globally convergent, and to the best of our knowledge this is the first result of this kind for algorithms aiming at solving the stress MDS minimization. In addition to the theoretical findings, numerical experiments provide another evidence for the superiority of the proposed algorithm.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"26 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141609533","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
Conic Optimization and Interior Point Methods: Theory, Computations, and Applications 圆锥优化和内点法：理论、计算与应用
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-11 DOI: 10.1007/s10957-024-02483-6
Tibor Illés, Florian Jarre, Etienne de Klerk, Goran Lesaja
{"title":"Conic Optimization and Interior Point Methods: Theory, Computations, and Applications","authors":"Tibor Illés, Florian Jarre, Etienne de Klerk, Goran Lesaja","doi":"10.1007/s10957-024-02483-6","DOIUrl":"https://doi.org/10.1007/s10957-024-02483-6","url":null,"abstract":"","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"152 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141586747","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
An Inertial Iterative Regularization Method for a Class of Variational Inequalities 一类变分不等式的惯性迭代正则化方法
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-09 DOI: 10.1007/s10957-024-02443-0
Nguyen Buong, Nguyen Duong Nguyen, Nguyen Thi Quynh Anh
{"title":"An Inertial Iterative Regularization Method for a Class of Variational Inequalities","authors":"Nguyen Buong, Nguyen Duong Nguyen, Nguyen Thi Quynh Anh","doi":"10.1007/s10957-024-02443-0","DOIUrl":"https://doi.org/10.1007/s10957-024-02443-0","url":null,"abstract":"<p>In this paper, we study a class of variational inequality problems the constraint set of which is the set of common solutions of a finite family of operator equations, involving hemi-continuous accretive operators on a reflexive and strictly convex Banach space with a Gâteaux differentiable norm. We present a sequential regularization method of Lavrentiev type and an iterative regularization one in combination with an inertial term to speed up convergence. The strong convergence of the methods is proved without the co-coercivity imposed on any operator in the family. An application of our results to solving the split common fixed point problem with pseudocontractive and nonexpansive operators is given with computational experiments for illustration.\u0000</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"56 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141572970","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
Boundary Stabilization for a Heat-Kelvin-Voigt Unstable Interaction Model, with Control and Partial Observation Localized at the Interface Only 热-开尔文-伏依格特不稳定相互作用模型的边界稳定，仅在界面局部进行控制和部分观测
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-09 DOI: 10.1007/s10957-024-02477-4
Irena Lasiecka, Rasika Mahawattege, Roberto Triggiani
{"title":"Boundary Stabilization for a Heat-Kelvin-Voigt Unstable Interaction Model, with Control and Partial Observation Localized at the Interface Only","authors":"Irena Lasiecka, Rasika Mahawattege, Roberto Triggiani","doi":"10.1007/s10957-024-02477-4","DOIUrl":"https://doi.org/10.1007/s10957-024-02477-4","url":null,"abstract":"<p>A prototype model for a Fluid–Structure interaction is considered. We aim to stabilize [enhance stability of] the model by having access only to a portion of the state. Toward this goal we shall construct a compensator-based Luenberger design, with the following two goals: (1) reconstruct the original system asymptotically by tracking partial information about the full state, (2) stabilize the original unstable system by feeding an admissible control based on a system which is obtained from the compensator. The ultimate result is boundary control/stabilization of partially observed and originally unstable fluid–structure interaction with restricted information on the current state and without any knowledge of the initial condition. This prevents applicability of known methods in either open-loop or closed loop stabilization/control.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"10 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141573177","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
Computing the Minimum-Time Interception of a Moving Target 计算拦截移动目标的最短时间
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-06 DOI: 10.1007/s10957-024-02487-2
Maksim Buzikov
{"title":"Computing the Minimum-Time Interception of a Moving Target","authors":"Maksim Buzikov","doi":"10.1007/s10957-024-02487-2","DOIUrl":"https://doi.org/10.1007/s10957-024-02487-2","url":null,"abstract":"<p>In this study, we propose an algorithmic framework for solving a class of optimal control problems. This class is associated with the minimum-time interception of moving target problems, where a plant with a given state equation must approach a moving target whose trajectory is known a priori. Our framework employs an analytical description of the distance from an arbitrary point to the reachable set of the plant. The proposed algorithm is always convergent and cannot be improved without losing the guarantee of its convergence to the correct solution for arbitrary Lipschitz continuous trajectories of the moving target. In practice, it is difficult to obtain an analytical description of the distance to the reachable set for the sophisticated state equation of the plant. Nevertheless, it was shown that the distance can be obtained for some widely used models, such as the Dubins car, in an explicit form. Finally, we illustrate the generality and effectiveness of the proposed framework for simple motions and the Dubins model.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"40 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141572971","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 New Bayesian Approach to Global Optimization on Parametrized Surfaces in $$mathbb {R}^{3}$$ 在 $$mathbb {R}^{3}$ 中对参数化曲面进行全局优化的新贝叶斯方法
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-06 DOI: 10.1007/s10957-024-02473-8
Anis Fradi, Chafik Samir, Ines Adouani
{"title":"A New Bayesian Approach to Global Optimization on Parametrized Surfaces in $$mathbb {R}^{3}$$","authors":"Anis Fradi, Chafik Samir, Ines Adouani","doi":"10.1007/s10957-024-02473-8","DOIUrl":"https://doi.org/10.1007/s10957-024-02473-8","url":null,"abstract":"<p>This work introduces a new Riemannian optimization method for registering open parameterized surfaces with a constrained global optimization approach. The proposed formulation leads to a rigorous theoretic foundation and guarantees the existence and the uniqueness of a global solution. We also propose a new Bayesian clustering approach where local distributions of surfaces are modeled with spherical Gaussian processes. The maximization of the posterior density is performed with Hamiltonian dynamics which provide a natural and computationally efficient spherical Hamiltonian Monte Carlo sampling. Experimental results demonstrate the efficiency of the proposed method.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"35 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141572972","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
Convex Predictor–Nonconvex Corrector Optimization Strategy with Application to Signal Decomposition 凸预测器-非凸校正器优化策略在信号分解中的应用
IF 1.9 3区 数学
Journal of Optimization Theory and Applications Pub Date : 2024-07-04 DOI: 10.1007/s10957-024-02479-2
Laura Girometti, Martin Huska, Alessandro Lanza, Serena Morigi
{"title":"Convex Predictor–Nonconvex Corrector Optimization Strategy with Application to Signal Decomposition","authors":"Laura Girometti, Martin Huska, Alessandro Lanza, Serena Morigi","doi":"10.1007/s10957-024-02479-2","DOIUrl":"https://doi.org/10.1007/s10957-024-02479-2","url":null,"abstract":"<p>Many tasks in real life scenarios can be naturally formulated as nonconvex optimization problems. Unfortunately, to date, the iterative numerical methods to find even only the local minima of these nonconvex cost functions are extremely slow and strongly affected by the initialization chosen. We devise a predictor–corrector strategy that efficiently computes locally optimal solutions to these problems. An initialization-free convex minimization allows to <i>predict</i> a global good preliminary candidate, which is then <i>corrected</i> by solving a parameter-free nonconvex minimization. A simple algorithm, such as alternating direction method of multipliers works surprisingly well in producing good solutions. This strategy is applied to the challenging problem of decomposing a 1D signal into semantically distinct components mathematically identified by smooth, piecewise-constant, oscillatory structured and unstructured (noise) parts.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"12 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141549444","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学术文献互助群
群 号：604180095
Book学术官方微信