# Springer

# Computational Optimization and Applications

**Order information:**

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

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

**Current editor:**William W. Hager

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

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

**Citations RSS feed:**at CitEc

### Impact factors

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

**Access and download statistics**

**Top item:**

- By citations
- By downloads (last 12 months)

### 2013, Volume 55, Issue 3

**769-802 Optimal error estimates for finite element discretization of elliptic optimal control problems with finitely many pointwise state constraints***by*Dmitriy Leykekhman & Dominik Meidner & Boris Vexler

### 2013, Volume 55, Issue 2

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

### 2013, Volume 55, Issue 1

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

### 2013, Volume 54, Issue 3

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

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

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

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

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

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

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

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

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

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

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

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

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