## Content

### September 2018, Volume 71, Issue 1

**1-3 Introduction to the special issue for SIMAI 2016***by*Valeria Ruggiero & Gerardo Toraldo**5-52 A block coordinate variable metric linesearch based proximal gradient method***by*S. Bonettini & M. Prato & S. Rebegoldi**53-72 A multi-objective DIRECT algorithm for ship hull optimization***by*E. F. Campana & M. Diez & G. Liuzzi & S. Lucidi & R. Pellegrini & V. Piccialli & F. Rinaldi & A. Serani**73-93 Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming***by*Renato De Leone & Giovanni Fasano & Yaroslav D. Sergeyev**95-113 Modified Fejér sequences and applications***by*Junhong Lin & Lorenzo Rosasco & Silvia Villa & Ding-Xuan Zhou**115-145 Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training***by*Andrea Manno & Laura Palagi & Simone Sagratella**147-170 Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications***by*Leopoldo Marini & Benedetta Morini & Margherita Porcelli**171-191 Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm***by*E. Loli Piccolomini & V. L. Coli & E. Morotti & L. Zanni**193-219 Algorithms for positive semidefinite factorization***by*Arnaud Vandaele & François Glineur & Nicolas Gillis**221-250 A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization***by*Norikazu Takahashi & Jiro Katayama & Masato Seki & Jun’ichi Takeuchi**251-271 An effective adaptive trust region algorithm for nonsmooth minimization***by*Zhou Sheng & Gonglin Yuan**273-306 A non-overlapping DDM combined with the characteristic method for optimal control problems governed by convection–diffusion equations***by*Tongjun Sun & Keying Ma

### July 2018, Volume 70, Issue 3

**641-675 Combinatorial optimal control of semilinear elliptic PDEs***by*Christoph Buchheim & Renke Kuhlmann & Christian Meyer**677-707 Optimal control of a class of reaction–diffusion systems***by*Eduardo Casas & Christopher Ryll & Fredi Tröltzsch**709-736 Proximal algorithms and temporal difference methods for solving fixed point problems***by*Dimitri P. Bertsekas**737-762 A generalized projection-based scheme for solving convex constrained optimization problems***by*Aviv Gibali & Karl-Heinz Küfer & Daniel Reem & Philipp Süss**763-790 Complexity of the relaxed Peaceman–Rachford splitting method for the sum of two maximal strongly monotone operators***by*Renato D. C. Monteiro & Chee-Khian Sim**791-826 A class of ADMM-based algorithms for three-block separable convex programming***by*Bingsheng He & Xiaoming Yuan**827-839 The generalized proximal point algorithm with step size 2 is not necessarily convergent***by*Min Tao & Xiaoming Yuan**841-863 A convergent relaxation of the Douglas–Rachford algorithm***by*Nguyen Hieu Thao**865-888 On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems***by*Laureano F. Escudero & María Araceli Garín & Celeste Pizarro & Aitziber Unzueta**889-910 A multi-criteria approach to approximate solution of multiple-choice knapsack problem***by*Ewa M. Bednarczuk & Janusz Miroforidis & Przemysław Pyzel

### June 2018, Volume 70, Issue 2

**321-350 Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems***by*Bethany L. Nicholson & Wei Wan & Shivakumar Kameswaran & Lorenz T. Biegler**351-394 A flexible coordinate descent method***by*Kimon Fountoulakis & Rachael Tappenden**395-418 A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis***by*Hao Jiang & Daniel P. Robinson & René Vidal & Chong You**419-441 Completely positive tensor recovery with minimal nuclear value***by*Anwa Zhou & Jinyan Fan**443-478 A primal-dual homotopy algorithm for $$\ell _{1}$$ ℓ 1 -minimization with $$\ell _{\infty }$$ ℓ ∞ -constraints***by*Christoph Brauer & Dirk A. Lorenz & Andreas M. Tillmann**479-502 Chance-constrained economic dispatch with renewable energy and storage***by*Jianqiang Cheng & Richard Li-Yang Chen & Habib N. Najm & Ali Pinar & Cosmin Safta & Jean-Paul Watson**503-530 Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization***by*Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz**531-569 Adaptive optimal control of Signorini’s problem***by*Andreas Rademacher & Korinna Rosin**571-592 Efficiently solving total least squares with Tikhonov identical regularization***by*Meijia Yang & Yong Xia & Jiulin Wang & Jiming Peng**593-613 A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions***by*Tasnuva Haque & Yves Lucet**615-639 A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms***by*Gabriel Haeser

### May 2018, Volume 70, Issue 1

**1-32 Real eigenvalues of nonsymmetric tensors***by*Jiawang Nie & Xinzhen Zhang**33-59 A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides***by*Guanglin Xu & Samuel Burer**61-90 Time-optimal velocity planning by a bound-tightening technique***by*Federico Cabassi & Luca Consolini & Marco Locatelli**91-128 Accelerated primal–dual proximal block coordinate updating methods for constrained convex optimization***by*Yangyang Xu & Shuzhong Zhang**129-170 Generalized symmetric ADMM for separable convex optimization***by*Jianchao Bai & Jicheng Li & Fengmin Xu & Hongchao Zhang**171-199 Two smooth support vector machines for $$\varepsilon $$ ε -insensitive regression***by*Weizhe Gu & Wei-Po Chen & Chun-Hsu Ko & Yuh-Jye Lee & Jein-Shan Chen**201-219 Iterative reweighted methods for $$\ell _1-\ell _p$$ ℓ 1 - ℓ p minimization***by*Xianchao Xiu & Lingchen Kong & Yan Li & Houduo Qi**221-238 On the convergence of the gradient projection method for convex optimal control problems with bang–bang solutions***by*J. Preininger & P. T. Vuong**239-266 Improved approximation rates for a parabolic control problem with an objective promoting directional sparsity***by*Eduardo Casas & Mariano Mateos & Arnd Rösch**267-294 MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems***by*Martin Gugat & Günter Leugering & Alexander Martin & Martin Schmidt & Mathias Sirvent & David Wintergerst**295-320 Tikhonov regularization of control-constrained optimal control problems***by*Nikolaus Daniels

### April 2018, Volume 69, Issue 3

**563-595 A two-stage stochastic programming approach for influence maximization in social networks***by*Hao-Hsiang Wu & Simge Küçükyavuz**597-627 Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates***by*Hiva Ghanbari & Katya Scheinberg**629-652 A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties***by*Leonardo Galli & Christian Kanzow & Marco Sciandrone**653-676 A two-level graph partitioning problem arising in mobile wireless communications***by*Jamie Fairbrother & Adam N. Letchford & Keith Briggs**677-712 Semidefinite programming approach for the quadratic assignment problem with a sparse graph***by*José F. S. Bravo Ferreira & Yuehaw Khoo & Amit Singer**713-752 Decomposition methods for the two-stage stochastic Steiner tree problem***by*Markus Leitner & Ivana Ljubić & Martin Luipersbeck & Markus Sinnl**753-800 A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation***by*Sara Mattia & Michael Poss**801-824 Augmented Lagrangian and exact penalty methods for quasi-variational inequalities***by*Christian Kanzow & Daniel Steck**825-856 Euler discretization for a class of nonlinear optimal control problems with control appearing linearly***by*Walter Alt & Ursula Felgenhauer & Martin Seydenschwanz**857-880 An augmented Lagrange method for elliptic state constrained optimal control problems***by*Veronika Karl & Daniel Wachsmuth

### March 2018, Volume 69, Issue 2

**267-296 An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints***by*G. Cocchi & G. Liuzzi & A. Papini & M. Sciandrone**297-324 A proximal difference-of-convex algorithm with extrapolation***by*Bo Wen & Xiaojun Chen & Ting Kei Pong**325-349 A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points***by*A. Fischer & M. Herrich & A. F. Izmailov & W. Scheck & M. V. Solodov**351-381 MINQ8: general definite and bound constrained indefinite quadratic programming***by*Waltraud Huyer & Arnold Neumaier**383-402 A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane***by*Siamak Yousefi & Xiao-Wen Chang & Henk Wymeersch & Benoit Champagne & Godfried Toussaint**403-422 Higher-order numerical scheme for linear quadratic problems with bang–bang controls***by*T. Scarinci & V. M. Veliov**423-459 A Fokker–Planck approach to control collective motion***by*Souvik Roy & Mario Annunziato & Alfio Borzì & Christian Klingenberg**461-500 An efficient duality-based approach for PDE-constrained sparse optimization***by*Xiaoliang Song & Bo Chen & Bo Yu**501-534 A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling***by*Gonzalo Muñoz & Daniel Espinoza & Marcos Goycoolea & Eduardo Moreno & Maurice Queyranne & Orlando Rivera Letelier**535-561 An efficient computational method for large scale surgery scheduling problems with chance constraints***by*Mahdi Noorizadegan & Abbas Seifi

### January 2018, Volume 69, Issue 1

**1-24 Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs***by*Lluís-Miquel Munguía & Shabbir Ahmed & David A. Bader & George L. Nemhauser & Yufen Shao**25-49 The geo-graph in practice: creating United States Congressional Districts from census blocks***by*D. M. King & S. H. Jacobson & E. C. Sewell**51-75 Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points***by*E. G. Birgin & G. Haeser & A. Ramos**77-97 An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization***by*Jianjun Liu & Xiangmin Xu & Xuehui Cui**99-132 A new projection method for finding the closest point in the intersection of convex sets***by*Francisco J. Aragón Artacho & Rubén Campoy**133-158 Copositive tensor detection and its applications in physics and hypergraphs***by*Haibin Chen & Zheng-Hai Huang & Liqun Qi**159-187 The min-cut and vertex separator problem***by*Fanz Rendl & Renata Sotirov**189-223 A multilevel bilinear programming algorithm for the vertex separator problem***by*William W. Hager & James T. Hungerford & Ilya Safro**225-241 On exact linesearch quasi-Newton methods for minimizing a quadratic function***by*Anders Forsgren & Tove Odland**243-266 Bounds for the solutions of absolute value equations***by*Milan Hladík

### December 2017, Volume 68, Issue 3

**479-502 Using negative curvature in solving nonlinear programs***by*Donald Goldfarb & Cun Mu & John Wright & Chaoxu Zhou**503-532 A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming***by*Chengjing Wang & Peipei Tang**533-554 On the use of the energy norm in trust-region and adaptive cubic regularization subproblems***by*E. Bergou & Y. Diouane & S. Gratton**555-577 On the worst-case evaluation complexity of non-monotone line search algorithms***by*Geovani N. Grapiglia & Ekkehard W. Sachs**579-618 Inexact proximal stochastic gradient method for convex composite optimization***by*Xiao Wang & Shuxiong Wang & Hongchao Zhang**619-642 $$\ell _p$$ ℓ p Regularized low-rank approximation via iterative reweighted singular value minimization***by*Zhaosong Lu & Yong Zhang & Jian Lu**643-660 Shrinking gradient descent algorithms for total variation regularized image denoising***by*Mingqiang Li & Congying Han & Ruxin Wang & Tiande Guo**661-669 An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions***by*André Berger & Alexander Grigoriev & Andrej Winokurow**671-687 MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys***by*Peter A. Graf & Stephen Billups**689-717 Algorithms for generalized potential games with mixed-integer variables***by*Simone Sagratella**719-747 Markov–Dubins path via optimal control theory***by*C. Yalçın Kaya**749-773 Decomposition methods based on articulation vertices for degree-dependent spanning tree problems***by*Mercedes Landete & Alfredo Marín & José Luis Sainz-Pardo**775-797 Variable neighborhood scatter search for the incremental graph drawing problem***by*Jesús Sánchez-Oro & Anna Martínez-Gavara & Manuel Laguna & Rafael Martí & Abraham Duarte

### November 2017, Volume 68, Issue 2

**193-208 An exact algorithm for a resource allocation problem in mobile wireless communications***by*Adam N. Letchford & Qiang Ni & Zhaoyu Zhong**209-242 An interior-point implementation developed and tuned for radiation therapy treatment planning***by*Sebastiaan Breedveld & Bas Berg & Ben Heijmen**243-287 On the control of time discretized dynamic contact problems***by*Georg Müller & Anton Schiela**289-315 Mitigating the curse of dimensionality: sparse grid characteristics method for optimal feedback control and HJB equations***by*Wei Kang & Lucas C. Wilcox**317-331 Descent algorithm for nonsmooth stochastic multiobjective optimization***by*Fabrice Poirion & Quentin Mercier & Jean-Antoine Désidéri**333-362 An alternating direction and projection algorithm for structure-enforced matrix factorization***by*Lijun Xu & Bo Yu & Yin Zhang**363-405 Approximate ADMM algorithms derived from Lagrangian splitting***by*Jonathan Eckstein & Wang Yao**407-436 Peaceman–Rachford splitting for a class of nonconvex optimization problems***by*Guoyin Li & Tianxiang Liu & Ting Kei Pong**437-454 A generalized elastic net regularization with smoothed $$\ell _{q}$$ ℓ q penalty for sparse vector recovery***by*Yong Zhang & Wanzhou Ye & Jianjun Zhang**455-472 On the convergence of alternating minimization methods in variational PGD***by*A. El Hamidi & H. Ossman & M. Jazar

### September 2017, Volume 68, Issue 1

**1-27 A comparison of reduced and unreduced KKT systems arising from interior point methods***by*Benedetta Morini & Valeria Simoncini & Mattia Tani**29-55 Two wide neighborhood interior-point methods for symmetric cone optimization***by*M. Sayadi Shahraki & H. Mansouri & M. Zangiabadi**57-93 Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators***by*Puya Latafat & Panagiotis Patrinos**95-120 A new method for interpolating in a convex subset of a Hilbert space***by*Xavier Bay & Laurence Grammont & Hassan Maatouk**121-162 Reliable a posteriori error estimation for state-constrained optimal control***by*A. Rösch & K. G. Siebert & S. Steinig**163-192 On the resolution of certain discrete univariate max–min problems***by*Ramsharan Rangarajan

### July 2017, Volume 67, Issue 3

**443-487 Forward–backward quasi-Newton methods for nonsmooth optimization problems***by*Lorenzo Stella & Andreas Themelis & Panagiotis Patrinos**489-520 Further properties of the forward–backward envelope with applications to difference-of-convex programming***by*Tianxiang Liu & Ting Kei Pong**521-541 Total variation image deblurring with space-varying kernel***by*Daniel O’Connor & Lieven Vandenberghe**543-569 $$S_{1/2}$$ S 1 / 2 regularization methods and fixed point algorithms for affine rank minimization problems***by*Dingtao Peng & Naihua Xiu & Jian Yu**571-594 New subgradient extragradient methods for common solutions to equilibrium problems***by*Dang Hieu**595-620 Generalized Krasnoselskii–Mann-type iterations for nonexpansive mappings in Hilbert spaces***by*Christian Kanzow & Yekini Shehu

### June 2017, Volume 67, Issue 2

**225-258 Second-order orthant-based methods with enriched Hessian information for sparse $$\ell _1$$ ℓ 1 -optimization***by*J. C. De Los Reyes & E. Loayza & P. Merino**259-292 Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions***by*Patrick R. Johnstone & Pierre Moulin**293-316 Branch-and-price for p-cluster editing***by*Teobaldo Bulhões & Anand Subramanian & Gilberto F. Sousa Filho & Lucídio dos Anjos F. Cabral**317-360 Solving nearly-separable quadratic optimization problems as nonsmooth equations***by*Frank E. Curtis & Arvind U. Raghunathan**361-399 An SQP method for mathematical programs with vanishing constraints with strong convergence properties***by*Matúš Benko & Helmut Gfrerer**401-419 $$L^1$$ L 1 penalization of volumetric dose objectives in optimal control of PDEs***by*Richard C. Barnard & Christian Clason**421-442 Visualization of the $$\varepsilon $$ ε -subdifferential of piecewise linear–quadratic functions***by*Anuj Bajaj & Warren Hare & Yves Lucet

### May 2017, Volume 67, Issue 1

**1-38 A dual gradient-projection method for large-scale strictly convex quadratic problems***by*Nicholas I. M. Gould & Daniel P. Robinson**39-71 Error estimates for integral constraint regularization of state-constrained elliptic control problems***by*B. Jadamba & A. Khan & M. Sama**73-110 A Riemannian conjugate gradient method for optimization on the Stiefel manifold***by*Xiaojing Zhu**111-127 A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods***by*Porfirio Suñagua & Aurelio R. L. Oliveira**129-154 Subspace-stabilized sequential quadratic programming***by*A. F. Izmailov & E. I. Uskov**155-173 On merit functions for p-order cone complementarity problem***by*Xin-He Miao & Yu-Lin Chang & Jein-Shan Chen**175-199 Analysis on Newton projection method for the split feasibility problem***by*Biao Qu & Changyu Wang & Naihua Xiu**201-223 Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks***by*Filippo Pecci & Edo Abraham & Ivan Stoianov

### April 2017, Volume 66, Issue 3

**401-424 Structured regularization for barrier NLP solvers***by*Wei Wan & Lorenz T. Biegler**425-451 Adaptive smoothing algorithms for nonsmooth composite convex minimization***by*Quoc Tran-Dinh**453-479 A robust Lagrangian-DNN method for a class of quadratic optimization problems***by*Naohiko Arima & Sunyoung Kim & Masakazu Kojima & Kim-Chuan Toh**481-505 Partitioned quasi-Newton methods for sparse nonlinear equations***by*Hui-Ping Cao & Dong-Hui Li**507-532 A nonmonotone Jacobian smoothing inexact Newton method for NCP***by*Sanja Rapajić & Zoltan Papp**533-556 Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization***by*K. Lakshmanan & Shalabh Bhatnagar**557-576 Formulating an n-person noncooperative game as a tensor complementarity problem***by*Zheng-Hai Huang & Liqun Qi**577-600 A polynomial primal-dual affine scaling algorithm for symmetric conic optimization***by*Ali Mohammad-Nezhad & Tamás Terlaky

### March 2017, Volume 66, Issue 2

**223-244 Local nonglobal minima for solving large-scale extended trust-region subproblems***by*Maziar Salahi & Akram Taati & Henry Wolkowicz**245-266 On solving L-SR1 trust-region subproblems***by*Johannes Brust & Jennifer B. Erway & Roummel F. Marcia**267-283 A semidefinite algorithm for completely positive tensor decomposition***by*Jinyan Fan & Anwa Zhou**285-307 Computing the generalized eigenvalues of weakly symmetric tensors***by*Na Zhao & Qingzhi Yang & Yajun Liu**309-326 Fast algorithm for singly linearly constrained quadratic programs with box-like constraints***by*Meijiao Liu & Yong-Jin Liu**327-343 A note on the convergence of ADMM for linearly constrained convex optimization problems***by*Liang Chen & Defeng Sun & Kim-Chuan Toh**345-381 Decomposable norm minimization with proximal-gradient homotopy algorithm***by*Reza Eghbali & Maryam Fazel**383-400 Modeling max–min fair bandwidth allocation in BitTorrent communities***by*Elvira Antal & Tamás Vinkó

### January 2017, Volume 66, Issue 1

**1-37 On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study***by*Ricardo M. Lima & Ignacio E. Grossmann**39-73 On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function***by*Xingju Cai & Deren Han & Xiaoming Yuan**75-96 Modified hybrid projection methods for finding common solutions to variational inequality problems***by*Dang Hieu & Pham Ky Anh & Le Dung Muu**97-122 Conic approximation to quadratic optimization with linear complementarity constraints***by*Jing Zhou & Shu-Cherng Fang & Wenxun Xing**123-162 A preconditioned descent algorithm for variational inequalities of the second kind involving the p-Laplacian operator***by*Sergio González-Andrade**163-185 Simple decentralized graph coloring***by*Severino F. Galán**187-218 Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation***by*Chao Ding & Hou-Duo Qi**219-222 Erratum to: A regularized Newton method without line search for unconstrained optimization***by*Kenji Ueda & Nobuo Yamashita

### December 2016, Volume 65, Issue 3

**545-566 On handling indicator constraints in mixed integer programming***by*Pietro Belotti & Pierre Bonami & Matteo Fischetti & Andrea Lodi & Michele Monaci & Amaya Nogales-Gómez & Domenico Salvagnin**567-603 Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?***by*H. Heitsch & H. Leövey & W. Römisch**605-635 Performance of first- and second-order methods for $$\ell _1$$ ℓ 1 -regularized least squares problems***by*Kimon Fountoulakis & Jacek Gondzio**637-669 Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support***by*W. Ackooij & A. Frangioni & W. Oliveira**671-698 Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization***by*Yakui Huang & Hongwei Liu**699-721 Sequential equality-constrained optimization for nonlinear programming***by*E. G. Birgin & L. F. Bueno & J. M. Martínez**723-751 Algebraic rules for computing the regularization parameter of the Levenberg–Marquardt method***by*Elizabeth W. Karas & Sandra A. Santos & Benar F. Svaiter**753-779 A modified Levenberg–Marquardt method with line search for nonlinear equations***by*Liang Chen**781-797 An adaptive gradient method for computing generalized tensor eigenpairs***by*Gaohang Yu & Zefeng Yu & Yi Xu & Yisheng Song & Yi Zhou**799-820 Spherical optimization with complex variablesfor computing US-eigenpairs***by*Guyan Ni & Minru Bai**821-844 An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices***by*Rafael A. Melo & Phillippe Samer & Sebastián Urrutia**845-869 Building an iterative heuristic solver for a quantum annealer***by*Gili Rosenberg & Mohammad Vazifeh & Brad Woods & Eldad Haber

### November 2016, Volume 65, Issue 2

**309-311 Guest editorial***by*Gianni Di Pillo & Massimo Roma**313-338 Central axes and peripheral points in high dimensional directional datasets***by*Annabella Astorino & Manlio Gaudioso & Alberto Seeger**339-360 On the update of constraint preconditioners for regularized KKT systems***by*Stefania Bellavia & Valentina De Simone & Daniela di Serafino & Benedetta Morini**361-397 A DIRECT-type approach for derivative-free constrained global optimization***by*G. Di Pillo & G. Liuzzi & S. Lucidi & V. Piccialli & F. Rinaldi**399-429 A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization***by*Giovanni Fasano & Massimo Roma**431-448 Improved error bound and a hybrid method for generalized Nash equilibrium problems***by*Axel Dreves**449-475 Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization***by*G. Liuzzi & S. Lucidi & V. Piccialli**477-491 Solving uniform coverage problem with a modified Remez-algorithm***by*D. Nowak & K. H. Küfer**493-509 Reduction of affine variational inequalities***by*Stephen M. Robinson**511-539 Perfectly competitive capacity expansion games with risk-averse participants***by*Dane A. Schiro & Benjamin F. Hobbs & Jong-Shi Pang

### September 2016, Volume 65, Issue 1

**1-46 A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings***by*Fu Lin & Sven Leyffer & Todd Munson**47-71 A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space***by*Marcia Fampa & Jon Lee & Wendel Melo**73-92 Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems***by*Markus Leitner**93-108 On the global convergence of the inexact semi-smooth Newton method for absolute value equation***by*J. Y. Bello Cruz & O. P. Ferreira & L. F. Prudente**109-126 A semismooth Newton method for tensor eigenvalue complementarity problem***by*Zhongming Chen & Liqun Qi**127-172 New results on subgradient methods for strongly convex optimization problems with a unified analysis***by*Masaru Ito**173-203 Nonconvex bundle method with application to a delamination problem***by*Minh N. Dao & Joachim Gwinner & Dominikus Noll & Nina Ovcharova**205-259 Conjugate gradient acceleration of iteratively re-weighted least squares methods***by*Massimo Fornasier & Steffen Peter & Holger Rauhut & Stephan Worm**261-288 Global minima for semilinear optimal control problems***by*Ahmad Ahmad Ali & Klaus Deckelnick & Michael Hinze**289-308 A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems***by*Jiawei Chen & Qamrul Hasan Ansari & Yeong-Cheng Liou & Jen-Chih Yao

### July 2016, Volume 64, Issue 3

**619-645 Stochastic derivative-free optimization using a trust region framework***by*Jeffrey Larson & Stephen C. Billups**647-670 Computing the distance between the linear matrix pencil and the completely positive cone***by*Jinyan Fan & Anwa Zhou**671-697 A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints***by*Jueyou Li & Guo Chen & Zhaoyang Dong & Zhiyou Wu**699-724 The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization***by*Ole Løseth Elvetun & Bjørn Fredrik Nielsen**725-754 Alternating direction method of multipliers for penalized zero-variance discriminant analysis***by*Brendan P. W. Ames & Mingyi Hong**755-792 Nonlinear residual minimization by iteratively reweighted least squares***by*Juliane Sigl**793-819 State-defect constraint pairing graph coarsening method for Karush–Kuhn–Tucker matrices arising in orthogonal collocation methods for optimal control***by*Begüm Şenses Cannataro & Anil V. Rao & Timothy A. Davis**821-842 Selective bi-coordinate variations for resource allocation type problems***by*I. V. Konnov**843-864 Column generation approaches for the software clustering problem***by*Hugo Harry Kramer & Eduardo Uchoa & Marcia Fampa & Viviane Köhler & François Vanderbeck**865-880 Feature subset selection for logistic regression via mixed integer optimization***by*Toshiki Sato & Yuichi Takano & Ryuhei Miyashiro & Akiko Yoshise**881-919 Local convex hulls for a special class of integer multicommodity flow problems***by*Zhiyuan Lin & Raymond S. K. Kwan

### June 2016, Volume 64, Issue 2

**327-354 An inertia-free filter line-search algorithm for large-scale nonlinear programming***by*Nai-Yuan Chiang & Victor M. Zavala**355-378 Bounding duality gap for separable problems with linear constraints***by*Madeleine Udell & Stephen Boyd**379-406 Clustering-based preconditioning for stochastic programs***by*Yankai Cao & Carl D. Laird & Victor M. Zavala**407-431 Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming***by*Rebecca Stockbridge & Güzin Bayraksan**433-465 Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems***by*Li-Ping Pang & Jian Lv & Jin-He Wang**467-488 Sufficient weighted complementarity problems***by*Florian A. Potra**489-511 On how to solve large-scale log-determinant optimization problems***by*Chengjing Wang**513-533 Theoretical and computational results about optimality-based domain reductions***by*Alberto Caprara & Marco Locatelli & Michele Monaci**535-555 A generalization of $$\omega $$ ω -subdivision ensuring convergence of the simplicial algorithm***by*Takahito Kuno & Tomohiro Ishihama