Optimization Methods and Software, Volume 33

Volume 33, Number 1, 2018

Original Articles

• 
  Tomonari Kitahara, Takashi Tsuchiya:
  An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming. 1-25
• 
  Kees Roos:
  An improved version of Chubanov's method for solving a homogeneous feasibility problem. 26-44
• 
  Matthew C. Fisher, Serge Gratton, Selime Gürol, Yannick Trémolet, Xavier Vasseur:
  Low rank updates in preconditioning the saddle point systems arising from data assimilation problems. 45-69
• 
  Florian Jarre, Felix Lieder:
  The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction. 70-91
• 
  Fredrik Magnusson, Johan Åkesson:
  Symbolic elimination in dynamic optimization based on block-triangular ordering. 92-119
• 
  Simone Göttlich, Claus Teuber:
  Space mapping techniques for the optimal inflow control of transmission lines. 120-139
• 
  Yu Malitsky:
  Proximal extrapolated gradient methods for variational inequalities. 140-164
• 
  Steven Diamond, Reza Takapoui, Stephen P. Boyd:
  A general system for heuristic minimization of convex functions over non-convex sets. 165-193
• 
  Adil M. Bagirov, Julien Ugon:
  Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms. 194-219

Volume 33, Number 2, 2018

Original Articles

• 
  George Kozanidis:
  Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft. 221-248
• 
  Frank Pörner:
  A priori stopping rule for an iterative Bregman method for optimal control problems. 249-267
• 
  Martin Eigel, Kevin Sturm:
  Reproducing kernel Hilbert spaces and variable metric algorithms in PDE-constrained shape optimization. 268-296
• 
  Eunice Blanchard, Ryan C. Loxton, Volker Rehbock:
  Dynamic optimization of dual-mode hybrid systems with state-dependent switching conditions. 297-310
• 
  Asawathep Cuntavepanit, Withun Phuengrattana:
  On solving the minimization problem and the fixed-point problem for a finite family of non-expansive mappings in CAT(0) spaces. 311-321
• 
  Jean-Pierre Dussault:
  ARCq: a new adaptive regularization by cubics. 322-335
• 
  Min Li:
  A modified Hestense-Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method. 336-353
• 
  Alessandro Galligari, Marco Sciandrone:
  A convergent and fast path equilibration algorithm for the traffic assignment problem. 354-371
• 
  Rachael Tappenden, Martin Takác, Peter Richtárik:
  On the complexity of parallel coordinate descent. 372-395
• 
  Tianyi Chen, Frank E. Curtis, Daniel P. Robinson:
  FaRSA for ℓ1-regularized convex optimization: local convergence and numerical experience. 396-415

Book review

• 
  Yaroslav D. Sergeyev:
  Non-convex multi-objective optimization. 416-417

Volume 33, Number 3, 2018

Mathematical Optimization at the 5th International Conference ON Mathematical Software, 11-14 July 2016, Berlin, Germany
Preface

• 
  Ambros M. Gleixner, Christian Kirches, John Mitchell, Theodore K. Ralphs:
  Preface. 419

Original Articles

• 
  Felix Lenders, Christian Kirches, Andreas Potschka:
  trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem. 420-449
• 
  Hans Georg Bock, Christian Kirches, Andreas Meyer, Andreas Potschka:
  Numerical solution of optimal control problems with explicit and implicit switches. 450-474
• 
  Chun Yu Hong, Matthias Köppe, Yuan Zhou:
  Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case. 475-498
• 
  Timo Berthold, Gregor Hendel, Thorsten Koch:
  From feasibility to improvement to proof: three phases of solving mixed-integer programs. 499-517
• 
  Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard:
  Parallelization of the FICO Xpress-Optimizer. 518-529
• 
  Yuji Shinano, Timo Berthold, Stefan Heinz:
  ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers. 530-539
• 
  Mustafa R. Kilinç, Nikolaos V. Sahinidis:
  Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON. 540-562
• 
  Stefan Vigerske, Ambros M. Gleixner:
  SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. 563-593
• 
  Tristan Gally, Marc E. Pfetsch, Stefan Ulbrich:
  A framework for solving mixed-integer semidefinite programs. 594-632
• 
  Keiji Kimura, Hayato Waki:
  Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program. 633-649
• 
  Luigi Di Puglia Pugliese, Manlio Gaudioso, Francesca Guerriero, Giovanna Miglionico:
  A Lagrangean-based decomposition approach for the link constrained Steiner tree problem. 650-670

Volume 33, Numbers 4-6, 2018

SPECIAL ISSUE: Advances in Algorithmic Differentiation. Prefaces

• 
  Bruce Christianson, Shaun A. Forth, Andreas Griewank:
  Preface. 671

Generic Applications of Algorithmic Differentiation

• 
  Jan Christian Hückelheim, Paul D. Hovland, Michelle Mills Strout, Jens-Dominik Müller:
  Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation. 672-693
• 
  Lisa Kusch, Tim Albring, Andrea Walther, Nicolas R. Gauger:
  A one-shot optimization framework with additional equality constraints applied to multi-objective aerodynamic shape optimization. 694-707
• 
  Yingyi Li, Haibin Zhang, Zhibao Li, Huan Gao:
  Proximal gradient method with automatic selection of the parameter by automatic differentiation. 708-717
• 
  Olivier Mullier, Alexandre Chapoutot, Julien Alexandre Dit Sandretto:
  Validated computation of the local truncation error of Runge-Kutta methods with automatic differentiation. 718-728
• 
  John D. Pryce, Nedialko S. Nedialkov, Guangning Tan, Xiao Li:
  How AD can help solve differential-algebraic equations. 729-749
• 
  Ulrich Römer, Mahesh Narayanamurthi, Adrian Sandu:
  Solving parameter estimation problems with discrete adjoint exponential integrators. 750-770
• 
  Siegfried M. Rump:
  Mathematically rigorous global optimization in floating-point arithmetic. 771-798
• 
  Mu Wang, Guang Lin, Alex Pothen:
  Using automatic differentiation for compressive sensing in uncertainty quantification. 799-812

Practical Applications of Algorithmic Differentiation

• 
  Mladen Banovic, Orest Mykhaskiv, Salvatore Auriemma, Andrea Walther, Herve Legrand, Jens-Dominik Müller:
  Algorithmic differentiation of the Open CASCADE Technology CAD kernel and its coupling with an adjoint CFD solver. 813-828
• 
  Laurent Hascoët, Mathieu Morlighem:
  Source-to-source adjoint Algorithmic Differentiation of an ice sheet model written in C. 829-843
• 
  Alexander Hück, Christian H. Bischof, Max Sagebaum, Nicolas R. Gauger, Benjamin Jurgelucks, Eric Y. Larour, Gilberto Perez:
  A usability case study of algorithmic differentiation tools on the ISSM ice sheet model. 844-867
• 
  Benjamin Jurgelucks, Leander Claes, Andrea Walther, Bernd Henning:
  Optimization of triple-ring electrodes on piezoceramic transducers using algorithmic differentiation. 868-888
• 
  Filip Srajer, Zuzana Kukelova, Andrew W. Fitzgibbon:
  A benchmark of selected algorithmic differentiation tools on some problems in computer vision and machine learning. 889-906

Higher Order and Implicit Differentiation

• 
  Bradley M. Bell, Kasper Kristensen:
  Newton step methods for AD of an objective defined using implicit functions. 907-923
• 
  H. Martin Bücker, Johannes Willkomm:
  Estimating the expansion coefficients of a geomagnetic field model using first-order derivatives of associated Legendre functions. 924-944
• 
  Isabelle Charpentier, Bruno Cochelin:
  Towards a full higher order AD-based continuation and bifurcation framework. 945-962
• 
  Isabelle Charpentier, Jens Gustedt:
  Arbogast: Higher order automatic differentiation for special functions with Modular C. 963-987
• 
  Bruce Christianson:
  Differentiating through conjugate gradient. 988-994
• 
  Richard D. Neidinger, Benjamin Altman:
  Comparing high-order multivariate AD methods. 995-1009
• 
  Cosmin G. Petra, Feng Qiang, Miles Lubin, Joey Huchette:
  On efficient Hessian computation using the edge pushing algorithm in Julia. 1010-1029

Piecewise Differentiation of Nonsmooth Functions

• 
  Paul I. Barton, Kamil A. Khan, Peter Stechlinski, Harry A. J. Watson:
  Computationally relevant generalized derivatives: theory, evaluation and applications. 1030-1072
• 
  Sabrina Fiege, Andrea Walther, Kshitij Kulshreshtha, Andreas Griewank:
  Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization. 1073-1088
• 
  Andreas Griewank, Richard Hasenfelder, Manuel Radons, Lutz Lehmann, Tom Streubel:
  Integrating Lipschitzian dynamical systems using piecewise algorithmic differentiation. 1089-1107
• 
  Andreas Griewank, Tom Streubel, Lutz Lehmann, Manuel Radons, Richard Hasenfelder:
  Piecewise linear secant approximation via algorithmic piecewise differentiation. 1108-1126
• 
  Kamil A. Khan:
  Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions. 1127-1155
• 
  Koichi Kubota:
  Enumeration of subdifferentials of piecewise linear functions with abs-normal form. 1156-1172

Development of Software Tools

• 
  Kshitij Kulshreshtha, Sri Hari Krishna Narayanan, Julie Bessac, K. Macintyre:
  Efficient computation of derivatives for solving optimization problems in R and Python using SWIG-generated interfaces to ADOL-C. 1173-1191
• 
  Valérie Pascual, Laurent Hascoët:
  Mixed-language automatic differentiation. 1192-1206
• 
  Max Sagebaum, Tim Albring, Nicolas R. Gauger:
  Expression templates for primal value taping in the reverse mode of algorithmic differentiation. 1207-1231
• 
  Markus Towara, Uwe Naumann:
  SIMPLE adjoint message passing. 1232-1249

Complexity and Structure Exploitation

• 
  Shahadat Hossain, Nasrin Hakim Mithila:
  Pattern graph for sparse Hessian matrix determination. 1250-1263
• 
  Viktor Mosenkis, Uwe Naumann:
  On lower bounds for optimal Jacobian accumulation. 1264-1287
• 
  Jeffrey Mark Siskind, Barak A. Pearlmutter:
  Divide-and-conquer checkpointing for arbitrary programs with no user annotation. 1288-1330