Articles

• Preface

  i-ii

  • Preview
  • Requires Subscription Full PDF

  117 49

• An Augmented Lagrangian Trust Region Method with a Bi-Object Strategy

  Caixia Kou, Zhongwen Chen, Yuhong Dai, Haifei Han

  331-350

  https://doi.org/10.4208/jcm.1705-m2016-0820

  • Preview
  • Requires Subscription Full PDF

  40777 3021

• A Trust-Region-Based Alternating Least-Squares Algorithm for Tensor Decompositions

  Fan Jiang, Deren Han, Xiaofei Zhang

  351-373

  https://doi.org/10.4208/jcm.1605-m2016-0828

  • Preview
  • Requires Subscription Full PDF

  41456 2997

• SNIG Property of Matrix Low-Rank Factorization Model

  Hong Wang, Xin Liu, Xiaojun Chen, Yaxiang Yuan

  374-390

  https://doi.org/10.4208/jcm.1707-m2016-0796

  • Preview
  • Requires Subscription Full PDF

  45735 2947

• On Doubly Positive Semidefinite Programming Relaxations

  Taoran Fu, Dongdong Ge, Yinyu Ye

  391-403

  https://doi.org/10.4208/jcm.1708-m2017-0130

  • Preview
  • Requires Subscription Full PDF

  41695 2916

• Parallel Stochastic Newton Method

  Mojmír Mutný, Peter Richtárik

  404-425

  https://doi.org/10.4208/jcm.1708-m2017-0113

  • Preview
  • Requires Subscription Full PDF

  40174 2868

• Reduced-Rank Modeling for High-Dimensional Model-Based Clustering

  Lei Yang, Junhui Wang, Shiqian Ma

  426-440

  https://doi.org/10.4208/jcm.1708-m2016-0830

  • Preview
  • Requires Subscription Full PDF

  39530 2859

• A Complete Characterization of the Robust Isolated Calmness of Nuclear Norm Regularized Convex Optimization Problems

  Ying Cui, Defeng Sun

  441-458

  https://doi.org/10.4208/jcm.1709-m2017-0034

  • Preview
  • Requires Subscription Full PDF

  39574 2802

• Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP

  Daniel Rehfeldt, Thorsten Koch

  459-468

  https://doi.org/10.4208/jcm.1709-m2017-0002

  • Preview
  • Requires Subscription Full PDF

  40005 2932