Optimization Methods and Software, Volume 35

Volume 35, Number 1, 2020

Original Articles

• 
  Daniele Ferone, Paola Festa, Francesca Guerriero:
  An efficient exact approach for the constrained shortest path tour problem. 1-20
• 
  Byoung Jin Choi, Un Cig Ji, Yongdo Lim:
  Convex feasibility problems on uniformly convex metric spaces. 21-36
• 
  Robert Burlacu, Björn Geißler, Lars Schewe:
  Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes. 37-64
• 
  Radek Kucera, Kristina Motycková, Alexandros Markopoulos, Jaroslav Haslinger:
  On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate. 65-86
• 
  Defeng Sun, Kim-Chuan Toh, Yancheng Yuan, Xin-Yuan Zhao:
  SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0). 87-115
• 
  Siwen Liu, Xinbao Liu, Jun Pei, Panos M. Pardalos, Qingru Song:
  Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm. 116-141
• 
  Christian Clason, Yu Deng, Patrick Mehlitz, Uwe Prüfert:
  Optimal control problems with control complementarity constraints: existence results, optimality conditions, and a penalty method. 142-170
• 
  David E. Bernal, Stefan Vigerske, Francisco Trespalacios, Ignacio E. Grossmann:
  Improving the performance of DICOPT in convex MINLP problems using a feasibility pump. 171-190
• 
  Albert S. Berahas, Martin Takác:
  A robust multi-batch L-BFGS method for machine learning. 191-219

Volume 35, Number 2, 2020

Part I of the special issue dedicated to the 60th birthday of Professor Ya-xiang Yuan.
Preface

• 
  Yu-Hong Dai, Xin Liu, Jiawang Nie, Zaiwen Wen:
  Preface. 221-222

Original Articles

• 
  Azam Asl, Michael L. Overton:
  Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions. 223-242
• 
  Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
  A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. 243-256
• 
  Wenbo Gao, Donald Goldfarb, Frank E. Curtis:
  ADMM for multiaffine constrained optimization. 257-303
• 
  Nicholas I. M. Gould, Valeria Simoncini:
  Error estimates for iterative algorithms for minimizing regularized quadratic subproblems. 304-328
• 
  Jiawang Nie, Liu Yang, Suhan Zhong:
  Stochastic polynomial optimization. 329-347
• 
  Dingtao Peng, Xiaojun Chen:
  Computation of second-order directional stationary points for group sparse optimization. 348-376
• 
  Xin Zhang, Qin Ni, Zhili Ge:
  A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor. 377-393
• 
  Xuezhong Wang, Maolin Che, Liqun Qi, Yimin Wei:
  Modified gradient dynamic approach to the tensor complementarity problem. 394-415
• 
  Leqin Wu, Xin Liu, Zaiwen Wen:
  Symmetric rank-1 approximation of symmetric high-order tensors. 416-438

Volume 35, Number 3, 2020

The 4th Conference on Optimization Methods and Software, Part II December 16-20, 2017, Havana, Cuba.
Original Articles

• 
  Ioannis C. Demetriou:
  Separation theorems for the extrema of best piecewise monotonic approximations to successive data. 439-459
• 
  Jennifer B. Erway, Joshua D. Griffin, Roummel F. Marcia, Riadh Omheni:
  Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations. 460-487
• 
  Ivet L. Galabova, J. A. J. Hall:
  The 'Idiot' crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems. 488-501
• 
  Giulio Galvan, Matteo Lapucci, Tommaso Levato, Marco Sciandrone:
  An Alternating Augmented Lagrangian method for constrained nonconvex optimization. 502-520
• 
  Warren L. Hare, Chayne Planiden, Claudia A. Sagastizábal:
  A derivative-free VU-algorithm for convex finite-max problems. 521-559
• 
  Lisa C. Hegerhorst-Schultchen, Christian Kirches, Marc Christian Steinbach:
  On the relation between MPECs and optimization problems in abs-normal form. 560-575
• 
  Michael Hintermüller, Nikolai Strogies:
  Identification of the friction function in a semilinear system for gas transport through a network. 576-617
• 
  Pavanakumar Mohanamuraly, Laurent Hascoët, Jens-Dominik Müller:
  Seeding and adjoining zero-halo partitioned parallel scientific codes. 618-637
• 
  Benjamin Sauk, Nikolaos Ploskas, Nikolaos V. Sahinidis:
  GPU parameter tuning for tall and skinny dense linear least squares problems. 638-660

Volume 35, Number 4, 2020

Special issue dedicated to Professor Ya-xiang Yuan on the occasion of his 60th birthday, Part II.

• 
  Albert S. Berahas, Raghu Bollapragada, Jorge Nocedal:
  An investigation of Newton-Sketch and subsampled Newton methods. 661-680
• 
  Yakui Huang, Yu-Hong Dai, Xinwei Liu, Hongchao Zhang:
  Gradient methods exploiting spectral properties. 681-705
• 
  Zeyu Jia, Zaiwen Wen, Yinyu Ye:
  Towards solving 2-TBSG efficiently. 706-721
• 
  Jian Sun, Dachuan Xu, Deren Han, Wenjing Hou, Xiaoyan Zhang:
  Randomized mechanism design for decentralized network scheduling. 722-740
• 
  Conghui Tan, Yuqiu Qian, Shiqian Ma, Tong Zhang:
  Accelerated dual-averaging primal-dual method for composite convex minimization. 741-766
• 
  Haiyan Wang, Jinyan Fan:
  Convergence rate of the Levenberg-Marquardt method under Hölderian local error bound. 767-786
• 
  Li Wang, Lei-Hong Zhang, Zhaojun Bai, Ren-Cang Li:
  Orthogonal canonical correlation analysis and applications. 787-807
• 
  Xiao Wang, Hongchao Zhang:
  Inexact proximal stochastic second-order methods for nonconvex composite optimization. 808-835
• 
  Jialiang Xu, Yun-Bin Zhao:
  Stability analysis of a class of sparse optimization problems. 836-854
• 
  Yinqiao Yan, Qingna Li:
  An efficient augmented Lagrangian method for support vector machine. 855-883

Volume 35, Number 5, 2020

OMS special issue dedicated to Professor Ya-xiang Yuan on the occasion of his 60th birthday, Part III. Original Articles

• 
  Ernesto G. Birgin, José Mario Martínez:
  Complexity and performance of an Augmented Lagrangian algorithm. 885-920
• 
  Tamir Hazan, Shoham Sabach, Sergey Voldman:
  Stochastic proximal linear method for structured non-convex problems. 921-937
• 
  Yu-Hong Dai, Florian Jarre, Felix Lieder:
  On the existence of affine invariant descent directions. 938-954
• 
  Wei Peng, Yu-Hong Dai, Hui Zhang, Lizhi Cheng:
  Training GANs with centripetal acceleration. 955-973
• 
  Yuki Satake, Tomohiro Sogabe, Tomoya Kemmochi, Shao-Liang Zhang:
  On a transformation of the ∗-congruence Sylvester equation for the least squares optimization. 974-981
• 
  Cong Sun, Yanfei Wang:
  Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method. 982-1001
• 
  Xiaojiao Tong, Liu Yang, Xiao Luo, Bo Rao:
  A stochastic dual dynamic programming method for two-stage distributionally robust optimization problems. 1002-1021
• 
  Yule Zhang, Jia Wu, Liwei Zhang:
  The rate of convergence of proximal method of multipliers for nonlinear programming. 1022-1049

Volume 35, Number 6, 2020

Original Articles

• 
  Shengwei Yao, Liangshuo Ning, Huonian Tu, Jieqiong Xu:
  A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice. 1051-1064
• 
  Emre Çimen, Gürkan Öztürk:
  O-PCF algorithm for one-class classification. 1065-1079
• 
  Shousheng Luo, Yanchun Zhang, Tie Zhou, Jinping Song, Yanfei Wang:
  XCT image reconstruction by a modified superiorized iteration and theoretical analysis. 1080-1097
• 
  Nimit Nimana, Narin Petrot:
  Splitting proximal with penalization schemes for additive convex hierarchical minimization problems. 1098-1118
• 
  Masoud Ataei, Shengyuan Chen, Zijiang Yang, M. Reza Peyghami:
  Time-homogeneous top-K ranking using tensor decompositions. 1119-1143
• 
  Qi Li, Jiang Zhong, Zehong Cao, Xue Li:
  Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy. 1144-1159
• 
  Renata Sotirov:
  On solving the densest k-subgraph problem on large graphs. 1160-1178
• 
  Jinyan Fan, Jiawang Nie, Ruixue Zhao:
  The maximum tensor complementarity eigenvalues. 1179-1190
• 
  Maxim V. Dolgopolik:
  The method of codifferential descent for convex and global piecewise affine optimization. 1191-1222
• 
  N. Mahdavi-Amiri, F. Salehi Sadaghiani:
  A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization. 1223-1247
• 
  Patrick E. Farrell, Matteo Croci, Thomas M. Surowiec:
  Deflation for semismooth equations. 1248-1271
• 
  Boris T. Polyak, Andrey A. Tremba:
  New versions of Newton method: step-size choice, convergence domain and under-determined equations. 1272-1303
• 
  Predrag S. Stanimirovic, Vasilios N. Katsikis, Zhijun Zhang, Shuai Li, Jianlong Chen, Mengmeng Zhou:
  Varying-parameter Zhang neural network for approximating some expressions involving outer inverses. 1304-1330