Journal: Optimization Methods and Software

Volume 34, Issue 6

1123 -- 1144Gabriel Ruiz Garzón, Rafaela Osuna Gómez, Antonio Rufián-Lizana, Yurilev Chalco-Cano. The continuous-time problem with interval-valued functions: applications to economic equilibrium
1145 -- 1167Javad Koushki, Majid Soleimani-Damaneh. Anchor points in multiobjective optimization: definition, characterization and detection
1168 -- 1183Christian Chibueze Okeke, Chinedu Izuchukwu. A strong convergence theorem for monotone inclusion and minimization problems in complete CAT(0) spaces
1184 -- 1212Alfredo N. Iusem, Joaquim João Júdice, Valentina Sessa, Paula Sarabando. Splitting methods for the Eigenvalue Complementarity Problem
1213 -- 1230Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi Bonab. Optimal algorithms for selective variants of the classical and inverse median location problems on trees
1231 -- 1250Dimitris Souravlias, Ilias S. Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos. Parallel algorithm portfolios with performance forecasting
1251 -- 1276Yuan Shen, Hongyu Xu, Xin Liu. An alternating minimization method for robust principal component analysis
1277 -- 1305Wanyou Cheng, Qingjie Hu, Donghui Li. A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization
1306 -- 1321Stefanie Günther, Nicolas R. Gauger, Jacob B. Schroder. A non-intrusive parallel-in-time approach for simultaneous optimization with unsteady PDEs
1322 -- 1341Alfredo Canelas, Miguel Carrasco, Julio López 0001. A feasible direction algorithm for nonlinear second-order cone programs

Volume 34, Issue 5

921 -- 0. Foreword
922 -- 948Xiaoyu Wang, Xiao Wang, Ya-Xiang Yuan. Stochastic proximal quasi-Newton methods for non-convex composite optimization
949 -- 959Jörg Fliege, A. Ismael F. Vaz, Luís Nunes Vicente. Complexity of gradient descent for multiobjective optimization
960 -- 990Ali Mohammad Nezhad, Tamás Terlaky. Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
991 -- 1013Paul Armand, Ngoc Nguyen Tran. Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
1014 -- 1034Goran Lesaja, Florian A. Potra. Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
1035 -- 1055Andreas Griewank, Andrea Walther. Finite convergence of an active signature method to local minima of piecewise linear functions
1056 -- 1074Francesca Guerriero, Luigi Di Puglia Pugliese, Giusy Macrina. A rollout algorithm for the resource constrained elementary shortest path problem
1075 -- 1098Pavel Otta, Jirí Burant, Ondrej Santin, Vladimír Havlena. Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon
1099 -- 1122Francesco Bagattini, Fabio Schoen, Luca Tigli. Clustering methods for large scale geometrical global optimization

Volume 34, Issue 4

693 -- 706Narges Bidabadi. Using a spectral scaling structured BFGS method for constrained nonlinear least squares
707 -- 730Kai Tu, H. B. Zhang, F. Q. Xia. A new alternating projection-based prediction-correction method for structured variational inequalities
731 -- 757Hideaki Iiduka. Two stochastic optimization algorithms for convex optimization with fixed point constraints
758 -- 769Xin Zhao, Jinyan Fan. A semidefinite method for tensor complementarity problems
770 -- 782Keyvan Amini, Parvaneh Faramarzi, Nasrin Pirfalah. A modified Hestenes-Stiefel conjugate gradient method with an optimal property
783 -- 796Zahra Khoshgam, Ali Ashrafi. A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function
797 -- 826Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri. Longest (s, t)-paths in L-shaped grid graphs
827 -- 852M. A. Diniz-Ehrhardt, D. G. Ferreira, Sandra A. Santos. A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
853 -- 874Suthep Suantai, Yekini Shehu, Prasit Cholamjiak. Nonlinear iterative methods for solving the split common null point problem in Banach spaces
875 -- 889Francisco J. Aragón Artacho, Yair Censor, Aviv Gibali. The cyclic Douglas-Rachford algorithm with r-sets-Douglas-Rachford operators
890 -- 920Wim van Ackooij, Welington de Oliveira. Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies

Volume 34, Issue 3

459 -- 461Oleg Khamisov, Gerhard-Wilhelm Weber. Advances in optimization theory and applications (Baikal 2017, ICCESEN 2016 and 2017)
462 -- 488Adil M. Bagirov, Gurkan Ozturk, Refail Kasimbeyli. A sharp augmented Lagrangian-based method in constrained non-convex optimization
489 -- 514Radu Ioan Bot, Ernö Robert Csetnek, Dennis Meier. Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces
515 -- 545Karima Boufi, Ahmed Roubi. Prox-regularization of the dual method of centers for generalized fractional programs
546 -- 559Xiao-Liang Dong, Zexian Liu, Hong-wei Liu, Xiang-Li Li. An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
560 -- 577Sergey Guminov, Alexander Gasnikov, Anton Anikin, Alexander Gornov. A universal modification of the linear coupling method
578 -- 585S. I. Kolesnikova. A multiple-control system for nonlinear discrete object under uncertainty
586 -- 611Erik Kropat, Silja Meyer-Nieberg, Gerhard-Wilhelm Weber. Computational networks and systems - homogenization of variational problems on micro-architectured networks and devices
612 -- 633Qian Li, Yanqin Bai, Xin Yan, Wei Zhang. Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm
634 -- 649María de los Ángeles Martínez, Damián R. Fernández. A quasi-Newton modified LP-Newton method
650 -- 664M. Momeni, M. R. Peyghami. A new conjugate gradient algorithm with cubic Barzilai-Borwein stepsize for unconstrained optimization
665 -- 692R. M. Oliveira, Elias S. Helou, Eduardo F. Costa. String-averaging incremental stochastic subgradient algorithms

Volume 34, Issue 2

225 -- 247Luc Pronzato. On the elimination of inessential points in the smallest enclosing ball problem
248 -- 263Pachara Jailoka, Suthep Suantai. Split common fixed point and null point problems for demicontractive operators in Hilbert spaces
264 -- 277Saeed Rezaee, Saman Babaie-Kafaki. An adaptive nonmonotone trust region algorithm
278 -- 304Kai Wang, Jitamitra Desai. On the convergence rate of the augmented Lagrangian-based parallel splitting method
305 -- 335Ion Necoara, Andrei Patrascu, François Glineur. Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
336 -- 362Soodabeh Asadi, Hossein Mansouri, Zsolt Darvay, Goran Lesaja, Maryam Zangiabadi. A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization
363 -- 382Napsu Karmitsa, Manlio Gaudioso, Kaisa Joki. Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
383 -- 405Franck Iutzeler, Julien M. Hendrickx. A generic online acceleration scheme for optimization algorithms via relaxation and inertia
406 -- 436Veronika Grimm, Thomas Kleinert, Frauke Liers, Martin Schmidt 0003, Gregor Zöttl. Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
437 -- 457Harry Oviedo, Hugo Lara, Oscar Dalmau. A non-monotone linear search algorithm with mixed direction on Stiefel manifold

Volume 34, Issue 1

1 -- 24W. Zhou, I. G. Akrotirianakis, S. Yektamaram, J. D. Griffin. A matrix-free line-search algorithm for nonconvex optimization
25 -- 36Fatemeh Abdi, Fatemeh Shakeri. A globally convergent BFGS method for pseudo-monotone variational inequality problems
37 -- 61Jordi Castro, José A. González 0002. A linear optimization-based method for data privacy in statistical tabular data
62 -- 78Didier Henrion, Simone Naldi, Mohab Safey El Din. SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic
79 -- 97Giampaolo Liuzzi, M. Locatelli, Veronica Piccialli. A new branch-and-bound algorithm for standard quadratic programming problems
98 -- 114Sourour Elloumi, Amélie Lambert. Global solution of non-convex quadratically constrained quadratic programs
115 -- 138Lijian Chen. A polynomial approximation-based approach for chance-constrained optimization
139 -- 149Jie Fan, Guoqing Wang. Improved algorithms for dynamic lot sizing problems with incremental discount
150 -- 171Nitish Shirish Keskar, Andreas Wächter. A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
172 -- 193Amir Beck, Nili Guttmann-Beck. FOM - a MATLAB toolbox of first-order methods for solving convex optimization problems
194 -- 217Wenbo Gao, Donald Goldfarb. Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions
218 -- 219J. W. Gillard. Deterministic global optimization: an introduction to the diagonal approach
220 -- 223Ignacio E. Grossmann. Optimization and management in manufacturing engineering: resource collaborative optimization and management through the internet of things