Pub Date : 2024-05-14DOI: 10.1007/s10957-024-02439-w
Yevgeniia Yevgenieva, Alexander Zuyev, Peter Benner, Andreas Seidel-Morgenstern
We study a class of nonlinear hyperbolic partial differential equations with boundary control. This class describes chemical reactions of the type “(A rightarrow ) product” carried out in a plug flow reactor (PFR) in the presence of an inert component. An isoperimetric optimal control problem with periodic boundary conditions and input constraints is formulated for the considered mathematical model in order to maximize the mean amount of product over the period. For the single-input system, the optimality of a bang-bang control strategy is proved in the class of bounded measurable inputs. The case of controlled flow rate input is also analyzed by exploiting the method of characteristics. A case study is performed to illustrate the performance of the reaction model under different control strategies.
{"title":"Periodic Optimal Control of a Plug Flow Reactor Model with an Isoperimetric Constraint","authors":"Yevgeniia Yevgenieva, Alexander Zuyev, Peter Benner, Andreas Seidel-Morgenstern","doi":"10.1007/s10957-024-02439-w","DOIUrl":"https://doi.org/10.1007/s10957-024-02439-w","url":null,"abstract":"<p>We study a class of nonlinear hyperbolic partial differential equations with boundary control. This class describes chemical reactions of the type “<span>(A rightarrow )</span> product” carried out in a plug flow reactor (PFR) in the presence of an inert component. An isoperimetric optimal control problem with periodic boundary conditions and input constraints is formulated for the considered mathematical model in order to maximize the mean amount of product over the period. For the single-input system, the optimality of a bang-bang control strategy is proved in the class of bounded measurable inputs. The case of controlled flow rate input is also analyzed by exploiting the method of characteristics. A case study is performed to illustrate the performance of the reaction model under different control strategies.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"64 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140925727","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}
Pub Date : 2024-05-13DOI: 10.1007/s10957-024-02436-z
Eric Luxenberg, Philipp Schiele, Stephen Boyd
The minimum (worst case) value of a long-only portfolio of bonds, over a convex set of yield curves and spreads, can be estimated by its sensitivities to the points on the yield curve. We show that sensitivity based estimates are conservative, i.e., underestimate the worst case value, and that the exact worst case value can be found by solving a tractable convex optimization problem. We then show how to construct a long-only bond portfolio that includes the worst case value in its objective or as a constraint, using convex–concave saddle point optimization.
{"title":"Robust Bond Portfolio Construction via Convex–Concave Saddle Point Optimization","authors":"Eric Luxenberg, Philipp Schiele, Stephen Boyd","doi":"10.1007/s10957-024-02436-z","DOIUrl":"https://doi.org/10.1007/s10957-024-02436-z","url":null,"abstract":"<p>The minimum (worst case) value of a long-only portfolio of bonds, over a convex set of yield curves and spreads, can be estimated by its sensitivities to the points on the yield curve. We show that sensitivity based estimates are conservative, i.e., underestimate the worst case value, and that the exact worst case value can be found by solving a tractable convex optimization problem. We then show how to construct a long-only bond portfolio that includes the worst case value in its objective or as a constraint, using convex–concave saddle point optimization.\u0000</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140925506","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}
Pub Date : 2024-05-10DOI: 10.1007/s10957-024-02444-z
Changxin Mo, Weiyang Ding, Yimin Wei
This paper concentrates on perturbation theory concerning the tensor T-eigenvalues within the framework of tensor-tensor multiplication. Notably, it serves as a cornerstone for the extension of semidefinite programming into the domain of tensor fields, referred to as T-semidefinite programming. The analytical perturbation analysis delves into the sensitivity of T-eigenvalues for third-order tensors with square frontal slices, marking the first main part of this study. Three classical results from the matrix domain into the tensor domain are extended. Firstly, this paper presents the Gershgorin disc theorem for tensors, demonstrating the confinement of all T-eigenvalues within a union of Gershgorin discs. Afterward, generalizations of the Bauer-Fike theorem are provided, each applicable to different cases involving tensors, including those that are F-diagonalizable and those that are not. Lastly, the Kahan theorem is presented, addressing the perturbation of a Hermite tensor by any tensors. Additionally, the analysis establishes connections between the T-eigenvalue problem and various optimization problems. The second main part of the paper focuses on tensor pseudospectra theory, presenting four equivalent definitions to characterize tensor (varepsilon )-pseudospectra. Accompanied by a thorough analysis of their properties and illustrative visualizations, this section also explores the application of tensor (varepsilon )-pseudospectra in identifying more T-positive definite tensors.
本文在张量-张量乘法的框架内,集中研究了有关张量 T 特征值的扰动理论。值得注意的是,它是将半有限编程扩展到张量域(称为 T-半有限编程)的基石。分析性扰动分析深入探讨了具有正方形前切片的三阶张量的 T 特征值的敏感性,这是本研究的第一个主要部分。本文将三个经典结果从矩阵域扩展到了张量域。首先,本文提出了张量的格什高林圆盘定理,证明了所有 T 特征值都被限制在格什高林圆盘的联合体中。随后,对鲍尔-费克定理进行了概括,每种概括都适用于涉及张量的不同情况,包括可对角化和不可对角化的张量。最后,介绍了卡汉定理,该定理解决了任何张量对赫米特张量的扰动问题。此外,分析还建立了 T 特征值问题与各种优化问题之间的联系。论文的第二大部分集中于张量伪谱理论,提出了四个等价定义来描述张量(varepsilon )伪谱的特征。伴随着对其特性的深入分析和可视化说明,这一部分还探讨了张量伪谱在识别更多 T 正定张量中的应用。
{"title":"Perturbation Analysis on T-Eigenvalues of Third-Order Tensors","authors":"Changxin Mo, Weiyang Ding, Yimin Wei","doi":"10.1007/s10957-024-02444-z","DOIUrl":"https://doi.org/10.1007/s10957-024-02444-z","url":null,"abstract":"<p>This paper concentrates on perturbation theory concerning the tensor T-eigenvalues within the framework of tensor-tensor multiplication. Notably, it serves as a cornerstone for the extension of semidefinite programming into the domain of tensor fields, referred to as T-semidefinite programming. The analytical perturbation analysis delves into the sensitivity of T-eigenvalues for third-order tensors with square frontal slices, marking the first main part of this study. Three classical results from the matrix domain into the tensor domain are extended. Firstly, this paper presents the Gershgorin disc theorem for tensors, demonstrating the confinement of all T-eigenvalues within a union of Gershgorin discs. Afterward, generalizations of the Bauer-Fike theorem are provided, each applicable to different cases involving tensors, including those that are F-diagonalizable and those that are not. Lastly, the Kahan theorem is presented, addressing the perturbation of a Hermite tensor by any tensors. Additionally, the analysis establishes connections between the T-eigenvalue problem and various optimization problems. The second main part of the paper focuses on tensor pseudospectra theory, presenting four equivalent definitions to characterize tensor <span>(varepsilon )</span>-pseudospectra. Accompanied by a thorough analysis of their properties and illustrative visualizations, this section also explores the application of tensor <span>(varepsilon )</span>-pseudospectra in identifying more T-positive definite tensors.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"19 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140925265","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}
Pub Date : 2024-05-09DOI: 10.1007/s10957-024-02438-x
Hamza Ennaji, Quentin Mérigot, Luca Nenna, Brendan Pass
We study the problem of maximizing a spectral risk measure of a given output function which depends on several underlying variables, whose individual distributions are known but whose joint distribution is not. We establish and exploit an equivalence between this problem and a multi-marginal optimal transport problem. We use this reformulation to establish explicit, closed form solutions when the underlying variables are one dimensional, for a large class of output functions. For higher dimensional underlying variables, we identify conditions on the output function and marginal distributions under which solutions concentrate on graphs over the first variable and are unique, and, for general output functions, we find upper bounds on the dimension of the support of the solution. We also establish a stability result on the maximal value and maximizing joint distributions when the output function, marginal distributions and spectral function are perturbed; in addition, when the variables one dimensional, we show that the optimal value exhibits Lipschitz dependence on the marginal distributions for a certain class of output functions. Finally, we show that the equivalence to a multi-marginal optimal transport problem extends to maximal correlation measures of multi-dimensional risks; in this setting, we again establish conditions under which the solution concentrates on a graph over the first marginal.
{"title":"Robust Risk Management via Multi-marginal Optimal Transport","authors":"Hamza Ennaji, Quentin Mérigot, Luca Nenna, Brendan Pass","doi":"10.1007/s10957-024-02438-x","DOIUrl":"https://doi.org/10.1007/s10957-024-02438-x","url":null,"abstract":"<p>We study the problem of maximizing a spectral risk measure of a given output function which depends on several underlying variables, whose individual distributions are known but whose joint distribution is not. We establish and exploit an equivalence between this problem and a multi-marginal optimal transport problem. We use this reformulation to establish explicit, closed form solutions when the underlying variables are one dimensional, for a large class of output functions. For higher dimensional underlying variables, we identify conditions on the output function and marginal distributions under which solutions concentrate on graphs over the first variable and are unique, and, for general output functions, we find upper bounds on the dimension of the support of the solution. We also establish a stability result on the maximal value and maximizing joint distributions when the output function, marginal distributions and spectral function are perturbed; in addition, when the variables one dimensional, we show that the optimal value exhibits Lipschitz dependence on the marginal distributions for a certain class of output functions. Finally, we show that the equivalence to a multi-marginal optimal transport problem extends to maximal correlation measures of multi-dimensional risks; in this setting, we again establish conditions under which the solution concentrates on a graph over the first marginal.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"59 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140925256","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}
Pub Date : 2024-05-03DOI: 10.1007/s10957-024-02433-2
Yiyin Cao, Yin Chen, Chuangyin Dang
The concept of perfect equilibrium, formulated by Selten (Int J Game Theory 4:25–55, 1975), serves as an effective characterization of rationality in strategy perturbation. In our study, we propose a modified version of perfect equilibrium that incorporates perturbation control parameters. To match the beliefs with the equilibrium choice probabilities, the logistic quantal response equilibrium (logistic QRE) was established by McKelvey and Palfrey (Games Econ Behav 10:6–38, 1995), which is only able to select a Nash equilibrium. By introducing a linear combination between a mixed strategy profile and a given vector with positive elements, this paper develops a variant of the logistic QRE for the selection of the special version of perfect equilibrium. Expanding upon this variant, we construct an equilibrium system that incorporates an exponential function of an extra variable. Through rigorous error-bound analysis, we demonstrate that the solution set of this equilibrium system leads to a perfect equilibrium as the extra variable approaches zero. Consequently, we establish the existence of a smooth path to a perfect equilibrium and employ an exponential transformation of variables to ensure numerical stability. To make a numerical comparison, we capitalize on a variant of the square-root QRE, which yields another smooth path to a perfect equilibrium. Numerical results further verify the effectiveness and efficiency of the proposed differentiable path-following methods.
完美均衡的概念由塞尔滕(Int J Game Theory 4:25-55, 1975)提出,是策略扰动中理性的有效表征。在我们的研究中,我们提出了一个包含扰动控制参数的修正版完全均衡。为了使信念与均衡选择概率相匹配,McKelvey 和 Palfrey(Games Econ Behav 10:6-38, 1995)建立了逻辑量子响应均衡(logistic QRE),它只能选择纳什均衡。通过引入混合策略剖面与给定正元素向量之间的线性组合,本文开发了一种用于选择完美均衡特殊版本的逻辑 QRE 变体。在这一变体的基础上,我们构建了一个包含额外变量指数函数的均衡系统。通过严格的误差约束分析,我们证明了当额外变量趋近于零时,该均衡系统的解集会导致完美均衡。因此,我们确定了通向完全均衡的平滑路径的存在,并采用了变量的指数变换来确保数值稳定性。为了进行数值比较,我们利用了平方根 QRE 的一个变体,它产生了另一条通向完全均衡的平滑路径。数值结果进一步验证了所提出的可微分路径跟踪方法的有效性和效率。
{"title":"A Variant of the Logistic Quantal Response Equilibrium to Select a Perfect Equilibrium","authors":"Yiyin Cao, Yin Chen, Chuangyin Dang","doi":"10.1007/s10957-024-02433-2","DOIUrl":"https://doi.org/10.1007/s10957-024-02433-2","url":null,"abstract":"<p>The concept of perfect equilibrium, formulated by Selten (Int J Game Theory 4:25–55, 1975), serves as an effective characterization of rationality in strategy perturbation. In our study, we propose a modified version of perfect equilibrium that incorporates perturbation control parameters. To match the beliefs with the equilibrium choice probabilities, the logistic quantal response equilibrium (logistic QRE) was established by McKelvey and Palfrey (Games Econ Behav 10:6–38, 1995), which is only able to select a Nash equilibrium. By introducing a linear combination between a mixed strategy profile and a given vector with positive elements, this paper develops a variant of the logistic QRE for the selection of the special version of perfect equilibrium. Expanding upon this variant, we construct an equilibrium system that incorporates an exponential function of an extra variable. Through rigorous error-bound analysis, we demonstrate that the solution set of this equilibrium system leads to a perfect equilibrium as the extra variable approaches zero. Consequently, we establish the existence of a smooth path to a perfect equilibrium and employ an exponential transformation of variables to ensure numerical stability. To make a numerical comparison, we capitalize on a variant of the square-root QRE, which yields another smooth path to a perfect equilibrium. Numerical results further verify the effectiveness and efficiency of the proposed differentiable path-following methods.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"25 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889265","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}
Pub Date : 2024-04-29DOI: 10.1007/s10957-024-02432-3
Filomena Feo, Antonia Passarelli di Napoli, Maria Rosaria Posteraro
We study the local boundedness of minimizers of non uniformly elliptic integral functionals with a suitable anisotropic (p,q-) growth condition. More precisely, the growth condition of the integrand function (f(x,nabla u)) from below involves different (p_i>1) powers of the partial derivatives of u and some monomial weights (|x_i|^{alpha _i p_i}) with (alpha _i in [0,1)) that may degenerate to zero. Otherwise from above it is controlled by a q power of the modulus of the gradient of u with (qge max _i p_i) and an unbounded weight (mu (x)). The main tool in the proof is an anisotropic Sobolev inequality with respect to the weights (|x_i|^{alpha _i p_i}).
我们研究了具有合适的各向异性 (p,q-)增长条件的非均匀椭圆积分函数最小值的局部有界性。更准确地说,积分函数 (f(x,nabla u))的增长条件从下往上涉及 u 的偏导数的不同 (p_i>1) 次幂和一些单项式权重 (|x_i|^{alpha _i p_i}) with (alpha _i in [0,1)) ,这些权重可能退化为零。否则,从上面看,它是由u的梯度模的q次方控制的,有(qge max _i p_i)和一个无约束权重(mu (x))。证明的主要工具是关于权重 (|x_i|^{alpha _i p_i}) 的各向异性 Sobolev 不等式。
{"title":"Local Boundedness for Minimizers of Anisotropic Functionals with Monomial Weights","authors":"Filomena Feo, Antonia Passarelli di Napoli, Maria Rosaria Posteraro","doi":"10.1007/s10957-024-02432-3","DOIUrl":"https://doi.org/10.1007/s10957-024-02432-3","url":null,"abstract":"<p>We study the local boundedness of minimizers of non uniformly elliptic integral functionals with a suitable anisotropic <span>(p,q-)</span> growth condition. More precisely, the growth condition of the integrand function <span>(f(x,nabla u))</span> from below involves different <span>(p_i>1)</span> powers of the partial derivatives of <i>u</i> and some monomial weights <span>(|x_i|^{alpha _i p_i})</span> with <span>(alpha _i in [0,1))</span> that may degenerate to zero. Otherwise from above it is controlled by a <i>q</i> power of the modulus of the gradient of <i>u</i> with <span>(qge max _i p_i)</span> and an unbounded weight <span>(mu (x))</span>. The main tool in the proof is an anisotropic Sobolev inequality with respect to the weights <span>(|x_i|^{alpha _i p_i})</span>.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"11 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140828791","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}
Pub Date : 2024-04-26DOI: 10.1007/s10957-024-02434-1
Zhuolin Du, Chunyan Wang, Haibin Chen, Hong Yan
Real partially symmetric tensors arise from the strong ellipticity condition problem in solid mechanics and the entanglement problem in quantum physics. In this paper, we try to compute the smallest V-singular value of partially symmetric tensors with orders (p, q). This is a unified notion in a broad sense that, when ((p,q)=(2,2)), the V-singular value coincides with the notion of M-eigenvalue. To do that, we propose a generalized inverse power method with a shift variable to compute the smallest V-singular value and eigenvectors. Global convergence of the algorithm is established. Furthermore, it is proven that the proposed algorithm always converges to the smallest V-singular value and the associated eigenvectors. Several numerical experiments show the efficiency of the proposed algorithm.
实局部对称张量产生于固体力学中的强椭圆性条件问题和量子物理学中的纠缠问题。本文试图计算阶数为 (p, q) 的部分对称张量的最小 V-singular 值。这是一个广义上的统一概念,即当((p,q)=(2,2))时,V-singular值与M-特征值的概念重合。为此,我们提出了一种带有移位变量的广义反幂法,用于计算最小的 V-singular 值和特征向量。我们确定了算法的全局收敛性。此外,我们还证明了所提出的算法总是收敛于最小 V 正弦值和相关特征向量。几个数值实验表明了所提算法的效率。
{"title":"An Efficient GIPM Algorithm for Computing the Smallest V-Singular Value of the Partially Symmetric Tensor","authors":"Zhuolin Du, Chunyan Wang, Haibin Chen, Hong Yan","doi":"10.1007/s10957-024-02434-1","DOIUrl":"https://doi.org/10.1007/s10957-024-02434-1","url":null,"abstract":"<p>Real partially symmetric tensors arise from the strong ellipticity condition problem in solid mechanics and the entanglement problem in quantum physics. In this paper, we try to compute the smallest V-singular value of partially symmetric tensors with orders (<i>p</i>, <i>q</i>). This is a unified notion in a broad sense that, when <span>((p,q)=(2,2))</span>, the V-singular value coincides with the notion of M-eigenvalue. To do that, we propose a generalized inverse power method with a shift variable to compute the smallest V-singular value and eigenvectors. Global convergence of the algorithm is established. Furthermore, it is proven that the proposed algorithm always converges to the smallest V-singular value and the associated eigenvectors. Several numerical experiments show the efficiency of the proposed algorithm.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"127 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140809030","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}
Pub Date : 2024-04-20DOI: 10.1007/s10957-024-02422-5
Congying Cai, Xiaolan Yao
In this paper, an improved retractable body model (IRBM) is established, which has an advantage in simulating the flexion-and-extension motion of skier’s legs during carved turning and straight gliding. The trajectory optimization problem for the nonlinear alpine skiing system is transformed into a multi-phase optimal control (MPOC) problem. Subsequently, a constrained multi-phase trajectory optimization model is developed based on the optimal control theory, where the optimization target is to minimize the total skiing time. The optimization model is discretized by using the Radau pseudospectral method (RPM), which transcribes the MPOC problem into a nonlinear programming (NLP) problem that is then solved by SNOPT solver. Through numerical simulations, the optimization results under different constraints are obtained using MATLAB. The variation characteristics of the variables and trajectories are analyzed, and four influencing factors related to the skiing time are investigated by comparative experiments. It turns out that the small turning radius can reduce the total skiing time, the flexion-and-extension motion of legs is beneficial to skier’s performance, and the large inclination angle can shorten skier’s turning time, while the control force has a slight effect on the skiing time. The effectiveness and feasibility of the proposed models and trajectory optimization strategies are validated by simulation and experiment results.
{"title":"Multi-Phase Trajectory Optimization for Alpine Skiers Using an Improved Retractable Body Model","authors":"Congying Cai, Xiaolan Yao","doi":"10.1007/s10957-024-02422-5","DOIUrl":"https://doi.org/10.1007/s10957-024-02422-5","url":null,"abstract":"<p>In this paper, an improved retractable body model (IRBM) is established, which has an advantage in simulating the flexion-and-extension motion of skier’s legs during carved turning and straight gliding. The trajectory optimization problem for the nonlinear alpine skiing system is transformed into a multi-phase optimal control (MPOC) problem. Subsequently, a constrained multi-phase trajectory optimization model is developed based on the optimal control theory, where the optimization target is to minimize the total skiing time. The optimization model is discretized by using the Radau pseudospectral method (RPM), which transcribes the MPOC problem into a nonlinear programming (NLP) problem that is then solved by SNOPT solver. Through numerical simulations, the optimization results under different constraints are obtained using MATLAB. The variation characteristics of the variables and trajectories are analyzed, and four influencing factors related to the skiing time are investigated by comparative experiments. It turns out that the small turning radius can reduce the total skiing time, the flexion-and-extension motion of legs is beneficial to skier’s performance, and the large inclination angle can shorten skier’s turning time, while the control force has a slight effect on the skiing time. The effectiveness and feasibility of the proposed models and trajectory optimization strategies are validated by simulation and experiment results.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"211 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140630356","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}
Pub Date : 2024-04-18DOI: 10.1007/s10957-024-02406-5
Baha Alzalg, Lilia Benakkouche
This paper explores the nonconvex second-order cone as a nonconvex conic extension of the known convex second-order cone in optimization, as well as a higher-dimensional conic extension of the known causality cone in relativity. The nonconvex second-order cone can be used to reformulate nonconvex quadratic programming and nonconvex quadratically constrained quadratic program in conic format. The cone can also arise in real-world applications, such as facility location problems in optimization when some existing facilities are more likely to be closer to new facilities than other existing facilities. We define notions of the algebraic structure of the nonconvex second-order cone and show that its ambient space is commutative and power-associative, wherein elements always have real eigenvalues; this is remarkable because it is not the case for arbitrary Jordan algebras. We will also find that the ambient space of this nonconvex cone is rank-independent of its dimension; this is also notable because it is not the case for algebras of arbitrary convex cones. What is more noteworthy is that we prove that the nonconvex second-order cone equals the cone of squares of its ambient space; this is not the case for all non-Euclidean Jordan algebras. Finally, numerous algebraic properties that already exist in the framework of the convex second-order cone are generalized to the framework of the nonconvex second-order cone.
{"title":"The Nonconvex Second-Order Cone: Algebraic Structure Toward Optimization","authors":"Baha Alzalg, Lilia Benakkouche","doi":"10.1007/s10957-024-02406-5","DOIUrl":"https://doi.org/10.1007/s10957-024-02406-5","url":null,"abstract":"<p>This paper explores the nonconvex second-order cone as a nonconvex conic extension of the known convex second-order cone in optimization, as well as a higher-dimensional conic extension of the known causality cone in relativity. The nonconvex second-order cone can be used to reformulate nonconvex quadratic programming and nonconvex quadratically constrained quadratic program in conic format. The cone can also arise in real-world applications, such as facility location problems in optimization when some existing facilities are more likely to be closer to new facilities than other existing facilities. We define notions of the algebraic structure of the nonconvex second-order cone and show that its ambient space is commutative and power-associative, wherein elements always have real eigenvalues; this is remarkable because it is not the case for arbitrary Jordan algebras. We will also find that the ambient space of this nonconvex cone is rank-independent of its dimension; this is also notable because it is not the case for algebras of arbitrary convex cones. What is more noteworthy is that we prove that the nonconvex second-order cone equals the cone of squares of its ambient space; this is not the case for all non-Euclidean Jordan algebras. Finally, numerous algebraic properties that already exist in the framework of the convex second-order cone are generalized to the framework of the nonconvex second-order cone.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"27 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140614135","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}
Pub Date : 2024-04-15DOI: 10.1007/s10957-024-02430-5
T. Sathiyaraj, JinRong Wang
This paper gives the controllability and Ulam–Hyers–Rassias (U–H–R) stability results for non-instantaneous impulsive stochastic multiple delays system with nonpermutable variable coefficients. The solution for nonlinear non-instantaneous impulsive stochastic systems is presented without the assumption of commutative property on delayed matrix coefficients. The kernel function of the solution operator is defined by sum of noncommutative products of delayed matrix constant coefficients. Sufficient conditions for controllability of linear and nonlinear non-instantaneous impulsive stochastic multiple delays system are established by using the Mönch fixed-point theorem under the proof that the corresponding linear system is controllable. Thereafter, U–H–R stability result is proved. Finally, the theoretical results are verified by a numerical example.
{"title":"Controllability and Stability of Non-instantaneous Impulsive Stochastic Multiple Delays System","authors":"T. Sathiyaraj, JinRong Wang","doi":"10.1007/s10957-024-02430-5","DOIUrl":"https://doi.org/10.1007/s10957-024-02430-5","url":null,"abstract":"<p>This paper gives the controllability and Ulam–Hyers–Rassias (U–H–R) stability results for non-instantaneous impulsive stochastic multiple delays system with nonpermutable variable coefficients. The solution for nonlinear non-instantaneous impulsive stochastic systems is presented without the assumption of commutative property on delayed matrix coefficients. The kernel function of the solution operator is defined by sum of noncommutative products of delayed matrix constant coefficients. Sufficient conditions for controllability of linear and nonlinear non-instantaneous impulsive stochastic multiple delays system are established by using the Mönch fixed-point theorem under the proof that the corresponding linear system is controllable. Thereafter, U–H–R stability result is proved. Finally, the theoretical results are verified by a numerical example.</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"42 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140579968","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}