Treffer: Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management.

Stochastic Hidden Convex Optimization and Its Applications How to solve nonconvex optimization to global optimality is challenging and important for various applications. In "Efficient Algorithms for a Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management," Chen, He, Hu, and Ye designed three algorithms that converge to global optimality efficiently for a class of stochastic nonconvex optimization that admits implicit hidden convexity (there exists an inaccessible convex reformulation). In particular, the complexity of the proposed mirror stochastic gradient (MSG) method matches the optimal complexity of black-box first-order methods for stochastic convex optimization. The authors applied the proposed MSG algorithm to solve both passenger and air-cargo network revenue management problems considering the booking limit control policy. The extensive numerical experiments demonstrate the superior performance of MSG algorithm for booking limit control with higher revenue and lower computation cost than state-of-the-art bid-price-based control policies, especially when the variance of random capacity is large. We study a class of stochastic nonconvex optimization in the form of minx∈XF(x)≔Eξ[f(ϕ(x,ξ))] , that is, F is a composition of a convex function f and a random function ϕ. Leveraging an (implicit) convex reformulation via a variable transformation u=E[ϕ(x,ξ)] , we develop stochastic gradient-based algorithms and establish their sample and gradient complexities for achieving an ϵ -global optimal solution. Interestingly, our proposed Mirror Stochastic Gradient (MSG) method operates only in the original x-space using gradient estimators of the original nonconvex objective F and achieves O˜(ϵ−2) complexities, matching the lower bounds for solving stochastic convex optimization problems. Under booking limits control, we formulate the air-cargo network revenue management (NRM) problem with random two-dimensional capacity, random consumption, and routing flexibility as a special case of the stochastic nonconvex optimization, where the random function ϕ(x,ξ)=x∧ξ , that is, the random demand ξ truncates the booking limit decision x. Extensive numerical experiments demonstrate the superior performance of our proposed MSG algorithm for booking limit control with higher revenue and lower computation cost than state-of-the-art bid-price-based control policies, especially when the variance of random capacity is large. Funding: This work was partly supported by the National Science Foundation [Grants CMMI-1761699, CRII-1755829], the ZJU-UIUC Institute Research Program, and NCCR Automation in Switzerland. Supplemental Material: The computer code and data that support the findings of this study are available within this article's supplemental material at https://doi.org/10.1287/opre.2022.0216. [ABSTRACT FROM AUTHOR]

Copyright of Operations Research is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Volltext ist im Gastzugang nicht verfügbar. Melden Sie sich für Vollzugriff an.