## Content

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

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

### April 2016, Volume 63, Issue 3

**613-638 On an inexact trust-region SQP-filter method for constrained nonlinear optimization***by*Andrea Walther & Lorenz Biegler**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**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**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**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 Knudsen & Bjarne Grimstad**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**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**793-824 Finite element error estimates for an optimal control problem governed by the Burgers equation***by*Pedro Merino**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**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**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**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

### March 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 Coello**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 Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz**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**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**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 Izmailov & Mikhail Solodov**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**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**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 Gonzaga & Ruana Schneider**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**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**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

### January 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**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**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**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**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 Cunha & Luidi Simonetti & Abilio Lucena**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**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**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**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**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**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**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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

### April 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**705-705 Erratum to: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems***by*Hatem Fayed & Amir Atiya**707-739 A penalty function-based differential evolution algorithm for constrained global optimization***by*M. Ali & W. Zhu**741-770 Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm***by*Iztok Fister & Marjan Mernik & Bogdan Filipič**771-790 Self-adaptive differential evolution incorporating a heuristic mixing of operators***by*Saber Elsayed & Ruhul Sarker & Daryl Essam

### March 2013, Volume 54, Issue 2

**211-213 Guest editorial***by*Mario Bertero & Valeria Ruggiero & Luca Zanni**215-237 A full second order variational model for multiscale texture analysis***by*Maïtine Bergounioux & Loïc Piffet**239-262 A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems***by*Radu Boţ & Christopher Hendrich**263-282 Preconditioned iterative regularization in Banach spaces***by*Paola Brianzi & Fabio Di Benedetto & Claudio Estatico**283-315 Linear convergence analysis of the use of gradient projection methods on total variation problems***by*Pengwen Chen & Changfeng Gui**317-342 Bregman operator splitting with variable stepsize for total variation image reconstruction***by*Yunmei Chen & William Hager & Maryam Yashtini & Xiaojing Ye & Hongchao Zhang**343-369 An ADM-based splitting method for separable convex programming***by*Deren Han & Xiaoming Yuan & Wenxing Zhang & Xingju Cai**371-398 A class of quasi-variational inequalities for adaptive image denoising and decomposition***by*Frank Lenzen & Florian Becker & Jan Lellmann & Stefania Petra & Christoph Schnörr**399-416 An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography***by*Ignace Loris & Caroline Verhoeven**417-440 A cyclic projected gradient method***by*Simon Setzer & Gabriele Steidl & Jan Morgenthaler**441-459 Primal and dual alternating direction algorithms for ℓ 1 -ℓ 1 -norm minimization problems in compressive sensing***by*Yunhai Xiao & Hong Zhu & Soon-Yi Wu

### January 2013, Volume 54, Issue 1

**1-25 Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems***by*Serge Gratton & Selime Gürol & Philippe Toint**27-43 Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems***by*María Maciel & María Mendonça & Adriana Verdiell**45-64 Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization***by*Gonglin Yuan & Zengxin Wei & Zhongxing Wang**65-76 Convergence and perturbation resilience of dynamic string-averaging projection methods***by*Yair Censor & Alexander Zaslavski**77-91 An acceleration scheme for cyclic subgradient projections method***by*Touraj Nikazad & Mokhtar Abbasi**93-109 A practical but rigorous approach to sum-of-ratios optimization in geometric applications***by*Takahito Kuno & Toshiyuki Masaki**111-139 On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere***by*Lei-Hong Zhang**141-162 An efficient compact quadratic convex reformulation for general integer quadratic programs***by*Alain Billionnet & Sourour Elloumi & Amélie Lambert**163-187 A new Branch and Bound method for a discrete truss topology design problem***by*Adelaide Cerveira & Agostinho Agra & Fernando Bastos & Joaquim Gromicho**189-210 A lifting method for generalized semi-infinite programs based on lower level Wolfe duality***by*M. Diehl & B. Houska & O. Stein & P. Steuermann

### December 2012, Volume 53, Issue 3

**649-680 Branch and cut algorithms for detecting critical nodes in undirected graphs***by*Marco Di Summa & Andrea Grosso & Marco Locatelli**681-709 A local relaxation method for the cardinality constrained portfolio optimization problem***by*Walter Murray & Howard Shek**711-728 Computing the variance of tour costs over the solution space of the TSP in polynomial time***by*Paul Sutcliffe & Andrew Solomon & Jenny Edwards**729-753 A computational analysis of lower bounds for big bucket production planning problems***by*Kerem Akartunalı & Andrew Miller**755-769 Descentwise inexact proximal algorithms for smooth optimization***by*Marc Fuentes & Jérôme Malick & Claude Lemaréchal**771-794 Constrained Dogleg methods for nonlinear systems with simple bounds***by*Stefania Bellavia & Maria Macconi & Sandra Pieraccini**795-806 A new modified nonmonotone adaptive trust region method for unconstrained optimization***by*Zhaocheng Cui & Boying Wu**807-821 Generalized weak sharp minima in cone-constrained convex optimization with applications***by*H. Luo & X. Huang & J. Peng**823-844 Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization***by*Hayato Waki & Maho Nakata & Masakazu Muramatsu**845-867 On solving biquadratic optimization via semidefinite relaxation***by*Yuning Yang & Qingzhi Yang**869-902 A genetic algorithm based augmented Lagrangian method for constrained optimization***by*Kalyanmoy Deb & Soumil Srivastava**903-931 Computational optimization strategies for the simulation of random media and components***by*Edoardo Patelli & Gerhart Schuëller

### October 2012, Volume 53, Issue 2

**297-299 Guest editorial***by*Gianni Pillo & Massimo Roma**301-322 Margin maximization in spherical separation***by*Annabella Astorino & Antonio Fuduli & Manlio Gaudioso**323-346 Gap functions and penalization for solving equilibrium problems with nonlinear constraints***by*Giancarlo Bigi & Mauro Passacantando**347-373 Evaluating bound-constrained minimization software***by*Ernesto Birgin & Jan Gentil**375-393 Convergence of distributed optimal control problems governed by elliptic variational inequalities***by*Mahdi Boukrouche & Domingo Tarzia**395-423 An active set feasible method for large-scale minimization problems with bound constraints***by*M. Santis & G. Pillo & S. Lucidi**425-452 Active-set Newton methods for mathematical programs with vanishing constraints***by*A. Izmailov & A. Pogosyan**453-483 Interior point methods for equilibrium problems***by*Nils Langenberg**485-503 Approximate values for mathematical programs with variational inequality constraints***by*M. Lignola & Jacqueline Morgan**505-526 Derivative-free methods for bound constrained mixed-integer optimization***by*G. Liuzzi & S. Lucidi & F. Rinaldi**527-555 On the convergence of trust region algorithms for unconstrained minimization without derivatives***by*M. Powell**557-589 Convergence analysis of a proximal Gauss-Newton method***by*Saverio Salzo & Silvia Villa**591-617 Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems***by*V. Simoncini**619-648 Strong duality and minimal representations for cone optimization***by*Levent Tunçel & Henry Wolkowicz

### September 2012, Volume 53, Issue 1

**1-22 Updating the regularization parameter in the adaptive cubic regularization algorithm***by*N. Gould & M. Porcelli & P. Toint**23-44 Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints***by*Ting Pong**45-89 An inexact spectral bundle method for convex quadratic semidefinite programming***by*Huiling Lin**91-113 Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems***by*Ting-Jang Shiu & Soon-Yi Wu**115-130 The nearest point problem in a polyhedral set and its extensions***by*Zhe Liu & Yahya Fathi**131-153 An intermodal multicommodity routing problem with scheduled services***by*Burak Ayar & Hande Yaman**155-171 A measure space approach to optimal source placement***by*Christian Clason & Karl Kunisch**173-206 A general theorem on error estimates with application to a quasilinear elliptic optimal control problem***by*Eduardo Casas & Fredi Tröltzsch**207-226 Convergence of the forward-backward sweep method in optimal control***by*Michael McAsey & Libin Mou & Weimin Han**227-248 Balanced POD for linear PDE robust control computations***by*John Singler & Belinda Batten**249-270 A hybrid ODE-based method for unconstrained optimization problems***by*Yi-gui Ou & Guan-shu Wang**271-295 A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization***by*Abbas El Dor & Maurice Clerc & Patrick Siarry

### July 2012, Volume 52, Issue 3

**583-607 A nonmonotone filter method for nonlinear optimization***by*Chungen Shen & Sven Leyffer & Roger Fletcher**609-627 Comparing SOS and SDP relaxations of sensor network localization***by*João Gouveia & Ting Pong**629-644 An exact method with variable fixing for solving the generalized assignment problem***by*Marius Posta & Jacques Ferland & Philippe Michelon**645-666 A polynomial optimization approach to constant rebalanced portfolio selection***by*Yuichi Takano & Renata Sotirov**667-689 Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem***by*S. Anand & S. Saravanasankar & P. Subbaraj**691-717 Vortex control in channel flows using translational invariant cost functionals***by*H. Kasumba & K. Kunisch**719-756 Error estimates for the numerical approximation of Neumann control problems governed by a class of quasilinear elliptic equations***by*Eduardo Casas & Vili Dhamo**757-784 Optimization of mixed variational inequalities arising in flow of viscoplastic materials***by*Juan Reyes**785-803 A Lyusternik–Graves theorem for the proximal point method***by*Francisco Aragón Artacho & Michaël Gaydu**805-824 Properties and construction of NCP functions***by*Aurél Galántai**825-843 An efficient simultaneous method for the constrained multiple-sets split feasibility problem***by*Wenxing Zhang & Deren Han & Xiaoming Yuan**845-867 PAINT: Pareto front interpolation for nonlinear multiobjective optimization***by*Markus Hartikainen & Kaisa Miettinen & Margaret Wiecek

### June 2012, Volume 52, Issue 2

**315-344 A preconditioning technique for Schur complement systems arising in stochastic optimization***by*Cosmin Petra & Mihai Anitescu**345-371 Scaling linear optimization problems prior to application of the simplex method***by*Joseph Elble & Nikolaos Sahinidis**373-391 A Predictor-corrector algorithm with multiple corrections for convex quadratic programming***by*Zhongyi Liu & Yue Chen & Wenyu Sun & Zhihui Wei**393-408 A combined class of self-scaling and modified quasi-Newton methods***by*Mehiddin Al-Baali & Humaid Khalfan**409-414 A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei***by*Saman Babaie-Kafaki**415-437 Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints***by*Ming Hu & Masao Fukushima**439-461 An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures***by*Min Tao & Xiaoming Yuan**463-481 Robust portfolio optimization: a conic programming approach***by*Kai Ye & Panos Parpas & Berç Rustem**483-506 Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts***by*Hanif Sherali & Evrim Dalkiran & Jitamitra Desai**507-535 Automated knowledge source selection and service composition***by*Patrick Bless & Diego Klabjan & Soo Chang**537-558 Mixed-integer nonlinear programs featuring “on/off” constraints***by*Hassan Hijazi & Pierre Bonami & Gérard Cornuéjols & Adam Ouorou**559-581 Optimal control of Maxwell’s equations with regularized state constraints***by*Irwin Yousept

### May 2012, Volume 52, Issue 1

**1-2 Introduction***by*Fredi Tröltzsch & Arnd Rösch**3-28 Finite element error estimates for Neumann boundary control problems on graded meshes***by*Thomas Apel & Johannes Pfefferer & Arnd Rösch**29-68 Cooperation and competition in multidisciplinary optimization***by*Jean-Antoine Désidéri**69-85 On a Kohn-Vogelius like formulation of free boundary problems***by*Karsten Eppler & Helmut Harbrecht**87-114 Stability of semilinear elliptic optimal control problems with pointwise state constraints***by*M. Hinze & C. Meyer**115-146 The discretizable molecular distance geometry problem***by*Carlile Lavor & Leo Liberti & Nelson Maculan & Antonio Mucherino**147-179 Sensitivity analysis of hyperbolic optimal control problems***by*Adam Kowalewski & Irena Lasiecka & Jan Sokołowski**181-207 Regularization for semilinear elliptic optimal control problems with pointwise state and control constraints***by*Klaus Krumbiegel & Ira Neitzel & Arnd Rösch**209-238 Local path-following property of inexact interior methods in nonlinear programming***by*Paul Armand & Joël Benoist & Jean-Pierre Dussault**239-266 A filter trust-region algorithm for unconstrained optimization with strong global convergence properties***by*M. Fatemi & N. Mahdavi-Amiri**267-280 A nonmonotone PSB algorithm for solving unconstrained optimization***by*Jiao Li & Yu-Fei Yang & Bo Yu**281-292 A numerical algorithm for finding solutions of a generalized Nash equilibrium problem***by*Luiz Matioli & Wilfredo Sosa & Jinyun Yuan**293-314 Numerical methods for A-optimal designs with a sparsity constraint for ill-posed inverse problems***by*Eldad Haber & Zhuojun Magnant & Christian Lucero & Luis Tenorio

### April 2012, Volume 51, Issue 3

**941-965 Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization***by*Ernesto Birgin & J. Martínez**967-979 Using approximate secant equations in limited memory methods for multilevel unconstrained optimization***by*Serge Gratton & Vincent Malmedy & Philippe Toint**981-999 Inexact trust region PGC method for large sparse unconstrained optimization***by*Junxiang Li & Limei Yan & Shudong Li & Jiazhen Huo**1001-1036 A constraint-reduced variant of Mehrotra’s predictor-corrector algorithm***by*Luke Winternitz & Stacey Nicholls & André Tits & Dianne O’Leary**1037-1063 A proximal point algorithm for the monotone second-order cone complementarity problem***by*Jia Wu & Jein-Shan Chen**1065-1088 On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints***by*Yair Censor & Wei Chen & Patrick Combettes & Ran Davidi & Gabor Herman**1089-1095 How good are extrapolated bi-projection methods for linear feasibility problems?***by*Nicholas Gould**1097-1117 A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem***by*Hoai Le Thi & Mahdi Moeini & Tao Pham Dinh & Joaquim Judice**1119-1135 Reconstructing a matrix from a partial sampling of Pareto eigenvalues***by*Pedro Gajardo & Alberto Seeger**1137-1161 Parameter identification in financial market models with a feasible point SQP algorithm***by*F. Gerlich & A. Giese & J. Maruhn & E. Sachs**1163-1171 Non-monotone projection gradient method for non-negative matrix factorization***by*Xiangli Li & Hongwei Liu & Xiuyun Zheng**1173-1210 Generating equidistant representations in biobjective programming***by*Stacey Faulkenberg & Margaret Wiecek**1211-1229 A combinatorial optimization algorithm for solving the branchwidth problem***by*J. Smith & Elif Ulusal & Illya Hicks**1231-1252 Heuristics for a project management problem with incompatibility and assignment costs***by*Nicolas Zufferey & Olivier Labarthe & David Schindl**1253-1274 New dominance rules and exploration strategies for the 1|r i |∑U i scheduling problem***by*Gio Kao & Edward Sewell & Sheldon Jacobson & Shane Hall**1275-1295 A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand***by*Jianlin Jiang & Xiaoming Yuan**1297-1317 A benchmark library and a comparison of heuristic methods for the linear ordering problem***by*Rafael Martí & Gerhard Reinelt & Abraham Duarte**1319-1343 Numerical approximation of elliptic control problems with finitely many pointwise constraints***by*Eduardo Casas & Mariano Mateos**1345-1373 Path-following for optimal control of stationary variational inequalities***by*Karl Kunisch & Daniel Wachsmuth**1375-1396 Capital rationing problems under uncertainty and risk***by*Patrizia Beraldi & Maria Bruni & Antonio Violi**1397-1408 Two complexity results on c-optimality in experimental design***by*Michal Černý & Milan Hladík

### March 2012, Volume 51, Issue 2

**457-480 Matrix-free interior point method***by*Jacek Gondzio**481-507 On the local convergence of a derivative-free algorithm for least-squares minimization***by*Hongchao Zhang & Andrew Conn**509-532 Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation***by*Julia Higle & Lei Zhao**533-550 A local search algorithm for ray-convex polyhedron intersection***by*Bernardo Llanas & Francisco Sáinz**551-573 A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization***by*Sha Lu & Zengxin Wei & Lue Li**575-600 Univariate cubic L 1 interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties***by*Qingwei Jin & Lu Yu & John Lavery & Shu-Cherng Fang**601-622 Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise***by*Takehiko Nakama**623-648 Neural networks for solving second-order cone constrained variational inequality problem***by*Juhe Sun & Jein-Shan Chen & Chun-Hsu Ko**649-679 Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods***by*Bingsheng He & Li-Zhi Liao & Xiang Wang**681-708 Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments***by*Bingsheng He & Li-Zhi Liao & Xiang Wang**709-728 Iterative methods for solving monotone equilibrium problems via dual gap functions***by*Tran Quoc & Le Muu**729-747 Heuristics for convex mixed integer nonlinear programs***by*Pierre Bonami & João Gonçalves**749-781 Solving VLSI design and DNA sequencing problems using bipartization of graphs***by*Pierre Fouilhoux & A. Mahjoub**783-807 A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems***by*Mhand Hifi & Toufik Saadi**809-834 Solving survivable two-layer network design problems by metric inequalities***by*Sara Mattia**835-866 Multigrid second-order accurate solution of parabolic control-constrained problems***by*S. González Andrade & A. Borzì**867-882 Virtual control regularization of state constrained linear quadratic optimal control problems***by*Matthias Gerdts & Björn Hüpping**883-908 Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs***by*Sven Beuchler & Clemens Pechstein & Daniel Wachsmuth**909-930 Adjoint IMEX-based schemes for control problems governed by hyperbolic conservation laws***by*Mapundi Banda & Michael Herty**931-939 A note on the approximation of elliptic control problems with bang-bang controls***by*Klaus Deckelnick & Michael Hinze

### January 2012, Volume 51, Issue 1

**1-25 A primal-dual augmented Lagrangian***by*Philip Gill & Daniel Robinson**27-49 TRESNEI, a Matlab trust-region solver for systems of nonlinear equalities and inequalities***by*Benedetta Morini & Margherita Porcelli**51-75 The impact of sampling methods on bias and variance in stochastic linear programs***by*Michael Freimer & Jeffrey Linderoth & Douglas Thomas**77-123 Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms***by*Ankur Kulkarni & Uday Shanbhag**125-157 Adaptive constraint reduction for convex quadratic programming***by*Jin Jung & Dianne O’Leary & André Tits**159-173 A secant method for nonlinear least-squares minimization***by*Wei Xu & Thomas Coleman & Gang Liu**175-197 A smoothing SQP method for nonlinear programs with stability constraints arising from power systems***by*Xiaojiao Tong & Liqun Qi & Soon-Yi Wu & Felix Wu**199-221 Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints***by*A. Izmailov & A. Pogosyan & M. Solodov**223-239 Overlapping restricted additive Schwarz method applied to the linear complementarity problem with an H-matrix***by*Haijian Yang & Qingguo Li**241-257 Rank-two update algorithms for the minimum volume enclosing ellipsoid problem***by*Wei-jie Cong & Hong-wei Liu & Feng Ye & Shui-sheng Zhou**259-277 Implementing the Nelder-Mead simplex algorithm with adaptive parameters***by*Fuchang Gao & Lixing Han**279-303 Machine learning for global optimization***by*A. Cassioli & D. Di Lorenzo & M. Locatelli & F. Schoen & M. Sciandrone**305-321 Monte Carlo algorithm for trajectory optimization based on Markovian readings***by*Ronaldo Dias & Nancy Garcia & Adriano Zambom**323-344 Partitioning planar graphs: a fast combinatorial approach for max-cut***by*F. Liers & G. Pardella**345-361 Kernel Search: a new heuristic framework for portfolio selection***by*Enrico Angelelli & Renata Mansini & M. Speranza**363-385 A branch-and-price approach for harvest scheduling subject to maximum area restrictions***by*Isabel Martins & Filipe Alvelos & Miguel Constantino**387-409 Semi-Lagrangian relaxation applied to the uncapacitated facility location problem***by*C. Beltran-Royo & J.-P. Vial & A. Alonso-Ayuso**411-435 A GRASP based on DE to solve single machine scheduling problem with SDST***by*Hanen Akrout & Bassem Jarboui & Patrick Siarry & Abdelwaheb Rebaï**437-455 An efficient label setting/correcting shortest path algorithm***by*Antonio Sedeño-Noda & Carlos González-Martín

### December 2011, Volume 50, Issue 3

**463-464 International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences***by*Hoai Le Thi & Joaquim Judice**465-482 Multi-product lot-sizing and sequencing on a single imperfect machine***by*A. Dolgui & M. Kovalyov & K. Shchamialiova**483-506 Genetic Tabu search for robust fixed channel assignment under dynamic traffic data***by*Hakim Mabed & Alexandre Caminada & Jin-Kao Hao**507-524 On solving Linear Complementarity Problems by DC programming and DCA***by*Hoai Le Thi & Tao Pham Dinh**525-554 An efficient DC programming approach for portfolio decision with higher moments***by*Tao Pham Dinh & Yi-Shuai Niu**555-590 Inexact restoration method for minimization problems arising in electronic structure calculations***by*Juliano Francisco & J. Martínez & Leandro Martínez & Feodor Pisnitchenko**591-595 On solving the dual for portfolio selection by optimizing Conditional Value at Risk***by*Włodzimierz Ogryczak & Tomasz Śliwiński**597-617 Gradient algorithms for quadratic optimization with fast convergence rates***by*Luc Pronzato & Anatoly Zhigljavsky**619-628 Counterexamples to a triality theorem in “Canonical dual least square method”***by*M. Voisei & C. Zălinescu

### October 2011, Volume 50, Issue 2

**189-192 Foreword***by*Xiaojun Chen & Masao Fukushima**193-221 The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions***by*Hannes Buchholzer & Christian Kanzow & Peter Knabner & Serge Kräutle**223-236 An interior-point path-following algorithm for computing a Leontief economy equilibrium***by*Chuangyin Dang & Yinyu Ye & Zhisu Zhu**237-262 Decomposition algorithms for generalized potential games***by*Francisco Facchinei & Veronica Piccialli & Marco Sciandrone**263-286 Pricing American options with uncertain volatility through stochastic linear complementarity models***by*Kenji Hamatani & Masao Fukushima**287-326 Network capacity management under competition***by*Houyuan Jiang & Zhan Pang**327-349 Block relaxation and majorization methods for the nearest correlation matrix with factor structure***by*Qingna Li & Houduo Qi & Naihua Xiu**351-378 A smoothing Newton-type method for solving the L 2 spectral estimation problem with lower and upper bounds***by*Chen Ling & Hongxia Yin & Guanglu Zhou**379-401 A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure***by*Fanwen Meng & Jie Sun & Mark Goh**403-423 Computation of generalized differentials in nonlinear complementarity problems***by*Shuhuang Xiang & Xiaojun Chen**425-444 Compression and denoising using l 0 -norm***by*Andy Yau & Xuecheng Tai & Michael Ng**445-461 A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem***by*Liping Zhang & Soon-Yi Wu

### September 2011, Volume 50, Issue 1

**1-22 Approximating Hessians in unconstrained optimization arising from discretized problems***by*Vincent Malmedy & Philippe Toint**23-48 Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems***by*Axel Dreves & Christian Kanzow**49-73 A new class of penalized NCP-functions and its properties***by*J.-S. Chen & Z.-H. Huang & C.-Y. She**75-110 Some aspects of reachability for parabolic boundary control problems with control constraints***by*Vili Dhamo & Fredi Tröltzsch**111-145 A smooth penalty approach and a nonlinear multigrid algorithm for elliptic MPECs***by*M. Hintermüller & I. Kopacka**147-162 Shape optimization of an airfoil in the presence of compressible and viscous flows***by*B. Farhadinia**163-188 A realization of constraint feasibility in a moving least squares response surface based approximate optimization***by*Chang Song & Jongsoo Lee

### July 2011, Volume 49, Issue 3

**407-433 A framework for analyzing sub-optimal performance of local search algorithms***by*Alexander Nikolaev & Sheldon Jacobson & Shane Hall & Darrall Henderson**435-456 An active index algorithm for the nearest point problem in a polyhedral cone***by*Zhe Liu & Yahya Fathi**457-491 The penalized Fischer-Burmeister SOC complementarity function***by*Shaohua Pan & Jein-Shan Chen & Sangho Kum & Yongdo Lim**493-520 A new hybrid method for nonlinear complementarity problems***by*Shao-Jian Qu & Mark Goh & Xiujie Zhang**521-548 Reduced quasi-Newton method for simultaneous design and optimization***by*Adel Hamdi & Andreas Griewank**549-566 Elliptic control problems with gradient constraints—variational discrete versus piecewise constant controls***by*Andreas Günther & Michael Hinze**567-600 Optimal control of the Stokes equations: conforming and non-conforming finite element methods under reduced regularity***by*Serge Nicaise & Dieter Sirch

### May 2011, Volume 49, Issue 1

**1-15 Direct search algorithm for bilevel programming problems***by*Ayalew Mersha & Stephan Dempe**17-29 An improved proximal alternating direction method for monotone variational inequalities with separable structure***by*Xiaoming Yuan**31-59 A reduced Hessian SQP method for inequality constrained optimization***by*Tao-Wen Liu**61-99 A class of nonlinear Lagrangians for nonconvex second order cone programming***by*Liwei Zhang & Jian Gu & Xiantao Xiao**101-122 Augmented Lagrangian for cone constrained topology optimization***by*Samuel Amstutz**123-147 Optimal boundary control of the wave equation with pointwise control constraints***by*Martin Gugat & Volker Grimm**149-178 Numerical solution for optimal control of the reaction-diffusion equations in cardiac electrophysiology***by*Chamakuri Nagaiah & Karl Kunisch & Gernot Plank**179-192 Generalized viscosity approximation methods in multiobjective optimization problems***by*Zhe Chen**193-212 Minimum power multicasting in wireless networks under probabilistic node failures***by*János Barta & Valeria Leggieri & Roberto Montemanni & Paolo Nobili & Chefi Triki

### April 2011, Volume 48, Issue 3

**423-452 Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints***by*Koichi Nabetani & Paul Tseng & Masao Fukushima**453-485 Corrector-predictor methods for sufficient linear complementarity problems***by*Filiz Gurtuna & Cosmin Petra & Florian Potra & Olena Shevchenko & Adrian Vancea**487-514 Weighted variational inequalities in non-pivot Hilbert spaces with applications***by*Annamaria Barbagallo & Stéphane Pia**515-532 Sufficient descent directions in unconstrained optimization***by*Xiao-Min An & Dong-Hui Li & Yunhai Xiao**533-551 Planning wireless networks by shortest path***by*C. Mannino & S. Mattia & A. Sassano**553-579 Sensitivity analysis and calibration of the covariance matrix for stable portfolio selection***by*Vincent Guigues**581-600 Discretization of interior point methods for state constrained elliptic optimal control problems: optimal error estimates and parameter adjustment***by*Michael Hinze & Anton Schiela**601-633 A globally convergent semi-smooth Newton method for control-state constrained DAE optimal control problems***by*Matthias Gerdts & Martin Kunkel**635-652 A global optimization method for the design of space trajectories***by*Bernardetta Addis & Andrea Cassioli & Marco Locatelli & Fabio Schoen**653-673 Relaxing the optimality conditions of box QP***by*Samuel Burer & Jieqiu Chen**675-695 Covering a polygonal region by rectangles***by*Y. Stoyan & T. Romanova & G. Scheithauer & A. Krivulya**697-715 Tabu search for the linear ordering problem with cumulative costs***by*Abraham Duarte & Manuel Laguna & Rafael Martí**717-745 Primal-dual interior-point method for thermodynamic gas-particle partitioning***by*Alexandre Caboussat

### January 2011, Volume 48, Issue 1

**1-21 Local convergence analysis of inexact Newton-like methods under majorant condition***by*O. Ferreira & M. Gonçalves**23-44 Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints***by*Zdeněk Dostál & Marta Domorádová & Marie Sadowská**45-58 A globally and quadratically convergent method for absolute value equations***by*Louis Caccetta & Biao Qu & Guanglu Zhou**59-70 An improved trust region algorithm for nonlinear equations***by*Jinyan Fan & Jianyu Pan**71-90 A cyclic scheduling problem with an undetermined number of parallel identical processors***by*Přemysl Šůcha & Zdeněk Hanzálek**91-108 How much do we “pay” for using default parameters?***by*Mustafa Baz & Brady Hunsaker & Oleg Prokopyev**109-138 A fast steady-state ε-dominance multi-objective evolutionary algorithm***by*Minqiang Li & Liu Liu & Dan Lin**139-155 Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems***by*Li-Ning Xing & Ying-Wu Chen & Ke-Wei Yang

### November 2010, Volume 47, Issue 3

**377-400 Duality-based algorithms for total-variation-regularized image restoration***by*Mingqiang Zhu & Stephen Wright & Tony Chan**401-429 Exact penalties for variational inequalities with applications to nonlinear complementarity problems***by*Thiago André & Paulo Silva**431-453 Using an iterative linear solver in an interior-point method for generating support vector machines***by*E. Gertz & Joshua Griffin**455-476 Variable target value relaxed alternating projection method***by*A. Cegielski & R. Dylewski**477-499 An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming***by*Jein-Shan Chen & Shaohua Pan**501-527 An aggregate deformation homotopy method for min-max-min problems with max-min constraints***by*Hui-juan Xiong & Bo Yu**529-552 Multiple machine continuous setup lotsizing with sequence-dependent setups***by*Bernardo Almada-Lobo & Diego Klabjan & Maria Carravilla & José Oliveira**553-566 Flexible-attribute problems***by*Jurij Mihelič & Borut Robič

### October 2010, Volume 47, Issue 2

**179-206 A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training***by*Paul Tseng & Sangwoon Yun**207-235 An iterative approach for cone complementarity problems for nonsmooth dynamics***by*Mihai Anitescu & Alessandro Tasora**237-255 Convergence analysis of a modified BFGS method on convex minimizations***by*Gonglin Yuan & Zengxin Wei**257-288 An algorithm for nonlinear optimization problems with binary variables***by*Walter Murray & Kien-Ming Ng**289-305 A new strategy for the undirected two-commodity maximum flow problem***by*A. Sedeño-Noda & C. González-Martín & S. Alonso-Rodríguez**307-333 Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite***by*Djamal Habet & Michel Vasquez & Yannick Vimont**335-347 Canonical dual least square method for solving general nonlinear systems of quadratic equations***by*N. Ruan & David Gao & Y. Jiao**349-376 Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling***by*M. Baglietto & C. Cervellera & M. Sanguineti & R. Zoppoli

### September 2010, Volume 47, Issue 1

**1-31 A relaxation algorithm with a probabilistic guarantee for robust deviation optimization***by*Akiko Takeda & Shunsuke Taguchi & Tsutomu Tanaka**33-59 Extended duality for nonlinear programming***by*Yixin Chen & Minmin Chen**61-76 Solving job shop scheduling problems utilizing the properties of backbone and “big valley”***by*Panos Pardalos & Oleg Shylo & Alkis Vazacopoulos**77-96 Route planning for agent-based information retrieval***by*Irene Sygkouna & Marios-Polychronis Drakos & Miltiades Anagnostou**97-128 Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources***by*Omid Bozorg Haddad & Mahsa Mirmomeni & Mahboubeh Zarezadeh Mehrizi & Miguel Mariño**129-131 Morse potential energy minimization: Improved bounds for optimal configurations***by*Bernardetta Addis & Werner Schachinger**133-159 A posteriori error estimates for a finite element discretization of interior point methods for an elliptic optimization problem with state constraints***by*W. Wollner**161-178 Numerical approximation of the LQR problem in a strongly damped wave equation***by*Erwin Hernández & Dante Kalise & Enrique Otárola

### July 2010, Volume 46, Issue 3

**391-415 Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization***by*Churlzu Lim & Hanif Sherali & Stan Uryasev**417-426 Multi-step methods for choosing the best set of variables in regression analysis***by*Hiroshi Konno & Yoshihiro Takaya**427-450 A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem***by*João Claro & Jorge Sousa**451-466 A comparison of feasible direction methods for the stochastic transportation problem***by*Maria Daneva & Torbjörn Larsson & Michael Patriksson & Clas Rydergren**467-486 Concave programming for minimizing the zero-norm over polyhedral sets***by*F. Rinaldi & F. Schoen & M. Sciandrone**487-510 Variational discretization of Lavrentiev-regularized state constrained elliptic optimal control problems***by*M. Hinze & C. Meyer**511-533 Adaptive finite element methods for mixed control-state constrained optimal control problems for elliptic boundary value problems***by*R. Hoppe & M. Kieweg**535-569 A shape and topology optimization technique for solving a class of linear complementarity problems in function space***by*M. Hintermüller & A. Laurain

### June 2010, Volume 46, Issue 2

**189-191 Preface***by*Ernesto Birgin**193-215 Globalization strategies for Mesh Adaptive Direct Search***by*Charles Audet & J. Dennis & Sébastien Digabel**217-227 Residual algorithm for large-scale positive definite generalized eigenvalue problems***by*Lenys Bello & William La Cruz & Marcos Raydan**229-245 Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians***by*Emerson Castelani & André Martinez & J. Martínez & B. Svaiter**247-263 Convergence of direct methods for paramonotone variational inequalities***by*J. Bello Cruz & A. Iusem**265-278 Incorporating minimum Frobenius norm models in direct search***by*A. Custódio & H. Rocha & L. Vicente**279-304 Proximal methods for nonlinear programming: double regularization and inexact subproblems***by*Jonathan Eckstein & Paulo Silva**305-332 Incremental-like bundle methods with application to energy planning***by*Grégory Emiel & Claudia Sagastizábal**333-346 A new line search inexact restoration approach for nonlinear programming***by*Andreas Fischer & Ana Friedlander**347-368 Inexact Josephy–Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization***by*A. Izmailov & M. Solodov**369-389 A model for optimal execution of atomic orders***by*Miles Kumaresan & Nataša Krejić

### May 2010, Volume 46, Issue 1

**1-29 A parallel interior point decomposition algorithm for block angular semidefinite programs***by*Kartik Sivaramakrishnan**31-49 Some non-interior path-following methods based on a scaled central path for linear complementarity problems***by*Wang Qinggang & Zhao Jinling & Yang Qingzhi**51-73 A column generation method for the multiple-choice multi-dimensional knapsack problem***by*N. Cherfi & M. Hifi**75-92 Covering a compact polygonal set by identical circles***by*Y. Stoyan & V. Patsuk**93-111 Approximation of low rank solutions for linear quadratic control of partial differential equations***by*Kirsten Morris & Carmeliza Navasca**113-133 α-Conservative approximation for probabilistically constrained convex programs***by*Yuichi Takano & Jun-ya Gotoh**135-157 Multi-objective Pareto-optimal control: an application to wastewater management***by*L. Alvarez-Vázquez & N. García-Chan & A. Martínez & M. Vázquez-Méndez**159-188 A multi-objective optimization evolutionary algorithm incorporating preference information based on fuzzy logic***by*Xiaoning Shen & Yu Guo & Qingwei Chen & Weili Hu

### April 2010, Volume 45, Issue 3

**475-493 Efficient preprocessing for VLSI optimization problems***by*W. Hare & M. Liu & T. Terlaky**495-520 New approach for the nonlinear programming with transient stability constraints arising from power systems***by*Xiaojiao Tong & Soon-Yi Wu & Renjun Zhou**521-541 A penalized nonparametric method for nonlinear constrained optimization based on noisy data***by*Ronaldo Dias & Nancy Garcia & Adriano Zambom**543-555 A computational study of exact knapsack separation for the generalized assignment problem***by*Pasquale Avella & Maurizio Boccia & Igor Vasilyev**557-579 Smoothing algorithms for complementarity problems over symmetric cones***by*Zheng-Hai Huang & Tie Ni**581-606 A one-parametric class of merit functions for the second-order cone complementarity problem***by*Jein-Shan Chen & Shaohua Pan**607-638 Solving chance-constrained combinatorial problems to optimality***by*Olivier Klopfenstein**639-661 Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions***by*Akbar Karimi & Hadi Nobahari & Patrick Siarry

### January 2010, Volume 45, Issue 1

**1-24 An inexact modified subgradient algorithm for nonconvex optimization***by*Regina Burachik & C. Kaya & Musa Mammadov**25-57 Cone-constrained eigenvalue problems: theory and algorithms***by*A. Pinto da Costa & A. Seeger**59-88 A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions***by*Shaohua Pan & Jein-Shan Chen**89-109 Some projection-like methods for the generalized Nash equilibria***by*Jianzhong Zhang & Biao Qu & Naihua Xiu**111-141 Heuristics for the facility location and design (1|1)-centroid problem on the plane***by*J. Redondo & J. Fernández & I. García & P. Ortigosa**143-158 Fast paths in large-scale dynamic road networks***by*Giacomo Nannicini & Philippe Baptiste & Gilles Barbier & Daniel Krob & Leo Liberti**159-179 An algorithm for the estimation of a regression function by continuous piecewise linear functions***by*Adil Bagirov & Conny Clausen & Michael Kohler**181-203 OSiL: An instance language for optimization***by*Robert Fourer & Jun Ma & Kipp Martin

### December 2009, Volume 45, Issue 4

**499-531 Interval propagation and search on directed acyclic graphs for numerical constraint solving***by*Xuan-Ha Vu & Hermann Schichl & Djamila Sam-Haroud**533-549 Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint***by*Harish Palanthandalam-Madapusi & Tobin Van Pelt & Dennis Bernstein**551-563 Set containment characterization for quasiconvex programming***by*Satoshi Suzuki & Daishi Kuroiwa**565-581 On the existence of solutions to quasivariational inclusion problems***by*Nguyen Hai & Phan Khanh & Nguyen Quan**583-595 Stability of semi-infinite vector optimization problems under functional perturbations***by*T. Chuong & N. Huy & J. Yao**597-613 Equivalence theorem, consistency and axiomatizations of a multi-choice value***by*Yan-An Hwang & Yu-Hsien Liao**615-629 Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions***by*Qingxiang Zhang**631-644 Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization***by*Paul-Emile Maingé**645-666 On optimal zero-preserving corrections for inconsistent linear systems***by*Paula Amaral & Luís Fernandes & Joaquim Júdice & Hanif Sherali

### December 2009, Volume 44, Issue 3

**363-372 On equivalent reformulations for absolute value equations***by*Oleg Prokopyev**373-383 Improved convergence order for augmented penalty algorithms***by*Jean-Pierre Dussault**385-409 A bundle-type algorithm for routing in telecommunication data networks***by*Claude Lemaréchal & Adam Ouorou & Georgios Petrou**411-426 Hybrid heuristics for the maximum diversity problem***by*Micael Gallego & Abraham Duarte & Manuel Laguna & Rafael Martí**427-441 Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems***by*Elizabeth Karas & Elvio Pilotta & Ademir Ribeiro**443-466 A successive SDP-NSDP approach to a robust optimization problem in finance***by*F. Leibfritz & J. Maruhn**467-485 An incomplete Hessian Newton minimization method and its application in a chemical database problem***by*Dexuan Xie & Qin Ni**487-519 New facets for the two-stage uncapacitated facility location polytope***by*Mercedes Landete & Alfredo Marín**521-524 COAP 2008 best paper award: Paper of M. Weiser, T. Gänzler, and A. Schiela***by*W. Hager**525-530 COAP 2008 best paper award: Paper of P.M. Hahn, B.-J. Kim, M. Guignard, J.M. Smith and Y.-R. Zhu***by*W. Hager

### November 2009, Volume 44, Issue 2

**159-181 Elliptic optimal control problems with L 1 -control cost and applications for the placement of control devices***by*Georg Stadler**183-212 Regularization of state-constrained elliptic optimal control problems with nonlocal radiation interface conditions***by*C. Meyer & I. Yousept**213-247 A stable primal–dual approach for linear programming under nondegeneracy assumptions***by*Maria Gonzalez-Lima & Hua Wei & Henry Wolkowicz**249-273 Scalarizations for adaptively solving multi-objective optimization problems***by*Gabriele Eichfelder**275-288 A FPTAS for a class of linear multiplicative problems***by*Daniele Depetrini & Marco Locatelli**289-313 Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem***by*Dulce Rosas & Jordi Castro & Lídia Montero**315-341 Global optimization of truss topology with discrete bar areas—Part II: Implementation and numerical results***by*Wolfgang Achtziger & Mathias Stolpe**343-361 Computing the metric dimension of graphs by genetic algorithms***by*Jozef Kratica & Vera Kovačević-Vujčić & Mirjana Čangalović

### October 2009, Volume 44, Issue 1

**1-2 Editorial***by*Fredi Tröltzsch**3-25 A posteriori error estimation and adaptivity for elliptic optimal control problems with state constraints***by*Olaf Benedix & Boris Vexler**27-55 Error estimates for the discretization of elliptic control problems with pointwise control and state constraints***by*S. Cherednichenko & A. Rösch**57-81 Sensitivity analysis and the adjoint update strategy for an optimal control problem with mixed control-state constraints***by*Roland Griesse & Daniel Wachsmuth**83-115 POD a-posteriori error estimates for linear-quadratic optimal control problems***by*F. Tröltzsch & S. Volkwein**117-138 On solving the Lagrangian dual of integer programs via an incremental approach***by*Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico**139-158 A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty***by*Wang Yanjun & Li Tao & Liang Zhian

### July 2009, Volume 43, Issue 3

**307-328 An inexact-restoration method for nonlinear bilevel programming problems***by*R. Andreani & S. Castro & J. Chela & A. Friedlander & S. Santos**329-352 Analytic center of spherical shells and its application to analytic center machine***by*Fernanda Raupp & B. Svaiter**353-377 Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions***by*Anna Heusinger & Christian Kanzow**379-409 A second-order cone cutting surface method: complexity and application***by*Mohammad Oskoorouchi & John Mitchell**411-436 Towards auction algorithms for large dense assignment problems***by*Libor Buš & Pavel Tvrdík**437-448 New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels***by*A. Sedeño-Noda & C. González-Martín**449-463 A combinatorial algorithm for the TDMA message scheduling problem***by*Clayton Commander & Panos Pardalos

### June 2009, Volume 43, Issue 2

**151-179 Sum of squares method for sensor network localization***by*Jiawang Nie**181-195 Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound***by*Samuel Burer & Dieter Vandenbussche**197-211 A globally convergent descent method for nonsmooth variational inequalities***by*Barbara Panicucci & Massimo Pappalardo & Mauro Passacantando**213-233 A virtual control concept for state constrained optimal control problems***by*K. Krumbiegel & A. Rösch**235-259 Mean and variance optimization of non–linear systems and worst–case analysis***by*P. Parpas & B. Rustem & V. Wieland & S. Žaković**261-294 Solving the linear multiple choice knapsack problem with two objectives: profit and equity***by*George Kozanidis**295-306 A proximal method for identifying active manifolds***by*W. Hare

### May 2009, Volume 43, Issue 1

**1-22 Algorithm for cardinality-constrained quadratic optimization***by*Dimitris Bertsimas & Romy Shioda**23-37 Solving molecular distance geometry problems by global optimization algorithms***by*Andrea Grosso & Marco Locatelli & Fabio Schoen**39-65 A cutting plane algorithm for the capacitated facility location problem***by*Pasquale Avella & Maurizio Boccia**67-93 Scenario reduction in stochastic programming with respect to discrepancy distances***by*René Henrion & Christian Küchler & Werner Römisch**95-118 The piecewise linear-quadratic model for computational convex analysis***by*Yves Lucet & Heinz Bauschke & Mike Trienis**119-131 Truncated regularized Newton method for convex minimizations***by*Ying-Jie Li & Dong-Hui Li**133-150 Finite-difference discretizations of quadratic control problems governed by ordinary elliptic differential equations***by*Walter Alt & Nils Bräutigam

### April 2009, Volume 42, Issue 3

**327-334 A restarting approach for the symmetric rank one update for unconstrained optimization***by*Wah Leong & Malik Hassan**335-352 Global error bounds for the extended vertical LCP***by*Chao Zhang & Xiaojun Chen & Naihua Xiu**353-370 Bounded-degree spanning tree problems: models and new algorithms***by*R. Cerulli & M. Gentili & A. Iossa**371-392 Benders, metric and cutset inequalities for multicommodity capacitated network design***by*Alysson Costa & Jean-François Cordeau & Bernard Gendron**393-419 Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods***by*José Fernández & Boglárka Tóth**421-441 Implementation of scatter search for multi-objective optimization: a comparative study***by*R. Baños & C. Gil & J. Reca & J. Martínez**443-470 Optimal location of the support of the control for the 1-D wave equation: numerical investigations***by*Arnaud Münch

### March 2009, Volume 42, Issue 2

**173-193 A generalized conditional gradient method and its connection to an iterative shrinkage method***by*Kristian Bredies & Dirk Lorenz & Peter Maass**195-212 Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities***by*Bing-Sheng He**213-229 Kantorovich’s majorants principle for Newton’s method***by*O. Ferreira & B. Svaiter**231-264 Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints***by*A. Izmailov & M. Solodov**265-287 Accuracy of suboptimal solutions to kernel principal component analysis***by*Giorgio Gnecco & Marcello Sanguineti**289-301 Optimal purchasing cycle length of a deteriorating product for intermediary firms***by*Cheng-Kang Chen & Yi-Xiang Liao**303-326 Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem***by*M. Hifi & R. M’Hallah & T. Saadi

### April 2007, Volume 36, Issue 2

**137-147 Inexact constraint preconditioners for linear systems arising in interior point methods***by*Luca Bergamaschi & Jacek Gondzio & Manolo Venturin & Giovanni Zilli

### September 2006, Volume 35, Issue 1

**127-128 A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms***by*Dmitry Belov & Ronald Armstrong