# Springer

# Computational Optimization and Applications

**Order information:**

Web: http://www.springer.com/math/journal/10589

**Download restrictions:**Access to the full text of the articles in this series is restricted.

**Editor:**

**For corrections or technical questions regarding this series, please contact (Sonal Shukla) or (Rebekah McClure)**

**Series handle:**repec:spr:coopap

**Citations RSS feed:**at CitEc

### Impact factors

- Simple (last 10 years)
- Recursive (10)
- Discounted (10)
- Recursive discounted (10)
- H-Index (10)
- Aggregate (10)

**Access and download statistics**

**Top item:**

- By citations
- By downloads (last 12 months)

### 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

### 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

### 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**557-588 Distortion compensation as a shape optimisation problem for a sharp interface model***by*Kevin Sturm & Michael Hintermüller & Dietmar Hömberg**589-618 Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results***by*Günter Rudolph & Oliver Schütze & Christian Grimme & Christian Domínguez-Medina & Heike Trautmann

### 2016, Volume 64, Issue 1

**1-30 On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation***by*S. Bellavia & B. Morini & E. Riccietti**31-73 An adaptive accelerated first-order method for convex optimization***by*Renato D. C. Monteiro & Camilo Ortiz & Benar F. Svaiter**75-100 A bundle method using two polyhedral approximations of the $$\varepsilon $$ ε -enlargement of a maximal monotone operator***by*Ludovic Nagesseur**101-118 A Dai–Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions***by*Hiroyuki Sato**119-148 Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems***by*Le Han & Shujun Bi & Shaohua Pan**149-176 Higher-degree eigenvalue complementarity problems for tensors***by*Chen Ling & Hongjin He & Liqun Qi**177-214 Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs***by*Alexander Veremyev & Oleg A. Prokopyev & Sergiy Butenko & Eduardo L. Pasiliao**215-242 Exact solution approaches for bilevel assignment problems***by*Behdad Beheshti & Oleg A. Prokopyev & Eduardo L. Pasiliao**243-263 A new local dimming algorithm based on the simplex method***by*Martin Riplinger & Michael Krause & Alfred K. Louis & Chihao Xu**265-294 Optimization of nonlocal time-delayed feedback controllers***by*Peter Nestler & Eckehard Schöll & Fredi Tröltzsch**295-326 Discretization of semilinear bang-singular-bang control problems***by*Ursula Felgenhauer

### 2016, Volume 63, Issue 3

**613-638 On an inexact trust-region SQP-filter method for constrained nonlinear optimization***by*Andrea Walther & Lorenz Biegler**639-684 Active-set prediction for interior point methods using controlled perturbations***by*Coralia Cartis & Yiming Yan**685-703 On the solution of convex bilevel optimization problems***by*S. Dempe & S. Franke**705-735 Approximated perspective relaxations: a project and lift approach***by*Antonio Frangioni & Fabio Furini & Claudio Gentile**737-753 Towards an objective feasibility pump for convex MINLPs***by*Shaurya Sharma & Brage Rugstad Knudsen & Bjarne Grimstad**755-792 Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem***by*Luis Bicalho & Alexandre Cunha & Abilio Lucena**793-824 Finite element error estimates for an optimal control problem governed by the Burgers equation***by*Pedro Merino**825-853 Dirichlet control of elliptic state constrained problems***by*Mariano Mateos & Ira Neitzel**855-873 Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem***by*Nicolas Delanoue & Mehdi Lhommeau & Philippe Lucidarme**875-902 On multiobjective selection for multimodal optimization***by*Simon Wessing & Mike Preuss**903-926 Analysis of multi-objective Kriging-based methods for constrained global optimization***by*Cédric Durantin & Julien Marzat & Mathieu Balesdent**903-926 Analysis of multi-objective Kriging-based methods for constrained global optimization***by*Cédric Durantin & Julien Marzat & Mathieu Balesdent**875-902 On multiobjective selection for multimodal optimization***by*Simon Wessing & Mike Preuss**855-873 Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem***by*Nicolas Delanoue & Mehdi Lhommeau & Philippe Lucidarme**825-853 Dirichlet control of elliptic state constrained problems***by*Mariano Mateos & Ira Neitzel**793-824 Finite element error estimates for an optimal control problem governed by the Burgers equation***by*Pedro Merino**755-792 Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem***by*Luis Henrique Bicalho & Alexandre Salles Cunha & Abilio Lucena**737-753 Towards an objective feasibility pump for convex MINLPs***by*Shaurya Sharma & Brage Knudsen & Bjarne Grimstad**705-735 Approximated perspective relaxations: a project and lift approach***by*Antonio Frangioni & Fabio Furini & Claudio Gentile**685-703 On the solution of convex bilevel optimization problems***by*S. Dempe & S. Franke**639-684 Active-set prediction for interior point methods using controlled perturbations***by*Coralia Cartis & Yiming Yan**613-638 On an inexact trust-region SQP-filter method for constrained nonlinear optimization***by*Andrea Walther & Lorenz Biegler

### 2016, Volume 63, Issue 2

**305-332 The directed search method for multi-objective memetic algorithms***by*Oliver Schütze & Adanay Martín & Adriana Lara & Sergio Alvarado & Eduardo Salinas & Carlos A. Coello Coello**333-364 Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem***by*Ting Kei Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz**365-392 Bounded perturbation resilience of projected scaled gradient methods***by*Wenma Jin & Yair Censor & Ming Jiang**393-423 An efficient method for solving a matrix least squares problem over a matrix inequality constraint***by*Jiao-fen Li & Wen Li & Ru Huang**425-459 Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions***by*Andreas Fischer & Markus Herrich & Alexey F. Izmailov & Mikhail V. Solodov**461-493 Copositivity tests based on the linear complementarity problem***by*Carmo Brás & Gabriele Eichfelder & Joaquim Júdice**495-522 Constructions of complementarity functions and merit functions for circular cone complementarity problem***by*Xin-He Miao & Shengjuan Guo & Nuo Qi & Jein-Shan Chen**523-542 On the steepest descent algorithm for quadratic functions***by*Clóvis C. Gonzaga & Ruana M. Schneider**543-557 Reliable updates of the transformation in the iterative closest point algorithm***by*Per Bergström**559-583 On the shortest path problem with negative cost cycles***by*Luigi Di Puglia Pugliese & Francesca Guerriero**585-612 A fast implementation for the 2D/3D box placement problem***by*Wenbin Zhu & Zhixing Luo & Andrew Lim & Wee-Chong Oon**585-612 A fast implementation for the 2D/3D box placement problem***by*Wenbin Zhu & Zhixing Luo & Andrew Lim & Wee-Chong Oon**559-583 On the shortest path problem with negative cost cycles***by*Luigi Di Puglia Pugliese & Francesca Guerriero**543-557 Reliable updates of the transformation in the iterative closest point algorithm***by*Per Bergström**523-542 On the steepest descent algorithm for quadratic functions***by*Clóvis Gonzaga & Ruana Schneider**495-522 Constructions of complementarity functions and merit functions for circular cone complementarity problem***by*Xin-He Miao & Shengjuan Guo & Nuo Qi & Jein-Shan Chen**461-493 Copositivity tests based on the linear complementarity problem***by*Carmo Brás & Gabriele Eichfelder & Joaquim Júdice**425-459 Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions***by*Andreas Fischer & Markus Herrich & Alexey Izmailov & Mikhail Solodov**393-423 An efficient method for solving a matrix least squares problem over a matrix inequality constraint***by*Jiao-fen Li & Wen Li & Ru Huang**365-392 Bounded perturbation resilience of projected scaled gradient methods***by*Wenma Jin & Yair Censor & Ming Jiang**333-364 Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem***by*Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz**305-332 The directed search method for multi-objective memetic algorithms***by*Oliver Schütze & Adanay Martín & Adriana Lara & Sergio Alvarado & Eduardo Salinas & Carlos Coello

### 2016, Volume 63, Issue 1

**1-28 A proximal bundle method for nonsmooth nonconvex functions with inexact information***by*W. Hare & C. Sagastizábal & M. Solodov**29-44 An acceleration scheme for Dykstra’s algorithm***by*Williams López & Marcos Raydan**45-67 Using multiobjective optimization to map the entropy region***by*László Csirmaz**69-95 A leapfrog semi-smooth Newton-multigrid method for semilinear parabolic optimal control problems***by*Jun Liu & Mingqing Xiao**97-120 Lagrangian heuristics for the Quadratic Knapsack Problem***by*Jesus Ossian Cunha & Luidi Simonetti & Abilio Lucena**121-142 Exact line and plane search for tensor optimization***by*Laurent Sorber & Ignat Domanov & Marc Barel & Lieven Lathauwer**143-168 On the cone eigenvalue complementarity problem for higher-order tensors***by*Chen Ling & Hongjin He & Liqun Qi**169-202 An iterative algorithm for third-order tensor multi-rank minimization***by*Lei Yang & Zheng-Hai Huang & Shenglong Hu & Jiye Han**203-236 Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach***by*Yoshihiro Kanno**237-271 Optimization of current carrying multicables***by*Helmut Harbrecht & Florian Loos**273-303 A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA***by*Liusheng Hou & Hongjin He & Junfeng Yang**97-120 Lagrangian heuristics for the Quadratic Knapsack Problem***by*Jesus Cunha & Luidi Simonetti & Abilio Lucena**69-95 A leapfrog semi-smooth Newton-multigrid method for semilinear parabolic optimal control problems***by*Jun Liu & Mingqing Xiao**45-67 Using multiobjective optimization to map the entropy region***by*László Csirmaz**29-44 An acceleration scheme for Dykstra’s algorithm***by*Williams López & Marcos Raydan**273-303 A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA***by*Liusheng Hou & Hongjin He & Junfeng Yang**237-271 Optimization of current carrying multicables***by*Helmut Harbrecht & Florian Loos**203-236 Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach***by*Yoshihiro Kanno**169-202 An iterative algorithm for third-order tensor multi-rank minimization***by*Lei Yang & Zheng-Hai Huang & Shenglong Hu & Jiye Han**143-168 On the cone eigenvalue complementarity problem for higher-order tensors***by*Chen Ling & Hongjin He & Liqun Qi**121-142 Exact line and plane search for tensor optimization***by*Laurent Sorber & Ignat Domanov & Marc Barel & Lieven Lathauwer**1-28 A proximal bundle method for nonsmooth nonconvex functions with inexact information***by*W. Hare & C. Sagastizábal & M. Solodov

### 2015, Volume 62, Issue 3

**613-639 Optimizing over coherent risk measures and non-convexities: a robust mixed integer optimization approach***by*Dimitris Bertsimas & Akiko Takeda**641-668 Dynamic generation of scenario trees***by*Georg Pflug & Alois Pichler**669-692 Scenario generation for stochastic optimization problems via the sparse grid method***by*Michael Chen & Sanjay Mehrotra & Dávid Papp**693-715 Mesh adaptive direct search with second directional derivative-based Hessian update***by*Árpád Bűrmen & Jernej Olenšek & Tadej Tuma**717-759 Convex reformulations for solving a nonlinear network design problem***by*Jesco Humpola & Armin Fügenschuh**761-786 AAR-based decomposition algorithm for non-linear convex optimisation***by*Nima Rabiei & Jose Muñoz**787-814 A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems***by*J. Terán-Villanueva & Héctor Fraire Huacuja & Juan Carpio Valadez & Rodolfo Pazos Rangel & Héctor Puga Soberanes & José Martínez Flores**815-850 The augmented Lagrangian method based on the APG strategy for an inverse damped gyroscopic eigenvalue problem***by*Yue Lu & Liwei Zhang**851-890 Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization***by*Nikhil Padhye & Pulkit Mittal & Kalyanmoy Deb

### 2015, Volume 62, Issue 2

**323-346 Globally convergent evolution strategies for constrained optimization***by*Y. Diouane & S. Gratton & L. Vicente**347-372 A fast splitting method tailored for Dantzig selector***by*Hongjin He & Xingju Cai & Deren Han**373-404 Inexact accelerated augmented Lagrangian methods***by*Myeongmin Kang & Myungjoo Kang & Miyoun Jung**405-429 Combining stabilized SQP with the augmented Lagrangian algorithm***by*A. Izmailov & M. Solodov & E. Uskov**431-475 A robust and informative method for solving large-scale power flow problems***by*Walter Murray & Tomás Tinoco De Rubira & Adam Wigington**477-515 Finite purchasing power and computations of Bertrand–Nash equilibrium prices***by*W. Morrow**517-544 On a topology optimization problem governed by two-dimensional Helmholtz equation***by*Jaroslav Haslinger & Raino Mäkinen**545-564 A review of distances for the Mallows and Generalized Mallows estimation of distribution algorithms***by*Josu Ceberio & Ekhine Irurozki & Alexander Mendiburu & Jose Lozano**565-588 An improved test set approach to nonlinear integer problems with applications to engineering design***by*J. Gago-Vargas & I. Hartillo & J. Puerto & J. Ucha**589-607 Tabu search and GRASP for the capacitated clustering problem***by*Anna Martínez-Gavara & Vicente Campos & Micael Gallego & Manuel Laguna & Rafael Martí

### 2015, Volume 62, Issue 1

**1-3 Introduction to the special issue for EUCCO 2013***by*Peter Benner & Roland Herzog & Michael Hinze & Arnd Rösch & Anton Schiela & Volker Schulz**5-29 Low-rank retractions: a survey and new results***by*P.-A. Absil & I. Oseledets**31-65 Boundary concentrated finite elements for optimal control problems with distributed observation***by*S. Beuchler & K. Hofer & D. Wachsmuth & J.-E. Wurst**67-83 Numerical methods for parameter identification in stationary radiative transfer***by*Herbert Egger & Matthias Schlottbom**85-109 The semismooth Newton method for the solution of quasi-variational inequalities***by*Francisco Facchinei & Christian Kanzow & Sebastian Karl & Simone Sagratella**111-129 Optimizing fiber orientation in fiber-reinforced materials using efficient upscaling***by*S. Frei & H. Andrä & R. Pinnau & O. Tse**131-155 Lossy compression for PDE-constrained optimization: adaptive error control***by*Sebastian Götschel & Martin Weiser**157-180 Annular and sectorial sparsity in optimal control of elliptic equations***by*Roland Herzog & Johannes Obermeier & Gerd Wachsmuth**181-216 Moreau–Yosida regularization in shape optimization with geometric constraints***by*Moritz Keuthen & Michael Ulbrich**217-239 Parameter identification for nonlinear elliptic-parabolic systems with application in lithium-ion battery modeling***by*Oliver Lass & Stefan Volkwein**241-270 Optimal control of electrorheological fluids through the action of electric fields***by*Juan De Los Reyes & Irwin Yousept**271-289 Robust error estimates for regularization and discretization of bang–bang control problems***by*Daniel Wachsmuth**291-321 Adaptive discontinuous Galerkin methods for state constrained optimal control problems governed by convection diffusion equations***by*Hamdullah Yücel & Peter Benner

### 2015, Volume 61, Issue 3

**557-570 Sparsity preserving preconditioners for linear systems in interior-point methods***by*Milan Dražić & Rade Lazović & Vera Kovačević-Vujčić**571-607 Using an outward selective pressure for improving the search quality of the MOEA/D algorithm***by*Krzysztof Michalak**609-634 Path following in the exact penalty method of convex programming***by*Hua Zhou & Kenneth Lange**635-668 An alternating direction method with increasing penalty for stable principal component pursuit***by*N. Aybat & G. Iyengar**669-688 Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques***by*Felix Lieder & Fatemeh Rad & Florian Jarre**689-711 Potential induced random teleportation on finite graphs***by*Shui-Nee Chow & Xiaojing Ye & Haomin Zhou**713-729 A filling function method for unconstrained global optimization***by*F. Lampariello & G. Liuzzi**731-760 Convergence results for the discrete regularization of linear-quadratic control problems with bang–bang solutions***by*Martin Seydenschwanz**761-781 A collision detection approach for maximizing the material utilization***by*Volker Maag**783-818 A finite hyperplane traversal Algorithm for 1-dimensional $$L^1pTV$$ L 1 p T V minimization, for $$0>p\le 1$$ 0 > p ≤ 1***by*Heather Moon & Thomas Asaki

### 2015, Volume 61, Issue 2

**275-319 Mirror Prox algorithm for multi-term composite minimization and semi-separable problems***by*Niao He & Anatoli Juditsky & Arkadi Nemirovski**321-341 A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems***by*M. Reza Peyghami & D. Ataee Tarzanagh**343-372 An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers***by*Ghassan Shobaki & Jafar Jamal**373-408 Superconvergence for Neumann boundary control problems governed by semilinear elliptic equations***by*K. Krumbiegel & J. Pfefferer**409-435 A primal-dual interior point method for large-scale free material optimization***by*Alemseged Weldeyesus & Mathias Stolpe**437-461 The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction***by*Radek Kučera & Kristina Motyčková & Alexandros Markopoulos**463-487 Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers***by*Prasanna Balaprakash & Mauro Birattari & Thomas Stützle & Marco Dorigo**489-515 Terminating evolutionary algorithms at their steady state***by*Debora Gil & David Roche & Agnés Borràs & Jesús Giraldo**517-555 Interval-based ranking in noisy evolutionary multi-objective optimization***by*Hossein Karshenas & Concha Bielza & Pedro Larrañaga

### 2015, Volume 61, Issue 1

**1-23 Linear equalities in blackbox optimization***by*Charles Audet & Sébastien Le Digabel & Mathilde Peyrega**25-49 A derivative-free trust-funnel method for equality-constrained nonlinear optimization***by*Ph. Sampaio & Ph. Toint**51-78 An exterior point polynomial-time algorithm for convex quadratic programming***by*Da Tian**79-99 On the proximal Landweber Newton method for a class of nonsmooth convex problems***by*Hai-Bin Zhang & Jiao-Jiao Jiang & Yun-Bin Zhao**101-133 Reconstruction algorithm for unknown cavities via Feynman–Kac type formula***by*Hajime Kawakami**135-158 Legendre–Galerkin spectral methods for optimal control problems with integral constraint for state in one dimension***by*Jianwei Zhou & Danping Yang**159-187 A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem***by*Juan Rivera & H. Afsar & Christian Prins**189-204 A new algorithm for the minimum spanning tree verification problem***by*Matthew Williamson & K. Subramani**205-217 On heuristic bi-criterion methods for semi-obnoxious facility location***by*P. Ortigosa & E. Hendrix & J. Redondo**219-241 An incremental clustering algorithm based on hyperbolic smoothing***by*A. Bagirov & B. Ordin & G. Ozturk & A. Xavier**243-274 Differential evolution using a superior–inferior crossover scheme***by*Yulong Xu & Jian-an Fang & Wu Zhu & Xiaopeng Wang & Lingdong Zhao

### 2015, Volume 60, Issue 3

**545-557 CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization***by*Nicholas Gould & Dominique Orban & Philippe Toint**559-585 An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs***by*Kuo-Ling Huang & Sanjay Mehrotra**587-608 Novel update techniques for the revised simplex method***by*Qi Huangfu & J. Hall**609-631 Optimality properties of an Augmented Lagrangian method on infeasible problems***by*E. Birgin & J. Martínez & L. Prudente**633-674 An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization***by*Qihang Lin & Lin Xiao**675-695 A smoothing Levenberg–Marquardt algorithm for semi-infinite programming***by*Ping Jin & Chen Ling & Huifei Shen**697-717 Convergence analysis on a class of improved Chebyshev methods for nonlinear equations in Banach spaces***by*Xiuhua Wang & Jisheng Kou**719-751 Symmetric error estimates for discontinuous Galerkin time-stepping schemes for optimal control problems constrained to evolutionary Stokes equations***by*Konstantinos Chrysafinos & Efthimios Karatzas**753-787 Certified PDE-constrained parameter optimization using reduced basis surrogate models for evolution problems***by*Markus Dihlmann & Bernard Haasdonk**789-814 Addressing the envelope reduction of sparse matrices using a genetic programming system***by*Behrooz Koohestani & Riccardo Poli

### 2015, Volume 60, Issue 2

**277-310 On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators***by*Cong Dang & Guanghui Lan**311-341 A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization***by*Frank Curtis & Zheng Han & Daniel Robinson**343-376 Algebraic rules for quadratic regularization of Newton’s method***by*Elizabeth Karas & Sandra Santos & Benar Svaiter**377-392 On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems***by*Anders Forsgren & Tove Odland**393-411 A derivative-free descent method in set optimization***by*Johannes Jahn**413-422 Limited memory BFGS method based on a high-order tensor model***by*Fahimeh Biglari & Ali Ebadian**423-439 Improved local convergence analysis of the Gauss–Newton method under a majorant condition***by*Ioannis Argyros & Á. Magreñán**441-477 A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning***by*Luke Mason & Vicky Mak-Hau & Andreas Ernst**479-511 Multiobjective swarm intelligence for the traffic grooming problem***by*Álvaro Rubio-Largo & Miguel Vega-Rodríguez & David González-Álvarez**513-544 Minimum penalty for constrained evolutionary optimization***by*Xiaosheng Li & Guoshan Zhang

### 2015, Volume 60, Issue 1

**1-33 A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations***by*L. Grippo & F. Rinaldi**35-57 On the use of iterative methods in cubic regularization for unconstrained optimization***by*Tommaso Bianconcini & Giampaolo Liuzzi & Benedetta Morini & Marco Sciandrone**59-87 Comparative study of RPSALG algorithm for convex semi-infinite programming***by*A. Auslender & A. Ferrer & M. Goberna & M. López**89-110 A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization***by*Mehiddin Al-Baali & Yasushi Narushima & Hiroshi Yabe**111-140 Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption***by*A. Izmailov & A. Kurennoy & M. Solodov**141-150 A double projection method for solving variational inequalities without monotonicity***by*Minglu Ye & Yiran He**151-170 A convergent and efficient decomposition method for the traffic assignment problem***by*David Di Lorenzo & Alessandro Galligari & Marco Sciandrone**171-198 Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting***by*Jiming Peng & Tao Zhu & Hezhi Luo & Kim-Chuan Toh**199-229 A trust-region-based derivative free algorithm for mixed integer programming***by*Eric Newby & M. Ali