Journal: Optimization Methods and Software

Volume 32, Issue 6

1163 -- 1186E. Alper Yildirim. Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
1187 -- 1205Guanglin Xu, Samuel Burer. Robust sensitivity analysis of the optimal value of linear programming
1206 -- 1217Hasan Bulut. Multiloop transportation simplex algorithm
1218 -- 1243O. I. Kostyukova, T. V. Tchemisova, M. A. Kurdina. A study of one class of NLP problems arising in parametric semi-infinite programming
1244 -- 1272O. Kolossoski, Renato D. C. Monteiro. An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
1273 -- 1298Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint. Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
1299 -- 1312Ahmad Alhawarat, Zabidin Salleh, Mustafa Mamat, Mohd Rivaie. An efficient modified Polak-Ribière-Polyak conjugate gradient method with global convergence properties
1313 -- 1329Hiroshi Kobayashi, Yasushi Narushima, Hiroshi Yabe. Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization

Volume 32, Issue 5

993 -- 1005Jakub Konecný, Zheng Qu, Peter Richtárik. Semi-stochastic coordinate descent
1006 -- 1032V. Guigues, René Henrion. Joint dynamic probabilistic constraints with projected linear decision rules
1033 -- 1058Vincent Guigues, Anatoli Juditsky, Arkadi Nemirovski. Non-asymptotic confidence bounds for the optimal value of a stochastic program
1078 -- 1094Yong Hsia, Ruey-Lin Sheu, Ya-Xiang Yuan. Theory and application of p-regularized subproblems for p>2
1095 -- 1112Masoud Fatemi. A scaled conjugate gradient method for nonlinear unconstrained optimization
1113 -- 1131Xiaokai Chang, Sanyang Liu. A feasible method for sensor network localization
1132 -- 1161Lars Lubkoll, Anton Schiela, Martin Weiser. An affine covariant composite step method for optimization with PDEs as equality constraints

Volume 32, Issue 4

669 -- 0Panos Parpas, Berç Rustem, Wolfram Wiesemann. Guest Editorial
670 -- 698Sebastian Albrecht, Michael Ulbrich. Mathematical programs with complementarity constraints in the context of inverse optimal control for locomotion
699 -- 718Halil Bayrak, Kemal Güler, Mustafa Ç. Pinar. Optimal allocation with costly inspection and discrete types under ambiguity
719 -- 737Pedro M. Castro. Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation
738 -- 753Anulekha Dhara, Karthik Natarajan. On the polynomial solvability of distributionally robust k-sum optimization
754 -- 769Sören Geffken, Christof Büskens. Feasibility refinement in sequential quadratic programming using parametric sensitivity analysis
770 -- 789Shaoyan Guo, Huifu Xu, Liwei Zhang. Probability approximation schemes for stochastic programs with distributionally robust second-order dominance constraints
790 -- 812D. Kraft. Self-consistent gradient flow for shape optimization
813 -- 848Chenxin Ma, Jakub Konecný, Martin Jaggi, Virginia Smith, Michael I. Jordan, Peter Richtárik, Martin Takác. Distributed optimization with arbitrary local solvers
849 -- 871Jakub Marecek, Martin Takác. A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
872 -- 891Dimitrios Nerantzis, Claire S. Adjiman. An interval-matrix branch-and-bound algorithm for bounding eigenvalues
892 -- 903Viet Hung Nguyen, Michel Minoux. Improved linearized models for graph partitioning problem under capacity constraints
904 -- 939Sebastian Pfaff, Stefan Ulbrich. Optimal control of scalar conservation laws by on/off-switching
940 -- 962Radoslaw Pytlak, Damian Suski. On solving hybrid optimal control problems with higher index DAEs
963 -- 992Anthony Man-Cho So, Zirui Zhou. Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity

Volume 32, Issue 3

401 -- 435Sina Khoshfetrat Pakazad, Anders Hansson, Martin S. Andersen, Isak Nielsen. Distributed primal-dual interior-point methods for solving tree-structured coupled convex problems using message-passing
436 -- 454Ondrej Santin, Marta Jarosová, Vladimir Havlena, Zdenek Dostál. Proportioning with second-order information for model predictive control
455 -- 469George Kolomvos, Georgios K. D. Saharidis. Accelerating techniques on nested decomposition
470 -- 502F. Q. Xia, Q. H. Ansari, J. C. Yao. A new incremental constraint projection method for solving monotone variational inequalities
503 -- 515Jinbao Jian, Qian Chen, Xianzhen Jiang, You-Fang Zeng, Jianghua Yin. A new spectral conjugate gradient method for large-scale unconstrained optimization
516 -- 533Liang Chen, Cuizhen Du, Yanfang Ma. The higher-order Levenberg-Marquardt method with Armijo type line search for nonlinear equations
534 -- 551Neculai Andrei. Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
552 -- 580Rommel G. Regis, Stefan M. Wild. CONORBIT: constrained optimization by radial basis function interpolation in trust regions
581 -- 593Minghai Yuan, Kun Deng, W. Art Chaovalitwongse, Shuo Cheng. Multi-objective optimal scheduling of reconfigurable assembly line for cloud manufacturing
594 -- 624Guillaume Aupy, Julien Herrmann. Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
625 -- 649Xuehao Feng, Yuna Lee, Ilkyeong Moon. An integer program and a hybrid genetic algorithm for the university timetabling problem
650 -- 668Lei Zhu, Bo Yu, Liyan Xu. The distributionally robust complementarity problem

Volume 32, Issue 2

221 -- 0Panos M. Pardalos, Valeriy A. Kalyagin. Preface
222 -- 236Konstantin Avrachenkov, Pavel Yu. Chebotarev, Alexey Mishenin. Semi-supervised learning with regularized Laplacian
237 -- 249Robin C. Gilbert, Theodore B. Trafalis, Michael B. Richman, Lance M. Leslie. A data-driven kernel method assimilation technique for geophysical modelling
250 -- 273Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao. Robustness of solutions to critical node detection problems with imperfect data: a computational study
274 -- 289Anna Pirova, Iosif Meyerov, Evgeniy Kozinov, Sergey Lebedev. PMORSy: parallel sparse matrix ordering software for fill-in minimization
290 -- 311Mohammadreza Samadi, Alexander G. Nikolaev, Rakesh Nagi. The temporal aspects of the evidence-based influence maximization on social networks
312 -- 335Pablo San Segundo, Jorge Artieda, Mikhail Batsyn, Panos M. Pardalos. An enhanced bitstring encoding for exact maximum clique search in sparse graphs
336 -- 368Vladimir Stozhkov, Grigory Pastukhov, Vladimir Boginski, Eduardo L. Pasiliao. New analytical lower bounds on the clique number of a graph
369 -- 399Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao. Finding groups with maximum betweenness centrality

Volume 32, Issue 1

1 -- 21Paul Armand, Riadh Omheni. A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization
22 -- 38Roberto Andreani, Roger Behling, Gabriel Haeser, Paulo J. S. Silva. On second-order optimality conditions in nonlinear optimization
39 -- 68Kai Wang, Jitamitra Desai, Hongjin He. A proximal partially parallel splitting method for separable convex programs
69 -- 85Zhichuan Zhu, Bo Yu. Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
86 -- 108Miguel Cea. Optimal design for 2D wave equations
109 -- 125Michael Orlitzky. The Lyapunov rank of an improper cone
126 -- 147Yue Teng, Li Yang, Bo Yu, Xiaoliang Song. A penalty PALM method for sparse portfolio selection problems
148 -- 181Frank E. Curtis, Tim Mitchell, Michael L. Overton. A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
182 -- 192Raweerote Suparatulatorn, Prasit Cholamjiak, Suthep Suantai. On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces
193 -- 219A. Dehghani, J.-L. Goffin, Dominique Orban. A primal-dual regularized interior-point method for semidefinite programming