# Springer

# Computational Optimization and Applications

**Order information:**

Web: http://link.springer.de/orders.htm

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

**Current editor:**William W. Hager

**For corrections or technical questions regarding this series, please contact (Guenther Eichhorn) or (Christopher F Baum)**

**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)

### 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**231-261 A linear-time approximate convex envelope algorithm using the double Legendre–Fenchel transform with application to phase separation***by*Lorenzo Contento & Alexandre Ern & Rossana Vermiglio**263-276 An augmented Lagrangian ant colony based method for constrained optimization***by*Asghar Mahdavi & Mohammad Shiri

### 2014, Volume 59, Issue 3

**405-433 Study of a primal-dual algorithm for equality constrained minimization***by*Paul Armand & Joël Benoist & Riadh Omheni & Vincent Pateloup**435-473 Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization***by*Chungen Shen & Lei-Hong Zhang & Bo Wang & Wenqiong Shao**475-509 Sequential quadratic programming methods for parametric nonlinear optimization***by*Vyacheslav Kungurtsev & Moritz Diehl**511-540 An alternating extragradient method with non euclidean projections for saddle point problems***by*Silvia Bonettini & Valeria Ruggiero**541-563 An efficient gradient method using the Yuan steplength***by*Roberta De Asmundis & Daniela di Serafino & William Hager & Gerardo Toraldo & Hongchao Zhang**565-589 A variable fixing version of the two-block nonlinear constrained Gauss–Seidel algorithm for $$\ell _1$$ ℓ 1 -regularized least-squares***by*Margherita Porcelli & Francesco Rinaldi**591-616 Solving semi-infinite programs by smoothing projected gradient method***by*Mengwei Xu & Soon-Yi Wu & Jane Ye**617-638 A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs***by*Daniel Espinoza & Eduardo Moreno**639-665 Strong-branching inequalities for convex mixed integer nonlinear programs***by*Mustafa Kılınç & Jeff Linderoth & James Luedtke & Andrew Miller**667-688 Efficient parallel solution of large-scale nonlinear dynamic optimization problems***by*Daniel Word & Jia Kang & Johan Akesson & Carl Laird**689-724 An Eulerian–Lagrangian method for optimization problems governed by multidimensional nonlinear hyperbolic PDEs***by*Alina Chertock & Michael Herty & Alexander Kurganov**725-748 Hybridizing local search algorithms for global optimization***by*Morteza Ahandani & Mohammad-Taghi Vakil-Baghmisheh & Mohammad Talebi

### 2014, Volume 59, Issue 1

**1-4 Preface***by*Xiaojun Chen & Nobuo Yamashita**5-26 A Levenberg-Marquardt method with approximate projections***by*R. Behling & A. Fischer & M. Herrich & A. Iusem & Y. Ye**27-45 Faster, but weaker, relaxations for quadratically constrained quadratic programs***by*Samuel Burer & Sunyoung Kim & Masakazu Kojima**47-61 Convergence of the reweighted ℓ 1 minimization algorithm for ℓ 2 –ℓ p minimization***by*Xiaojun Chen & Weijun Zhou**63-84 A new error bound result for Generalized Nash Equilibrium Problems and its algorithmic application***by*Axel Dreves & Francisco Facchinei & Andreas Fischer & Markus Herrich**85-112 Non-cooperative games with minmax objectives***by*Francisco Facchinei & Jong-Shi Pang & Gesualdo Scutari**113-134 On an enumerative algorithm for solving eigenvalue complementarity problems***by*Luís Fernandes & Joaquim Júdice & Hanif Sherali & Maria Forjaz**135-161 Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach***by*Guoyong Gu & Bingsheng He & Xiaoming Yuan**163-183 An affine scaling method for optimization problems with polyhedral constraints***by*William Hager & Hongchao Zhang**185-200 Exact computational approaches to a stochastic uncapacitated single allocation p-hub center problem***by*Edward Hult & Houyuan Jiang & Daniel Ralph**201-218 On error bounds and Newton-type methods for generalized Nash equilibrium problems***by*Alexey Izmailov & Mikhail Solodov**219-248 Approximation methods for complex polynomial optimization***by*Bo Jiang & Zhening Li & Shuzhong Zhang**249-262 Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints***by*Christian Kanzow & Alexandra Schwartz**263-284 A constrained optimization reformulation and a feasible descent direction method for $$L_{1/2}$$ L 1 / 2 regularization***by*Dong-Hui Li & Lei Wu & Zhe Sun & Xiong-ji Zhang**285-306 Optimal parameter selection for nonlinear multistage systems with time-delays***by*Chongyang Liu & Ryan Loxton & Kok Teo**307-319 Space tensor conic programming***by*Liqun Qi & Yinyu Ye**321-351 A regularized Newton method without line search for unconstrained optimization***by*Kenji Ueda & Nobuo Yamashita**353-377 A smoothing augmented Lagrangian method for solving simple bilevel programs***by*Mengwei Xu & Jane Ye**379-397 Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach***by*Xiaojin Zheng & Xiaoling Sun & Duan Li & Jie Sun

### 2014, Volume 58, Issue 3

**523-541 Adaptively refined dynamic program for linear spline regression***by*Noam Goldberg & Youngdae Kim & Sven Leyffer & Thomas Veselka**543-561 Robust registration of point sets using iteratively reweighted least squares***by*Per Bergström & Ove Edlund**563-595 Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms***by*Victor Blanco & Justo Puerto & Safae El Haj Ben Ali**597-618 On the semilocal convergence behavior for Halley’s method***by*Yonghui Ling & Xiubin Xu**619-644 POD a-posteriori error analysis for optimal control problems with mixed control-state constraints***by*Martin Gubisch & Stefan Volkwein**645-677 Adaptive POD basis computation for parametrized nonlinear systems using optimal snapshot location***by*Oliver Lass & Stefan Volkwein**679-705 Subgrid scale eddy viscosity finite element method on optimal control of system governed by unsteady Oseen equations***by*Gang Chen & Minfu Feng**707-756 A survey on multi-objective evolutionary algorithms for many-objective problems***by*Christian Lücken & Benjamín Barán & Carlos Brizuela**757-779 Implementation aspects of interactive multiobjective optimization for modeling environments: the case of GAMS-NIMBUS***by*Vesa Ojalehto & Kaisa Miettinen & Timo Laukkanen**781-806 Advanced particle swarm assisted genetic algorithm for constrained optimization problems***by*Manoj Dhadwal & Sung Jung & Chang Kim

### 2014, Volume 58, Issue 2

**273-322 The generalized trust region subproblem***by*Ting Pong & Henry Wolkowicz**323-346 Interior-point methods for nonconvex nonlinear programming: cubic regularization***by*Hande Benson & David Shanno**347-379 Robust least square semidefinite programming with applications***by*Guoyin Li & Alfred Ma & Ting Pong**381-407 Proximal methods for the latent group lasso penalty***by*Silvia Villa & Lorenzo Rosasco & Sofia Mosci & Alessandro Verri**409-421 A unified algorithm for mixed $$l_{2,p}$$ l 2 , p -minimizations and its application in feature selection***by*Liping Wang & Songcan Chen & Yuanping Wang**423-454 The space decomposition theory for a class of eigenvalue optimizations***by*Ming Huang & Li-Ping Pang & Zun-Quan Xia**455-482 A sparsity preserving stochastic gradient methods for sparse regression***by*Qihang Lin & Xi Chen & Javier Peña**483-501 CVaR-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems***by*Liyan Xu & Bo Yu**503-522 Determination of initial temperature in fast simulated annealing***by*Chang-Yong Lee & Dongju Lee

### 2014, Volume 58, Issue 1

**1-29 Efficient algorithms for robust and stable principal component pursuit problems***by*Necdet Aybat & Donald Goldfarb & Shiqian Ma**31-85 Approximate dynamic programming for stochastic N-stage optimization with application to optimal consumption under uncertainty***by*Mauro Gaggero & Giorgio Gnecco & Marcello Sanguineti**87-103 On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems***by*Zdeněk Dostál & David Horák & Petr Vodstrčil**105-132 Properties and methods for finding the best rank-one approximation to higher-order tensors***by*Yuning Yang & Qingzhi Yang & Liqun Qi**133-159 Semidefinite relaxations for semi-infinite polynomial programming***by*Li Wang & Feng Guo**161-185 Strategic oscillation for the quadratic multiple knapsack problem***by*Carlos García-Martínez & Fred Glover & Francisco Rodriguez & Manuel Lozano & Rafael Martí**187-203 A tabu search approach for proportionate multiprocessor open shop scheduling***by*Tamer Abdelmaguid & Mohamed Shalaby & Mohamed Awwad**205-224 Graph partitions for the multidimensional assignment problem***by*Chrysafis Vogiatzis & Eduardo Pasiliao & Panos Pardalos**225-247 Local convergence of quasi-Newton methods under metric regularity***by*F. Aragón Artacho & A. Belyakov & A. Dontchev & M. López**249-272 Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions***by*Bryan Gardiner & Khan Jakee & Yves Lucet

### 2014, Volume 57, Issue 3

**517-553 A class of distributed optimization methods with event-triggered communication***by*Martin Meinel & Michael Ulbrich & Sebastian Albrecht**555-597 Level bundle methods for constrained convex optimization with various oracles***by*Wim Ackooij & Welington Oliveira**599-621 A derivative-free algorithm for linearly constrained optimization problems***by*E. Gumma & M. Hashim & M. Ali**623-665 Curvature integrals and iteration complexities in SDP and symmetric cone programs***by*Satoshi Kakihara & Atsumi Ohara & Takashi Tsuchiya**667-684 On regularity conditions for complementarity problems***by*A. Izmailov & A. Kurennoy**685-702 A numerical method for nonconvex multi-objective optimal control problems***by*C. Kaya & Helmut Maurer**703-729 A priori error analysis of the upwind symmetric interior penalty Galerkin (SIPG) method for the optimal control problems governed by unsteady convection diffusion equations***by*Tuğba Akman & Hamdullah Yücel & Bülent Karasözen**731-760 Adaptive sequencing of primal, dual, and design steps in simulation based optimization***by*Torsten Bosse & Lutz Lehmann & Andreas Griewank**761-794 Enhancing performance of particle swarm optimization through an algorithmic link with genetic algorithms***by*Kalyanmoy Deb & Nikhil Padhye

### 2014, Volume 57, Issue 2

**271-306 An infeasible-point subgradient method using adaptive approximate projections***by*Dirk Lorenz & Marc Pfetsch & Andreas Tillmann**307-337 A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints***by*Ion Necoara & Andrei Patrascu**339-363 On the O(1/t) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators***by*Xingju Cai & Guoyong Gu & Bingsheng He**365-386 An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints***by*Dan Xue & Wenyu Sun & Liqun Qi**387-402 Lower bounds on the global minimum of a polynomial***by*M. Ghasemi & J. Lasserre & M. Marshall**403-415 On the computational complexity of membership problems for the completely positive cone and its dual***by*Peter Dickinson & Luuk Gijben**417-440 Global convergence of modified multiplicative updates for nonnegative matrix factorization***by*Norikazu Takahashi & Ryota Hibi**441-468 Optimizing a multi-stage production/inventory system by DC programming based approaches***by*Hoai Le Thi & Duc Tran**469-492 Parallel deterministic and stochastic global minimization of functions with very many minima***by*David Easterling & Layne Watson & Michael Madigan & Brent Castle & Michael Trosset**493-516 A particle swarm inspired multi-elitist artificial bee colony algorithm for real-parameter optimization***by*Yi Xiang & Yuming Peng & Yubin Zhong & Zhenyu Chen & Xuwen Lu & Xuejun Zhong

### 2014, Volume 57, Issue 1

**1-25 A superlinearly convergent R-regularized Newton scheme for variational models with concave sparsity-promoting priors***by*Michael Hintermüller & Tao Wu**27-43 A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization***by*Hongchao Zhang**45-69 Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems***by*Renato Monteiro & Camilo Ortiz & Benar Svaiter**71-104 A cutting-plane algorithm for solving a weighted influence interdiction problem***by*Mehdi Hemmati & J. Cole Smith & My Thai**105-127 Mixed-logit network pricing***by*François Gilbert & Patrice Marcotte & Gilles Savard**129-165 A generative model and a generalized trust region Newton method for noise reduction***by*Seppo Pulkkinen & Marko Mäkelä & Napsu Karmitsa**167-203 SDDP for some interstage dependent risk-averse problems and application to hydro-thermal planning***by*Vincent Guigues**205-240 Third order convergent time discretization for parabolic optimal control problems with control constraints***by*Andreas Springer & Boris Vexler**241-270 A minimum effort optimal control problem for the wave equation***by*Axel Kröner & Karl Kunisch

### 2013, Volume 56, Issue 3

**507-530 An efficient augmented Lagrangian method with applications to total variation minimization***by*Chengbo Li & Wotao Yin & Hong Jiang & Yin Zhang**531-558 Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming***by*Huixian Wu & Hezhi Luo & Xiaodong Ding & Guanting Chen**559-572 A customized proximal point algorithm for convex minimization with linear constraints***by*Bingsheng He & Xiaoming Yuan & Wenxing Zhang**573-597 A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming***by*María Gonzalez-Lima & Aurelio Oliveira & Danilo Oliveira**599-617 New smoothing SVM algorithm with tight error bound and efficient reduced techniques***by*Shuisheng Zhou & Jiangtao Cui & Feng Ye & Hongwei Liu & Qiang Zhu**619-633 A two-phase heuristic for the bottleneck k-hyperplane clustering problem***by*Edoardo Amaldi & Kanika Dhyani & Leo Liberti**635-674 Particle methods for stochastic optimal control problems***by*Pierre Carpentier & Guy Cohen & Anes Dallagi**675-721 Three new stochastic local search algorithms for continuous optimization problems***by*Sivashan Chetty & Aderemi Adewumi**723-734 Solving the median problem with continuous demand on a network***by*Rafael Blanquero & Emilio Carrizosa**735-764 Landscape analysis and efficient metaheuristics for solving the n-queens problem***by*Ellips Masehian & Hossein Akbaripour & Nasrin Mohabbati-Kalejahi

### 2013, Volume 56, Issue 2

**253-290 Preconditioning Newton–Krylov methods in nonconvex large scale optimization***by*Giovanni Fasano & Massimo Roma**291-315 CARTopt: a random search method for nonsmooth unconstrained optimization***by*B. Robertson & C. Price & M. Reale**317-341 Symmetric Perry conjugate gradient method***by*Dongyi Liu & Genqi Xu**343-368 Implementing the simplex method as a cutting-plane method, with a view to regularization***by*Csaba Fábián & Olga Papp & Krisztián Eretnek**369-403 A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints***by*Samuel Amstutz & Antoine Laurain**405-438 Lower and upper bounds for the spanning tree with minimum branch vertices***by*Francesco Carrabs & Raffaele Cerulli & Manlio Gaudioso & Monica Gentili**439-455 Frequency assignment in a SDMA satellite communication system with beam decentring feature***by*Kata Kiatmanaroj & Christian Artigues & Laurent Houssin & Frédéric Messine**457-480 Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms***by*Mahamed Omran & Salah al-Sharhan & Ayed Salman & Maurice Clerc**481-502 The continuous differential ant-stigmergy algorithm for numerical optimization***by*Peter Korošec & Jurij Šilc

### 2013, Volume 56, Issue 1

**1-38 A derivative-free approximate gradient sampling algorithm for finite minimax problems***by*W. Hare & J. Nutini**39-61 Using inexact gradients in a multilevel optimization algorithm***by*Robert Lewis & Stephen Nash**63-80 A Shamanskii-like Levenberg-Marquardt method for nonlinear equations***by*Jinyan Fan**81-96 A homotopy method for nonlinear semidefinite programming***by*Li Yang & Bo Yu**97-111 Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem***by*José Figueira & Luís Paquete & Marco Simões & Daniel Vanderpooten**113-130 Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations***by*Svyatoslav Trukhanov & Chitra Balasubramaniam & Balabhaskar Balasundaram & Sergiy Butenko**131-151 Error estimates for parabolic optimal control problems with control and state constraints***by*Wei Gong & Michael Hinze**153-185 On the optimal control of the Schlögl-model***by*Rico Buchholz & Harald Engel & Eileen Kammann & Fredi Tröltzsch**187-188 Erratum to: On the optimal control of the Schlögl-model***by*Rico Buchholz & Harald Engel & Eileen Kammann & Fredi Tröltzsch**189-208 Multi Agent Collaborative Search based on Tchebycheff decomposition***by*Federico Zuiani & Massimiliano Vasile**209-229 Parameter-less algorithm for evolutionary-based optimization***by*Gregor Papa**231-251 A simplex-based numerical framework for simple and efficient robust design optimization***by*Pietro Congedo & Jeroen Witteveen & Gianluca Iaccarino

### 2013, Volume 55, Issue 3

**545-570 An empirical evaluation of walk-and-round heuristics for mixed integer linear programs***by*Kuo-Ling Huang & Sanjay Mehrotra**571-596 Parallel distributed-memory simplex for large-scale stochastic LP problems***by*Miles Lubin & J. Hall & Cosmin Petra & Mihai Anitescu**597-645 Stochastic Nash equilibrium problems: sample average approximation and applications***by*Huifu Xu & Dali Zhang**647-674 A cutting plane algorithm for the Capacitated Connected Facility Location Problem***by*Stefan Gollowitzer & Bernard Gendron & Ivana Ljubić**675-702 Stable local volatility function calibration using spline kernel***by*Thomas Coleman & Yuying Li & Cheng Wang**703-731 A new method for solving Pareto eigenvalue complementarity problems***by*Samir Adly & Hadia Rammal**733-767 A smoothing-regularization approach to mathematical programs with vanishing constraints***by*Wolfgang Achtziger & Tim Hoheisel & Christian Kanzow**769-802 Optimal error estimates for finite element discretization of elliptic optimal control problems with finitely many pointwise state constraints***by*Dmitriy Leykekhman & Dominik Meidner & Boris Vexler

### 2013, Volume 55, Issue 2

**265-309 On sample size control in sample average approximations for solving smooth stochastic programs***by*Johannes Royset**311-340 A decomposition-based crash-start for stochastic programming***by*Marco Colombo & Andreas Grothey**341-377 Regularized robust optimization: the optimal portfolio execution case***by*Somayeh Moazeni & Thomas Coleman & Yuying Li**379-398 Tightening a copositive relaxation for standard quadratic optimization problems***by*Yong Xia & Ruey-Lin Sheu & Xiaoling Sun & Duan Li**399-425 Smoothing SQP algorithm for semismooth equations with box constraints***by*Changyu Wang & Qian Liu & Cheng Ma**427-457 Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures***by*A. Cassioli & L. Consolini & M. Locatelli & A. Longo**459-468 On an inexact gradient method using Proper Orthogonal Decomposition for parabolic optimal control problems***by*Christian Jörres & Georg Vossen & Michael Herty**469-480 Classification of companies using maximal margin ellipsoidal surfaces***by*Hiroshi Konno & Masato Saito**481-513 A novel differential evolution algorithm for binary optimization***by*Mina Husseinzadeh Kashan & Ali Husseinzadeh Kashan & Nasim Nahavandi**515-544 Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems***by*Sergio Nesmachnow

### 2013, Volume 55, Issue 1

**1-20 A computational study and survey of methods for the single-row facility layout problem***by*Philipp Hungerländer & Franz Rendl**21-47 SDP reformulation for robust optimization problems based on nonconvex QP duality***by*Ryoichi Nishimura & Shunsuke Hayashi & Masao Fukushima**49-71 A trust region method for solving semidefinite programs***by*Aiqun Huang & Chengxian Xu**73-73 Erratum to: A trust region method for solving semidefinite programs***by*Aiqun Huang & Chengxian Xu**75-111 Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems***by*Quoc Tran Dinh & Carlo Savorgnan & Moritz Diehl**113-135 Mixed-Integer Linear Programming Formulations for the Software Clustering Problem***by*Viviane Köhler & Marcia Fampa & Olinto Araújo**137-153 Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials***by*Sabine Burgdorf & Kristijan Cafuta & Igor Klep & Janez Povh**155-172 A second-order smooth penalty function algorithm for constrained optimization problems***by*Xinsheng Xu & Zhiqing Meng & Jianwu Sun & Liguo Huang & Rui Shen**173-196 Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization***by*Hongwei Liu & Xiangli Li**197-225 Relaxation methods for mixed-integer optimal control of partial differential equations***by*Falk Hante & Sebastian Sager**227-263 Vortex control of instationary channel flows using translation invariant cost functionals***by*H. Kasumba & K. Kunisch

### 2013, Volume 54, Issue 3

**461-472 A subgradient method for multiobjective optimization***by*J. Cruz Neto & G. Silva & O. Ferreira & J. Lopes**473-493 Inexact projected gradient method for vector optimization***by*Ellen Fukuda & L. Graña Drummond**495-516 Newton-like methods for efficient solutions in vector optimization***by*Thai Chuong**517-554 On convex quadratic programs with linear complementarity constraints***by*Lijie Bai & John Mitchell & Jong-Shi Pang**555-578 Improved constraint consensus methods for seeking feasibility in nonlinear programs***by*Laurence Smith & John Chinneck & Victor Aitken**579-593 Variable projection for nonlinear least squares problems***by*Dianne O’Leary & Bert Rust**595-617 An inexact restoration strategy for the globalization of the sSQP method***by*D. Fernández & E. Pilotta & G. Torres**619-643 The robust network loading problem with dynamic routing***by*Sara Mattia**645-673 The resource-constrained modulo scheduling problem: an experimental study***by*Maria Ayala & Abir Benabid & Christian Artigues & Claire Hanen**675-703 A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems***by*Hatem Fayed & Amir Atiya