Journal of the Operations Research Society of China

ESCI-ISI SCOPUS (2013-2023)

  2194-6698

  2194-668X

 

Cơ quản chủ quản:  Springer Heidelberg , Springer Science + Business Media

Lĩnh vực:
Applied MathematicsManagement Science and Operations ResearchMathematics (miscellaneous)

Các bài báo tiêu biểu

A Review on Deep Learning in Medical Image Reconstruction
Tập 8 Số 2 - Trang 311-340 - 2020
Haimiao Zhang, Bin Dong
A Brief Introduction to Manifold Optimization
Tập 8 Số 2 - Trang 199-248 - 2020
Jiang Hu, Xin Liu, Zaiwen Wen, Ya-xiang Yuan
Abstract

Manifold optimization is ubiquitous in computational and applied mathematics, statistics, engineering, machine learning, physics, chemistry, etc. One of the main challenges usually is the non-convexity of the manifold constraints. By utilizing the geometry of manifold, a large class of constrained optimization problems can be viewed as unconstrained optimization problems on manifold. From this perspective, intrinsic structures, optimality conditions and numerical algorithms for manifold optimization are investigated. Some recent progress on the theoretical results of manifold optimization is also presented.

On the Sublinear Convergence Rate of Multi-block ADMM
- 2015
Tian Lin, Qian Shi, Shu Zhong Zhang
A Survey on Some Recent Developments of Alternating Direction Method of Multipliers
- 2022
Deren Han
Abstract

Recently, alternating direction method of multipliers (ADMM) attracts much attentions from various fields and there are many variant versions tailored for different models. Moreover, its theoretical studies such as rate of convergence and extensions to nonconvex problems also achieve much progress. In this paper, we give a survey on some recent developments of ADMM and its variants.

Online Over Time Scheduling on Parallel-Batch Machines: A Survey
- 2014
Jing Tian, Ruyan Fu, Jinjiang Yuan
Optimality Conditions of Approximate Solutions for Nonsmooth Semi-infinite Programming Problems
Tập 6 Số 2 - Trang 289-299 - 2018
Long, Xian-Jun, Xiao, Yi-Bin, Huang, Nan-Jing
In this paper, we study optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems. Three new classes of functions, namely $$\varepsilon $$ -pseudoconvex functions of type I and type II and $$\varepsilon $$ -quasiconvex functions are introduced, respectively. By utilizing these new concepts, sufficient optimality conditions of approximate solutions for the nonsmooth semi-infinite programming problem are established. Some examples are also presented. The results obtained in this paper improve the corresponding results of Son et al. (J Optim Theory Appl 141:389–409, 2009).
Optimized Filling of a Given Cuboid with Spherical Powders for Additive Manufacturing
- 2021
Zoia Duriagina, I.A. Lemishka, Igor Litvinchev, José A. Marmolejo, А. В. Панкратов, T. Romanova, Georgy Yaskov
Randomized Primal–Dual Proximal Block Coordinate Updates
Tập 7 Số 2 - Trang 205-250 - 2019
Xiang Gao, Yang Xu, Shu Zhong Zhang
Computation of Fisher–Gale Equilibrium by Auction
- 2018
Yurii Nesterov, Vladimir Shikhman
Abstract

We study the Fisher model of a competitive market from the algorithmic perspective. For that, the related convex optimization problem due to Gale and Eisenberg (Ann Math Stat 30(1):165–168, 1959) is used. The latter problem is known to yield a Fisher equilibrium under some structural assumptions on consumers’ utilities, e.g., homogeneity of degree 1, homotheticity. Our goal is to examine applicability of the convex optimization framework by departing from these traditional assumptions. We just assume the concavity of consumers’ utility functions. For this case, we suggest a novel concept of Fisher–Gale equilibrium by using consumers’ utility prices. The prices of utility transfer the utility of consumption bundle to a common numéraire. We develop a subgradient-type algorithm from Convex Analysis to compute a Fisher–Gale equilibrium via Gale’s approach. In order to decentralize prices, we additionally implement the auction design, i.e., consumers settle and update their individual prices and producers sell at the highest offer price. Our price adjustment is based on a tatonnement procedure, i.e., the prices change proportionally to consumers’ individual excess supplies. Historical averages of consumption are shown to clear the market of goods. Our algorithm is justified by a global rate of convergence. In the worst case, the number of price updates needed to achieve an $$\varepsilon $$ ε -tolerance is proportional to $$\frac{1}{\varepsilon ^2}$$ 1 ε 2 .