Large scale optimization : state of the art
Large scale optimization : state of the art
复制标题
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
William W. Hager;D. Hearn;P. Pardalos
中科院分区：
文献类型：
--
作者：
William W. Hager;D. Hearn;P. Pardalos
前言。《DQA算法的重启策略》，A.J.Berger，J.M.Mulvey，A.Ruszczynski。分配拍卖算法和最小成本流的epsilon松弛(预流-推)方法的数学等价性。大型非线性规划的修正Log-Barrier函数的初步计算经验。大规模全局优化的一种新的随机/摄动方法及其在水集群问题中的应用在大规模优化的背景下改进部分可分离函数的分解：第一种方法：A.R.Conn，N.Gould，P.L.Toint。函数空间中与梯度相关的约束最小化算法：收敛性质和计算含义，J.C.Dunn。乘子交替方向法的一些重新表述及其应用。原始预分解算法的经验R·福雷尔，D.M.盖伊。约束非光滑方程的信赖域方法关于凸、拟凸可行性问题列生成算法的复杂性.高芬，罗志全，叶银玉.非光滑C·T·凯利支承的识别。关于超大规模指派问题Y.Lee，J.B.Orlin。抛物型状态约束控制问题的SQP和内点方法数值解F.具有吸引和排斥的Weber问题的全局优化方法基于并行遗传算法的大规模多样性最小化。大规模边界约束优化问题的Barrier方法和改进Barrier方法的数值比较多目标跟踪中若干数据关联问题的数值研究。用全局收敛内点法确定网络线性规划的最优面，M.G.C.Resende，T.Tuchiya，G.Veiga用随机分解算法求解大规模随机规划，S.Sen，J.Mai，J.L.Higle.线性规划和凸二次规划的一个简单的二次收敛内点算法[A·L·蒂茨]，周俊龙.关于结构力学中非凸非光滑优化问题的两种算法首页--期刊主要分类--期刊细介绍--期刊题录与文摘--期刊详细文摘内容
Preface. Restarting Strategies for the DQA Algorithm A.J. Berger, J.M. Mulvey, A. Ruszczynski. Mathematical Equivalence of the Auction Algorithm for Assignment and the epsilon-Relaxation (Preflow-Push) Method for Min Cost Flow D.P. Bertsekas. Preliminary Computational Experience with Modified Log-Barrier Functions for Large-Scale Nonlinear Programming M.G. Breitfeld, D.F. Shanno. A New Stochastic/Perturbation Method for Large-Scale Global Optimization and its Application to Water Cluster Problems R.H. Byrd, T. Derby, E. Eskow, K.P.B. Oldenkamp, R.B. Schnabel. Improving the Decomposition of Partially Separable Functions in the Context of Large-Scale Optimization: a First Approach A.R. Conn, N. Gould, P.L. Toint. Gradient-Related Constrained Minimization Algorithms in Function Spaces: Convergence Properties and Computational Implications J.C. Dunn. Some Reformulations and Applications of the Alternating Direction Method of Multipliers J. Eckstein, M. Fukushima. Experience with a Primal Presolve Algorithm R. Fourer, D.M. Gay. A Trust Region Method for Constrained Nonsmooth Equations S.A. Gabriel, Jong-Shi Pang. On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problems J.-L. Goffin, Zhi-Quan Luo, Yinyu Ye. Identificiation of the Support of Nonsmoothness C.T. Kelley. On Very Large Scale Assignment Problems Y. Lee, J.B. Orlin. Numerical Solution of Parabolic State Constrained Control Problems Using SQP and Interior-Point-Methods F. Leibfritz, E.W. Sachs. A Global Optimization Method for Weber's Problem with Attraction and Repulsion C.D. Maranas, C.A. Floudas. Large-Scale Diversity Minimization via Parallel Genetic Algorithms R.R. Meyer, J. Yackel. A Numerical Comparison of Barrier andModified Barrier Methods for Large-Scale Bound-Constrained Optimization S.G. Nash, R. Polyak, A. Sofer. A Numerical Study of Some Data Association Problems Arising in Multitarget Tracking A.B. Poore, N. Rijavec. Identifying the Optimal Face of a Network Linear Program with a Globally Convergent Interior Point Method M.G.C. Resende, T. Tsuchiya, G. Veiga. Solution of Large Scale Stochastic Programs with Stochastic Decomposition Algorithms S. Sen, J.Mai, J.L. Higle. A Simple, Quadratically Convergent Interior Point Algorithm for Linear Programming and Convex Quadratic Programming A.L. Tits, J.L. Zhou. On Two Algorithms for Nonconvex Nonsmooth Optimization Problems in Structural Mechanics M.Ap. Tzaferopoulos, E.S. Mistakidis, C.D. Bisbos, P.D. Panagiotopoulos.