Journal: Optimization Methods and Software

Volume 36, Issue 6

1097 -- 1098Oleg Khamisov, Anton Eremeev, Vladimir Ushakov. Preface to the special issue
1099 -- 1127Ovanes L. Petrosian, Anna Tur, Zeyang Wang, Hongwei Gao. Cooperative differential games with continuous updating using Hamilton-Jacobi-Bellman equation
1128 -- 1154Yaroslav V. Salii, Andrey S. Sheka. Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
1155 -- 1201Fedor S. Stonyakin, Alexander Tyurin, Alexander V. Gasnikov, Pavel E. Dvurechensky, Artem Agafonov, Darina Dvinskikh, Mohammad S. Alkousa, Dmitry Pasechnyuk, Sergei Artamonov, Victoria V. Piskunova. Inexact model: a framework for optimization and variational inequalities
1202 -- 1222Olivier Fercoq. A generic coordinate descent solver for non-smooth convex optimisation
1223 -- 1258Christian Kanzow, Patrick Mehlitz, Daniel Steck. Relaxation schemes for mathematical programmes with switching constraints
1259 -- 1288Veronika Karl, Frank Pörner. On the uniqueness of non-reducible multi-player control problems
1289 -- 1316Dmitry Kamzolov, Pavel E. Dvurechensky, Alexander V. Gasnikov. Universal intermediate gradient method for convex problems with inexact oracle

Volume 36, Issue 5

891 -- 908G. Battulga, L. Altangerel, G. Battur. Loan interest rate Nash models with solvency constraints in the banking sector
909 -- 933Torsten Falko Bosse, Sri Hari Krishna Narayanan. Study of the numerical efficiency of structured abs-normal forms
934 -- 951Javier Peña 0001, Negar Soheili. Computational performance of a projection and rescaling algorithm
952 -- 972Victor Gergel, Alexey Goryachih. Multidimensional global optimization using numerical estimates of objective function derivatives
973 -- 997Parvin Nazari, Esmaile Khorram, Davoud Ataee Tarzanagh. Adaptive online distributed optimization in dynamic environments
998 -- 1029Branislav Ivanov, Predrag S. Stanimirovic, Gradimir V. Milovanovic, Snezana Djordjevic, Ivona Brajevic. Accelerated multiple step-size methods for solving unconstrained optimization problems
1030 -- 1058Pedro Hespanhol, Rien Quirynen. Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control
1059 -- 1081Mostafa Rezapour, Thomas J. Asaki. Adaptive trust-region algorithms for unconstrained optimization
1082 -- 1095Sergey I. Bastrakov, Andrey Churkin, Nikolai Yu. Zolotykh. Accelerating Fourier-Motzkin elimination using bit pattern trees

Volume 36, Issue 4

671 -- 0Milojica Jacimovic, Mikhail Yu. Khachay, Yury Kochetov 0001, Mikhail Posypkin. Preface
672 -- 696Oleg Zaikin 0002, Stepan Kochemazov. On black-box optimization in divide-and-conquer SAT solving
697 -- 719Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy. GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN
720 -- 754Anastasiya Ivanova, Pavel E. Dvurechensky, Alexander V. Gasnikov, Dmitry Kamzolov. Composite optimization for the resource allocation problem
755 -- 772Van-Huy Pham 0001, Kien Trung Nguyen, Tran Thu Le. Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance
773 -- 810Yurii E. Nesterov, Alexander V. Gasnikov, Sergey Guminov, Pavel E. Dvurechensky. Primal-dual accelerated gradient methods with small-dimensional relaxation oracle
811 -- 820Olga Brezhneva, Yuri G. Evtushenko, Alexey Tret'yakov. New perspective on some classical results in analysis and optimization
821 -- 841Ilya Chernykh, Ekaterina Lgotina. Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
842 -- 868Valentin R. Koch, Hung M. Phan. Optimization of triangular networks with spatial constraints
869 -- 890David W. Juedes, Jeffrey Jones. A generic framework for approximation analysis of greedy algorithms for star bicoloring

Volume 36, Issue 2-3

259 -- 261Takashi Tsuchiya, Kokichi Sugihara. Preface
262 -- 278Kazutoshi Ando, Satoru Fujishige. Signed ring families and signed posets
279 -- 300David Avis, Charles Jordan. mts: a light framework for parallelizing tree search codes
301 -- 315Andreas Griewank, Tom Streubel, Caren Tischendorf. On the abs-polynomial expansion of piecewise smooth functions
316 -- 325Yuya Higashikawa, Keiko Imai, Takeharu Shiraga, Noriyoshi Sukegawa, Yusuke Yokosuka. Minimum point-overlap labelling
326 -- 331Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi. Extended formulations of lower-truncated transversal polymatroids
332 -- 336Satoru Iwata 0001. A Pfaffian formula for matching polynomials of outerplanar graphs
337 -- 370Joaquim João Júdice, Masao Fukushima, Alfredo N. Iusem, José Mario Martínez, Valentina Sessa. An alternating direction method of multipliers for the eigenvalue complementarity problem
371 -- 388Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh. A Newton-bracketing method for a simple conic optimization problem
389 -- 424Tianyi Lin, Shiqian Ma, Yinyu Ye, Shuzhong Zhang. An ADMM-based interior-point method for large-scale linear programming
425 -- 471Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya. Solving SDP completely with an interior point oracle
472 -- 518Kazuo Murota. A survey of fundamental operations on discrete convex functions of various kinds
519 -- 559Kazuo Murota. On basic operations related to network induction of discrete convex functions
560 -- 568András Recski. Applications of matroids in electric network theory
569 -- 601Hiroshi Yamashita, Hiroshi Yabe, Kouhei Harada. A primal-dual interior point trust-region method for nonlinear semidefinite programming
602 -- 626Weifeng Zhong, Qun Lin 0002, Ryan C. Loxton, Kok Lay Teo. Optimal train control via switched system dynamic optimization
627 -- 652Mehrdad Ghaznavi, Fereshteh Akbari, Esmaile Khorram. Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
653 -- 668Liping Tang, Xinmin Yang. A modified direction approach for proper efficiency of multiobjective optimization
669 -- 0. Correction

Volume 36, Issue 1

1 -- 19Yekini Shehu, Phan Tu Vuong, Alain B. Zemkoho. An inertial extrapolation method for convex simple bilevel optimization
20 -- 44Chenxin Ma, Martin Jaggi, Frank E. Curtis, Nathan Srebro, Martin Takác. An accelerated communication-efficient primal-dual optimization framework for structured machine learning
45 -- 81Alberto Ramos 0001. Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
82 -- 113Habib-ur Rehman, Poom Kumam, Yeol Je Cho, Yusuf I. Suleiman, Wiyada Kumam. Modified Popov's explicit iterative algorithms for solving pseudomonotone equilibrium problems
114 -- 144Nikolaus Hansen, Anne Auger, Raymond Ros, Olaf Mersmann, Tea Tusar, Dimo Brockhoff. COCO: a platform for comparing continuous optimizers in a black-box setting
145 -- 170Geovani Nunes Grapiglia, Yurii E. Nesterov. On inexact solution of auxiliary problems in tensor methods for convex optimization
171 -- 210César A. Uribe, Soomin Lee, Alexander V. Gasnikov, Angelia Nedic. A dual approach for optimal algorithms in distributed optimization over networks
211 -- 236Vincent Guigues. Multistage stochastic programs with a random number of stages: dynamic programming equations, solution methods, and application to portfolio selection
237 -- 258Lam M. Nguyen, Katya Scheinberg, Martin Takác. Inexact SARAH algorithm for stochastic optimization