Journal: Optimization Methods and Software

Volume 31, Issue 6

1111 -- 1131Alexey F. Izmailov, Mikhail V. Solodov. Some new facts about sequential quadratic programming methods employing second derivatives
1132 -- 1148Torsten Bosse. Augmenting the one-shot framework by additional constraints
1149 -- 1168Lino A. Costa, Isabel A. Espírito-Santo, Pedro Oliveira. Benchmarking deterministic optimization algorithms using an outranking approach
1169 -- 1188Siyang Gao, Robert R. Meyer, Warren D. D'Souza, Leyuan Shi, Hao Howard Zhang. A machine learning-based nested partitions framework for angle selection in radiotherapy
1189 -- 1208Touraj Nikazad, Mokhtar Abbasi, M. Mirzapour. Convergence of string-averaging method for a class of operators
1209 -- 1238José Yunier Bello Cruz, Tran T. A. Nghia. On the convergence of the forward-backward splitting method with linesearches
1239 -- 0Fei Liu, Ryan Loxton, Takashi Tsuchiya. Preface
1240 -- 1257Chun-Rong Chen, Xin Zuo, Fang Lu, Sheng-Jie Li. Vector equilibrium problems under improvement sets and linear scalarization with stability applications
1258 -- 1271Sharareh Enshaei, Wah June Leong, Mahboubeh Farid. Diagonal quasi-Newton method via variational principle under generalized Frobenius norm
1272 -- 1297Shunsuke Hayashi, Takayuki Okuno, Yoshihiko Ito. Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
1298 -- 1304S. Mizuno. The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
1305 -- 1324Takayuki Okuno, Shunsuke Hayashi, Nobuo Yamashita, Kensuke Gomoto. An exchange method with refined subproblems for convex semi-infinite programming problems

Volume 31, Issue 5

829 -- 857Zheng Qu, Peter Richtárik. Coordinate descent with arbitrary sampling I: algorithms and complexity
858 -- 884Zheng Qu, Peter Richtárik. Coordinate descent with arbitrary sampling II: expected separable overapproximation
885 -- 903Laurent Hascoët, Jean Utke. Programming language features, usage patterns, and the efficiency of generated adjoint code
904 -- 930Andreas Griewank, Andrea Walther. First- and second-order optimality conditions for piecewise smooth objective functions
931 -- 951Hideaki Iiduka. Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
952 -- 982Masaru Ito, Mituhiro Fukuda. A family of subgradient-based methods for convex optimization problems in a unifying framework
983 -- 1007Elias Salomão Helou, Sandra A. Santos, Lucas E. A. Simões. On the differentiability check in gradient sampling methods
1008 -- 1035Tommaso Bianconcini, Marco Sciandrone. A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
1036 -- 1063Axel Dreves, Nathan Sudermann-Merx. Solving linear generalized Nash equilibrium problems numerically
1064 -- 1088Michael C. Ferris, Yanchao Liu. Modelling demand response in organized wholesale energy markets
1089 -- 1109Yanqin Bai, Renli Liang, Zhouwang Yang. Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables

Volume 31, Issue 4

679 -- 680Duan Li 0002, Jie Sun, Kok Lay Teo. Dedicated to the memory of Professor Xiaoling Sun (1963-2014)
681 -- 700Qian Li, Yanqin Bai. Optimal trade-off portfolio selection between total risk and maximum relative marginal risk
701 -- 719Van-Bong Nguyen, Ruey-Lin Sheu, Yong Xia. An SDP approach for quadratic fractional problems with a two-sided quadratic constraint
720 -- 736Yong Xia, Duan Li 0002. Strong duality in optimization: shifted power reformulation
737 -- 754Tiantian Nie, Shu-Cherng Fang, Zhibin Deng, John E. Lavery. On linear conic relaxation of discrete quadratic programs
755 -- 774Xueting Cui, Shushang Zhu, Duan Li 0002, Jie Sun. Mean-variance portfolio optimization with parameter sensitivity control
775 -- 790Boshi Tian, Donghui Li, Xiaoqi Yang. An unconstrained differentiable penalty method for implicit complementarity problems
791 -- 804Xide Zhu, Gui-Hua Lin. Improved convergence results for a modified Levenberg-Marquardt method for nonlinear equations and applications in MPCC
805 -- 814Ruixue Zhao, Jinyan Fan. Global complexity bound of the Levenberg-Marquardt method
815 -- 828Yong Wang, Zheng-Hai Huang, Xue-Li Bai. Exceptionally regular tensors and tensor complementarity problems

Volume 31, Issue 3

445 -- 0Sirma Zeynep Alparslan Gök, Gerhard-Wilhelm Weber. Foreword
446 -- 470Derya Dinler, Mustafa Kemal Tural. A minisum location problem with regional demand considering farthest Euclidean distances
471 -- 478Mustafa Kemal Tural. Maximal matching polytope in trees
479 -- 493Asghar Asgharian-Sardroud, Alireza Bagheri. An approximation algorithm for the longest path problem in solid grid graphs
494 -- 510Andrea Walther, Nicolas R. Gauger, Lisa Kusch, Natalie Richert. On an extension of one-shot methods to incorporate additional constraints
511 -- 534Ph. R. Sampaio, Philippe L. Toint. Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
535 -- 561Marius Durea, Marian Pantiruc, Radu Strugariu. Minimal time function with respect to a set of directions: basic properties and applications
562 -- 576S. Ahmad Hosseini, Eddie Wadbro. A feasibility evaluation approach for time-evolving multi-item production-distribution networks
577 -- 590Yunlong Cheng, Qiong Mou, Xianbing Pan, Shengwei Yao. A sufficient descent conjugate gradient method and its global convergence
591 -- 604Geovani N. Grapiglia, Jin Yun Yuan, Ya-Xiang Yuan. On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
605 -- 621N. Keskar, Jorge Nocedal, Figen Öztoprak, Andreas Wächter. 1-regularized optimization with active-set prediction
622 -- 644Michal Kocvara, Sudaba Mohammed. A first-order multigrid method for bound-constrained convex optimization
645 -- 678Ion Necoara, Andrei Patrascu. Iteration complexity analysis of dual first-order methods for conic convex programming

Volume 31, Issue 2

233 -- 257Soodabeh Asadi, H. Mansouri, Zs. Darvay, Maryam Zangiabadi. *(κ) horizontal linear complementarity problems over Cartesian product of symmetric cones
258 -- 271Fengmin Xu, Zhaosong Lu, ZongBen Xu. An efficient optimization approach for a cardinality-constrained index tracking problem
272 -- 289Elham Mardaneh, Qun Lin, Ryan C. Loxton. A heuristic algorithm for optimal fleet composition with vehicle routing considerations
290 -- 304Bader Al-Shamary, S. K. Mishra, Vivek Laha. On approximate starshapedness in multiobjective optimization
305 -- 327Maria Teresa Vespucci, Marida Bertocchi, Paolo Pisciella, Stefano Zigrino. Two-stage stochastic mixed integer optimization models for power generation capacity expansion with risk measures
328 -- 341Douglas S. Gonçalves, Márcia A. Gomes-Ruggiero, Carlile Lavor. A projected gradient method for optimization over density matrices
342 -- 358Y.-M. Jung, S. Yun. A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
359 -- 376F. Hooshmand, S. A. MirHassani. Efficient constraint reduction in multistage stochastic programming problems with endogenous uncertainty
377 -- 391Aaditya Ramdas, Javier Peña. Towards a deeper geometric, analytic and algorithmic understanding of margins
392 -- 404Krzysztof Michalak. Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems
405 -- 434Jan Heller, Tomás Pajdla. GpoSolver: a Matlab/C++ toolbox for global polynomial optimization
435 -- 443Csaba Mészáros. Exploiting hardware capabilities in interior point methods

Volume 31, Issue 1

1 -- 23Yavdat Il'yasov, Aleksandr Ivanov. Computation of maximal turning points to nonlinear equations by nonsmooth optimization
24 -- 52Luís M. Fernandes, Masao Fukushima, Joaquim João Júdice, Hanif D. Sherali. The second-order cone eigenvalue complementarity problem
53 -- 67Olga Perederieieva, Matthias Ehrgott, Andrea Raith, Judith Y. T. Wang. Numerical stability of path-based algorithms for traffic assignment
68 -- 87Qiulian Chen, Yaodong Cui, Yan Chen. Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
88 -- 109Jordi Castro. Interior-point solver for convex separable block-angular problems
110 -- 133Shubhangi G. Deshpande, Layne T. Watson, Robert A. Canfield. Multiobjective optimization using an adaptive weighting scheme
134 -- 156Masakazu Muramatsu, Hayato Waki, Levent Tunçel. Perturbed sums-of-squares theorem for polynomial optimization and its applications
157 -- 186Frank E. Curtis, Nicholas I. M. Gould, Hao Jiang, Daniel P. Robinson. Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
187 -- 203Le Hong Trang, Attila Kozma, Phan Thanh An, Moritz Diehl. A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
204 -- 231Nadia Smairi, Patrick Siarry, Khaled Ghédira. A hybrid particle swarm approach based on Tribes and tabu search for multi-objective optimization