|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A slacks-based measure of efficiency in data envelopment analysis显示文摘 | Kaoru Tone | 2001 | European Journal of Operational Research2001，，3： | 10 |
| 2 | Supply Chain Coordination with Contracts显示文摘 | Gérard P. Cachon | 2003 | Handbooks in Operations Research and Management Science2003，，： | 9 |
| 3 | Theory of Compressive Sensing via l1-Minimization:a Non-RIP Analysis and Extensions显示文摘Compressive sensing(CS)is an emerging methodology in computational signal processing that has recently attracted intensive research activities.At present,the basic CS theory includes recoverability and stability:the former quantifies the central fact that a sparse signal of length n can be exactly recovered from far fewer than n measurements via l1-minimization or other recovery techniques,while the latter specifies the stability of a recovery technique in the presence of measurement errors and inexact sparsity.So far,most analyses in CS rely heavily on the Restricted Isometry Property(RIP)for matrices.In this paper,we present an alternative,non-RIP analysis for CS via l1-minimization.Our purpose is three-fold:(a)to introduce an elementary and RIP-free treatment of the basic CS theory;(b)to extend the current recoverability and stability results so that prior knowledge can be utilized to enhance recovery via l1-minimization;and(c)to substantiate a property called uniform recoverability of l1-minimization;that is,for almost all random measurement matrices recoverability is asymptotically identical.With the aid of two classic results,the non-RIP approach enables us to quickly derive from scratch all basic results for the extended theory. | Yin Zhang | 2013 | Journal of the Operations Research Society of China2013，1，1： | 9 |
| 4 | Financing newsvendor inventory显示文摘 | Maqbool Dada Qiaohai Hu | 2008 | Operations Research Letters2008，，5： | 6 |
| 5 | Strategic commitment to price to stimulate downstream innovation in a supply chain显示文摘 | Stephen M Gilbert Viswanath Cvsa | 2002 | European Journal of Operational Research2002，，3： | 5 |
| 6 | Efficiency of financial institutions: International survey and directions for future research显示文摘 | Allen N. Berger David B. Humphrey | 1997 | European Journal of Operational Research1997，，2： | 5 |
| 7 | Multiobjective cuckoo search for design optimization显示文摘 | Xin-She Yang Suash Deb | 2011 | Computers and Operations Research2011，，： | 5 |
| 8 | A slacks-based measure of super-efficiency in data envelopment analysis显示文摘 | Kaoru Tone | 2002 | European Journal of Operational Research2002，，1： | 5 |
| 9 | Alternating Direction Method of Multipliers for Sparse Principal Component Analysis显示文摘We consider a convex relaxation of sparse principal component analysisproposed by d' Aspremont et al. (SIAM Rev. 49:434 448, 2007). This convex relax-ation is a nonsmooth semidefinite programming problem in which the ξ1 norm of thedesired matrix is imposed in either the objective function or the constraint to improvethe sparsity of the resulting matrix. The sparse principal component is obtained by arank- one decomposition of the resulting sparse matrix. We propose an alternating di-rection method based on a variable-splitting technique and an augmented I agrangianframework for solving this nonsmooth semidefinite programming problem. In con-trast to the first-order method proposed in d' Aspremont et al. (SIAM Rev. 49:434448, 2007), which solves approximately the dual problem of the original semidefiniteprogramming problem, our method deals with the primal problem directly and solvesit exactly, which guarantees that the resulting matrix is a sparse matrix. A globalconvergence result is established for the proposed method. Numerical results on bothsynthetic problems and the real applications from classification of text data and senatevoting data are reported to demonstrate the efficacy of our method. | Shiqian Ma | 2013 | Journal of the Operations Research Society of China2013，1，2： | 5 |
| 10 | First-Order Algorithms for Convex Optimization with Nonseparable Objective and Coupled Constraints显示文摘In this paper,we consider a block-structured convex optimization model,where in the objective the block variables are nonseparable and they are further linearly coupled in the constraint.For the 2-block case,we propose a number of first-order algorithms to solve this model.First,the alternating direction method of multipliers(ADMM)is extended,assuming that it is easy to optimize the augmented Lagrangian function with one block of variables at each time while fixing the other block.We prove that O(1/t)iteration complexity bound holds under suitable conditions,where t is the number of iterations.If the subroutines of the ADMM cannot be implemented,then we propose new alternative algorithms to be called alternating proximal gradient method of multipliers,alternating gradient projection method of multipliers,and the hybrids thereof.Under suitable conditions,the O(1/t)iteration complexity bound is shown to hold for all the newly proposed algorithms.Finally,we extend the analysis for the ADMM to the general multi-block case. | Xiang Gao Shu-Zhong Zhang | 2017 | Journal of the Operations Research Society of China2017，5，2： | 4 |
| 11 | Pricing Decisions in Dual-Channel Closed-Loop Supply Chain Under Retailer’s Risk Aversion and Fairness Concerns显示文摘This paper studies the price decisions in a dual-channel closed-loop supply chain with a risk-averse retailer and a risk-neutral manufacturer by modeling and analyzing three cases:(1)the retailer does not have fairness concerns;(2)the retailer has fairness concerns and the manufacturer considers it;and(3)the retailer has fairness concerns and the manufacturer does not consider it.The effects of risk aversion and fairness concerns on the pricing decisions,profits and demand are examined in differing scenarios. | Chun-Fa Li Xue-Qing Guo Dong-Lei Du | 2021 | Journal of the Operations Research Society of China2021，9，3： | 4 |
| 12 | Coordinating an innovation in supply chain management显示文摘 | Bowon Kim | 2000 | European Journal of Operational Research2000，，3： | 4 |
| 13 | Network DEA: A slacks-based measure approach显示文摘 | Kaoru Tone Miki Tsutsui | 2008 | European Journal of Operational Research2008，，1： | 4 |
| 14 | On the Linear Convergence of a Proximal Gradient Method for a Class of Nonsmooth Convex Minimization Problems显示文摘We consider a class of nonsmooth convex optimization problems where the objective function is the composition of a strongly convex differentiable function with a linear mapping,regularized by the sum of both l1-norm and l2-norm of the optimization variables.This class of problems arise naturally from applications in sparse group Lasso,which is a popular technique for variable selection.An effective approach to solve such problems is by the Proximal Gradient Method(PGM).In this paper we prove a local error bound around the optimal solution set for this problem and use it to establish the linear convergence of the PGM method without assuming strong convexity of the overall objective function. | Haibin Zhang Jiaojiao Jiang Zhi-Quan Luo | 2013 | Journal of the Operations Research Society of China2013，1，2： | 4 |
| 15 | A survey of data envelopment analysis in energy and environmental studies显示文摘 | P. Zhou B.W. Ang K.L. Poh | 2007 | European Journal of Operational Research2007，，1： | 3 |
| 16 | Supply chain coordination with downstream operating costs: Coordination and investment to improve downstream operating efficiency显示文摘 | Richard K. Cho Yigal Gerchak | 2003 | European Journal of Operational Research2003，，3： | 3 |
| 17 | Eco-efficiency analysis of power plants: An extension of data envelopment analysis显示文摘 | Pekka J. Korhonen Mikulas Luptacik | 2003 | European Journal of Operational Research2003，，2： | 3 |
| 18 | A Subspace Version of the Powell–Yuan Trust-Region Algorithm for Equality Constrained Optimization显示文摘This paper studied subspace properties of the Celis–Dennis–Tapia(CDT)subproblem that arises in some trust-region algorithms for equality constrained optimization.The analysis is an extension of that presented by Wang and Yuan(Numer.Math.104:241–269,2006)for the standard trust-region subproblem.Under suitable conditions,it is shown that the trial step obtained from the CDT subproblem is in the subspace spanned by all the gradient vectors of the objective function and of the constraints computed until the current iteration.Based on this observation,a subspace version of the Powell–Yuan trust-region algorithm is proposed for equality constrained optimization problems where the number of constraints is much lower than the number of variables. The convergence analysis is given and numerical results arealso reported. | Geovani Nunes Grapiglia Jinyun Yuan Ya-xiang Yuan | 2013 | Journal of the Operations Research Society of China2013，1，4： | 3 |
| 19 | Closed-loop supply chain network equilibrium under legislation显示文摘 | David Hammond Patrick Beullens | 2006 | European Journal of Operational Research2006，，2： | 3 |
| 20 | Optimality Conditions of Approximate Solutions for Nonsmooth Semi-infinite Programming Problems显示文摘In this paper,we study optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems.Three new classes of functions,namelyε-pseudoconvex functions of type I and type II andε-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). | Xian-Jun Long Yi-Bin Xiao Nan-Jing Huang | 2018 | Journal of the Operations Research Society of China2018，6，2： | 3 |
您所在的机构暂未开通此部分的功能，请联系管理员