Table of Contents Optimization Methods and Software (OMS) Volume 1, Number 1 (May, 1992) Vladimir A. Bushenkov and Georgi V. Smirnov A new approach to the regulator design problem 1-12 Jean Charles Gilbert Automatic differentiation and iterative processes 13-21 Kristin P. Bennett and O.L. Mangasarian Robust linear programming discrimination of two linearly inseparable sets 23-34 Andreas Griewank Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation 35-54 Robert S. Maier Large-scale minimization on the CM-200 55-69 Chi-Geun Han, Panos M. Pardalos and Yinyu Ye Implementation of interior-point algorithms for some entropy optimization problems 71-80 Bruce Christianson Reverse accumulation and accurate rounding error estimates for Taylor series coefficients 81-94 Volume 1, Number 2 (September, 1992) Yu. Nesterov and A. Nemirovsky Conic formulation of a convex programming problem and duality 95-115 Ya-Xiang Yuan On self-dual update formulae in the Broyden family 117-127 Jose Mario Martinez and Mario C. Zambaldi An inverse column-updating method for solving large-scale nonlinear systems of equations 129-140 L.C.W. Dixon and D.J. Mills Neural networks and nonlinear optimization I. The representation of continuous functions 141-151 J.L. Morales-Perez and R.W.H. Sargent On the implementation and performance of an interior point method for large sparse convex quadratic programming 153-168 Volume 1, Number 3 (November, 1992) Special Issue. The First International Conferences on ABS Methods. September 2-6, 1991 (Luoyang, China) Emilio Spedicato A review of ABS algorithms for general linear systems 171-182 Josef Abaffy, Marida Bertocchi and Anna Torriero Criteria for transforming a Z-matrix into an M-matrix 183-196 N.Y. Deng, Y. Xiao and F.J. Zhou Variationally derived ABS methods 197-210 Naiyang Deng and Meifang Zhu Further results on the local convergence of the nonlinear ABS algorithms 211-221 Naiyang Deng and Meifang Zhu The local convergence property of the nonlinear Voevodin-ABS algorithm 223-231 Emilio Spedicato and Zhijian Huang An orthogonally scaled ABS method for nonlinear least squares problems 233-242 Emilio Spedicato and Zunquan Xia Finding general solutions of the quasi-Newton equation via the ABS approach 243-252 Zun-Quan Xia Finding subgradients of descent directions of convex functions by external polyhedral approximation of subdifferentials 253-264 Emilio Spedicato and Zunquan Xia A class of descent algorithms for nonlinear function minimization with linear equality constraints 265-272 M.T. Vespucci, Z. Yang, E. Feng, H. Yu and X. Wang A bibliography on the ABS methods 273-281 Volume 1, Number 4 (December, 1992) Naum Z. Shor and O.A. Berezovski New algorithms for constructing optimal circumscribed and inscribed ellipsoids 283-299 M. Al-Baali Highly efficient Broyden methods of minimization with variable parameter 301-310 V.E. Krivonozhko On comparison of solution trajectories between Dantzig-Wolfe decomposition and basis factorization 311-337 Volume 2, Number 1 (August, 1993) C.G. Broyden Block conjugate gradient methods 1-17 Ya-Xiang Yuan Analysis on the conjugate gradient method 19-29 Kaisa Miettinen and Marko M. Makela An interactive method for nonsmooth multiobjective optimization with an application to optimal control 31-44 Jianzhong Zhang, Detong Zhu and Yuanan Fan A practical trust region method for equality constrained optimization problems 45-68 L.D. Popov and I.I. Eremin Numerical analysis of improper linear programs using the DELTA-PLAN-ES interactive system 69-78 Volume 2, Number 2 (October, 1993) Stephen Wright A path-following infeasible-interior-point algorithm for linear complementarity problems 79-106 Hiroshi Yabe Variations of structured Broyden families for nonlinear least squares problems 107-144 Eduardo Casas and Cecilia Pola A sequential generalized quadratic programming algorithm using exact L1 penalty functions 145-176 A.V. Balakrishnan On the Wittrick-Williams algorithm for modes of flexible structures 177-187 Volume 2, Numbers 3-4 (December, 1993) Special Issue Celebrating the 60th Birthday of Professor Charles Broyden Jorge J. More Generalizations of the trust region problem 189-209 C. Bischof, G. Corliss and A. Griewank Structured second- and higher-order derivatives through univariate Taylor series 211-232 Ilio Galligani and Valeria Ruggiero Numerical solution of equality-constrained quadratic programming problems on vector-parallel computers 233-247 C.T. Kelley and Z.Q. Xue Inexact Newton methods for singular problems 249-267 Dan Feng and Robert B. Schnabel Globally convergent parallel algorithms for solving block bordered systems of nonlinear equations 269-295 Zhijian Huang Row update ABS methods for solving sparse nonlinear systems of equations 297-309 Emilio Spedicato and Jinxi Zhao Explicit general solution of the quasi-Newton equation with sparsity and symmetry 311-319 Andreas Griewank, Christian Bischof, George Corliss, Alan Carle and Karen Williamson Derivative convergence for iterative equation solvers 321-355 J.A. Ford and I.A. Moghrabi Alternative parameter choices for multi-step quasi-Newton methods 357-370 Volume 3, Numbers 1-3 (January, 1994) Special Issue. First Biennial Soviet-Italian Conference on Methods and Applications of Mathematical Programming. September 7-11, 1992 (Cosenza, Italy) Josef Stoer The complexity of an infeasible interior-point path-following method for the solution of linear programs 1-12 Francisco Facchinei and Stefano Lucidi Local properties of a Newton-like direction for equality constrained minimization problems 13-26 Kristin P. Bennett and O.L. Mangasarian Multicategory discrimination via linear programming 27-39 Zhijian Huang Row update ABS methods for systems of nonlinear equations 41-60 M.A. Wolfe On global optimization in R using interval arithmetic 61-76 Luigi Grippo, Francesco Lampariello and Stefano Lucidi Vector performance criteria in the convergence analysis of optimization algorithms 77-92 D. Tuyttens Some more numerical experiments with LSNNO, a Fortran subroutine for solving large-scale nonlinear network optimization problems 93-110 Ya.D. Sergeyev and V.A. Grishagin Sequential and parallel algorithms for global optimization 111-124 D. Conforti, L. Grandinetti and R. Musmanno A parallel tensor algorithm for nonlinear optimization 125-142 S. Komlosi and M. Pappalardo A general scheme for first order approximations in optimization 143-152 Georgi V. Smirnov Convergence of barrier-projection methods of optimization via vector Lyapunov functions 153-162 L. Bianco, A. Mingozzi and S. Ricciardelli A set partitioning approach to the multiple depot vehicle scheduling problem 163-194 C. De Simone and G. Rinaldi A cutting plane algorithm for the max-cut problem 195-214 Soren Holm The existence of dual prices for the linear integer programming problem 215-224 Anna Galluccio and Martin Loebl Even/odd dipaths in planar digraphs 225-236 Yuri G. Evtushenko and Vitali G. Zhadan Stable barrier-projection and barrier-Newton methods in Nonlinear programming 237-256 Volume 3, Number 4 (May, 1994) Hajime Kitakami, Hirotaka Hara, Hiroshi Yamanaka and Tomoaki Miyazaki Performance evaluation for parallel mixed-integer linear programming system 257-272 Kurt M. Anstreicher and Jean-Philippe Vial On the convergence of an infeasible primal-dual interior-point method for convex programming 273-283 J.-P. Vial Computational experience with a primal-dual interior-point method for smooth convex programming 285-310 Bruce Christianson Reverse accumulation and attractive fixed points 311-326 Christian Kanzow Some equation-based methods for the nonlinear complementarity problem 327-340 Volume 4, Number 1 (May, 1994) J. Heinz and P. Spellucci A successful implementation of the Pantoja-Mayne SQP method 1-28 Mehiddin Al-Baali An efficient class of switching type algorithms in the Broyden family 29-46 M.C. Bartholomew-Biggs, L. Bartholomew-Biggs and B. Christianson Optimization & automatic differentiation in Ada: some practical experience 47-73 Jonathan Eckstein Some saddle-function splitting methods for convex programming 75-83 Volume 4, Number 2 (July, 1994) Special Issue. Neural Networks via Mathematical Programming Zhi-Quan Luo and Paul Tseng Analysis of an approximate gradient projection method with applications to the backpropagation algorithm 85-101 O.L. Mangasarian and M.V. Solodov Serial and parallel backpropagation convergence via nonmonotone perturbed minimization 103-116 Alexei A. Gaivoronski Convergence properties of backpropagation for neural nets via theory of stochastic gradient methods. Part 1. 117-134 L. Grippo A class of unconstrained minimization methods for neural network training 135-150 Xiru Zhang Time series analysis and prediction by neural networks 151-170 Volume 4, Number 3 (July, 1994) Bruce A. Murtagh and Stephen J. Sugden A direct search approach to nonlinear integer programming 171-189 Rajluxmi V. Murthy and Richard V. Helgason A direct simplex algorithm for network flow problems with convex piecewise linear costs 191-207 R. Cerulli, R. De Leone and G. Piacente A modified auction algorithm for the shortest path problem 209-224 Rainer Mehlhorn and Gottfried Sachs A new tool for efficient optimization by automatic differentiation and program transparency 225-242 Volume 4, Number 4 (February, 1995) Robert A. Bosch and Kurt M. Antstreicher A partial updating algorithm for linear programs with many more variables than constraints 243-257 Martin Kiehl, Rainer Mehlhorn and Matthias Schumann Parallel multiple shooting for optimal control problems under NX 259-271 Naiyang Deng and Zhengfeng Li Global convergence of three terms conjugate gradient methods 273-282 Aurel Galantai The global convergence of the ABS methods for a class of nonlinear problems 283-295 Bernd Benner A continuation method in parametric optimization 297-306 Udo Werner Multiple branching in parametric quadratic programming 307-316 Volume 5, Number 1 (March, 1995) Special Issue. NATO ASI "Algorithms for Continuous Optimization". September 5-18, 1993 (Il Ciocco, Italy) Franz Rendl, Robert J. Vanderbei and Henry Wolkowicz Max-min eigenvalue problems, primal-dual interior point algorithms, and trust region subproblems 1-16 Emilio Spedicato and Zhijian Huang Optimally stable ABS methods for nonlinear underdetermined systems 17-26 Stefano Herzel and Michael J. Todd Two interior-point algorithms for a class of convex programming problems 27-55 Ana Friedlander, Jose Mario Martinez and Marcos Raydan A new method for large-scale box constrained convex quadratic minimization problems 57-74 Florian Jarre Interior-point methods via self-concordance or relative Lipschitz condition 75-104 N.Y. Deng and Z.F. Li Some global convergence properties of a conic-variable metric algorithm for minimization with inexact line searches 105-122 Volume 5, Number 2 (April, 1995) Steven P. Dirkse and Michael C. Ferris The PATH solver: a nonmonotone stabilization scheme for mixed complementarity problems 123-156 Umbaldo M. Garcia-Palomares A finite procedure for finding a point satisfying a system of inequalities 157-171 Christian Kanzow and Helmut Kleinmichel A class of Newton-type methods for equality and inequality constrained optimization 173-198 Volume 5, Number 3 (May, 1995) V.E. Krivonozhko Global function strategy in the decomposition approach 199-207 M.M. Kostreva, Quan Zheng and Deming Zhuang A method for approximating solutions of multicriterial nonlinear optimization problems 209-226 J.L. Nazareth A framework for interior methods of linear programming 227-234 Jesse L. Barlow and Gerardo Toraldo The effect of diagonal scaling on projected gradient methods for bound constrained quadratic programming problems 235-245 Marten Gulliksson and Inge Soderkvist Surface fitting and parameter estimation with nonlinear least squares 247-269 Volume 5, Number 4 (July, 1995) Michal Kocvara and Jiri V. Outrata On a class of quasi-variational inequalities 275-295 Marco Gaviano and Zhijian Huang On the convergence behavior of the truncated GMRES method for nonlinear equations 297-318 Steven P. Dirkse and Michael C. Ferris MCPLIB: a collection of nonlinear mixed complementarity problems 319-345 C.G. Broyden A note on the block conjugate gradient method of O'Leary 347-350 Volume 6, Number 1 (August, 1995) A.V. Lotov An estimate of solution set perturbations for a system of linear inequalities 1-24 Q. Ni Truncated dual SQP method with limited memory 25-57 Evgeni A. Nurminski A quadratically convergent line-search algorithm for piecewise smooth convex optimization 59-80 Volume 6, Number 2 (November, 1995) A. Fischer On the local superlinear convergence of a Newton-type method for LCP under weak conditions 83-107 J. Ji, F.A. Potra and R. Sheng A predictor-corrector method for solving the $P_{*}(k)$-matrix LCP from infeasible starting points 109-126 V.L.R. Lopes and J.M. Martinez Convergence properties of the inverse column-updating method 127-144 M.A. Wolfe An interval algorithm for bound constrained global optimization 145-159 Volume 6, Number 3 (December, 1995) D. Kalman and R. Lindell A recursive approach to multivariate automatic differentiation 161-192 L. Edsberg and Per-Ake Wedin Numerical tools for parameter estimation in ODE-systems 193-217 E.D. Andersen Finding all linearly dependent rows in large-scale linear programming 219-227 I.V. Sergienko and V.A. Roshchin On integer programming problems with inaccurate data 229-236 Volume 6, Number 4 (March, 1996) Simon Di and Wenyu Sun A trust region method for conic model to solve unconstrained optimization 237-263 Craig T. Lawrence and Andre L. Tits Nonlinear equality constraints in feasible sequential quadratic programming 265-282 Aharon Ben-Tal and Gil Roth A truncated log barrier algorithm for large-scale convex programming and MinMax problems: implementation and computational results 283-312 Volume 7, Number 1 (July, 1996) Chr.H. Bischof, P.M. Khademi, A. Bouaricha, and A. Carle Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation 1-39 C.G. Broyden A breakdown of the block CG method 41-55 G.E. Stavroulakis and L.N. Polyakova Difference convex optimization techniques in nonsmooth computational mechanics 57-81 Volume 7, Number 2 (March, 1997) Heidi Jaeger and E.W. Sachs Global convergence of inexact reduced SQP methods 83-110 Ji-Ming Peng Global method for monotone variational inequality problems on polyhedral sets 111-122 A. Ebiefung, M.M. Kostreva and V. Ramanujam An algorithm to solve the generalized linear complementarity problem with a vertical block Z-matrix 123-138 N.N. Redkovsky and V.A. Goureev Optimization problems and calculation of electrical networks work regimes 139-155 Volume 7, Numbers 3-4 (May, 1997) K. Schittkowski Parameter estimation in one-dimensional time-dependent partial differential equations 165-210 M. Heinkenschloss The numerical solution of a control problem governed by a phase field model 211-263 M. Anitescu, G. Lesaja and F.A. Potra Equivalence between different formulations of the linear complementarity problem 265-290 B. He, E. de Klerk, C. Roos and T. Terlaky Method of approximate centers for semi-definite programming 291-309 I. Konnov A combined method for smooth equilibrium problems with constraints 311-324 Volume 8, Number 1 (October, 1997) S. Schleiff and H. Schwetlick Characterization and computation of period doubling points by minimally extended systems 1-24 A. Friedlander, M.A. Gomes-Ruggiero, D.N. Kozakevich, J.M. Martinez and S.A. Santos Solving nonlinear systems of equations by means of quasi-Newton methods with a nonmonotone strategy 25-51 B. Christianson, A.J. Davies, L.C.W. Dixon, R. Roy and P. Van der Zee Giving reverse differentiation a helping hand 53-67 J. Zhang, S. Xu and Z. Ma An algorithm for inverse minimum spanning tree problem 69-84 Volume 8, Number 2 (December, 1997) Special Issue. The Second International Conferences on ABS Methods. June 1-3, 1995 (Beijing, China) E. Spedicato ABS algorithms from Luoyang to Beijing 87-97 E. Spedicato, Z. Xia and L. Zhang The implicit LX method of the ABS class 99-110 Zhang Jianzhong and Zhu Meifang Least change properties of ABS methods and their application in secant-type updates 111-131 Feng Enmin, Wang Xiumei and Wang Xilu On the application of the ABS algorithm to linear programming and linear complementarity 133-142 Zhang Liwei On the ABS algorithm with singular initial matrix and its application to linear programming 143-156 Zhi Chen and Nayang Deng Some algorithms for the convex quadratic programming problem via the ABS approach 157-170 S. Nicolai and E. Spedicato A bibliography of the ABS methods 171-183 Volume 8, Numbers 3-4 (March, 1998) C.G. Broyden A simple algebraic proof of Farkas's lemma and related theorems 185-199 L. Luksan and J. Vlcek Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations 201-223 H. Goldberg and F. Troeltzsch On a Lagrange-Newton method for a nonlinear parabolic boundary control problem 225-247 L. N. Vicente On interior-point Newton algorithms for discretized optimal control problems with state constraints 249-275 C. Zopounidis and M. Doumpos Developing a multicriteria decision support system for financial classification problems: the FINCLAS system 277-304 Volume 9, Numbers 1-3 (March, 1998) Special Issue Celebrating the 60th Birthday of Professor Naum Shor A.M. Bagirov A method for minimizing convex functions based on continuous approximations to the subdifferential 1-17 V.F. Demyanov, G. Di Pillo and F. Facchinei Exact penalization via Dini and Hadamard conditional derivatives 19-36 A.S. El-Bakry Convergence rate of primal-dual reciprocal barrier Newton interior-point methods 37-44 Yu.G. Evtushenko Computation of exact gradients in distributed dynamic systems 45-75 I.V. Konnov On the convergence of combined relaxation methods for variational inequalities 77-92 T. Larsson, M. Patriksson and A.-B. Str\"{o}mberg Ergodic convergence in subgradient optimization 93-120 C. M\'esz\'aros On free variables in interior point methods 121-139 Yu. Nesterov Semidefinite relaxation and nonconvex quadratic optimization 141-160 F.A. Potra and R. Sheng On homogeneous interior-point algorithms for semidefinite programming 161-184 A. Quist, E. de Klerk, C. Roos and T. Terlaky Copositive relaxation for general quadratic programming 185-208 M. Wechs The analyticity of interior-point-paths at strictly complementary solutions of linear programs 209-243 Volume 9, Number 4 (June, 1998) P. Tseng Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP 245-268 E.K. Kostousova State estimation for dynamic systems via parallelotopes: optimization and parallel computations 269-306 B. Christianson Reverse accumulation and implicit functions 307-322 Volume 10, Number 1 (October, 1998) Y. Zhang Solving large-scale linear programs by interior-point methods under the MATLAB environment 1-31 A.K.M.S. Hossain and T. Steihaug Computing a sparse Jacobian matrix by rows and columns 33-48 J. Eriksson, M. Gullikson, P. Lindstroem and P.A. Wedin Regularization tools for training feed-forward neural networks using automatic differentiation 49-69 N. Deng and Z. Chen A new nonlinear ABS-type algorithm and its efficiency analysis 71-86 M. Celani, R. Cerulli, M. Gaudioso and Ya.D. Sergeyev A multiplier adjustment technique for the capacitated concentrator location problem 87-102 Book review: M. Doumpos Fuzzy Logic for Planning and Decision Making (F.A. Lootsma) 103-105 Volume 10, Number 2 (December, 1998) Special Issue Celebrating the 65th Birthday of Professor Masao Iri D. Avis Computational experience with the reverse search vertex enumeration algorithm 107-124 E.G. Birgin and Yu.G. Evtushenko Automatic differentiation and spectral projected gradient methods for optimal control problems 125-146 E. Boros, V. Gurvich and P.L. Hammer Dual subimplicants of positive Boolean functions 147-156 U. Buennagel, B. Korte and J. Vygen Efficient implementation of the Goldberg-Tarjan minimum-cost flow algorithm 157-174 R.E. Burkard, M. Hujter, B. Klinz, R. Rudolf and M. Wennink A process scheduling problem arising from chemical production planning 175-196 J.B.G. Frenk, J.F. Sturm and S. Zhang An interior-point based subgradient method for nondifferentiable convex optimization 197-215 Z. Gaspar, N. Radics and A. Recski Square grids with long "diagonals" 217-231 K. Hakata and H. Imai Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima 233-260 K. Imai and H. Imai Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets 261-274 M. Kojima and L. Tuncel Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems 275-296 H. Konno, T. Suzuki and D. Kobayashi A branch and bound algorithm for solving mean-risk-skewness portfolio models 297-317 K. Kubota A Fortran77 preprocessor for reverse mode automatic differentiation with recursive checkpointing 319-335 M.Z. Li and M. Fushimi The efficient shape of a skyscraper based on the vertical traffic 337-355 T. Minakawa and K. Sugihara Topology-oriented construction of three-dimensional convex hulls 357-371 K. Murota and M. Scharbrodt Computing the combinatorial canonical form of a layered mixed matrix 373-391 J. Stoer and M. Wechs The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems 393-417 M. Yagiura, T. Yamaguchi and T. Ibaraki A variable depth search algorithm with branching search for the generalized assignment problem 419-441 H. Yamashita A globally convergent primal-dual interior point method for constrained optimization 443-469 Volume 10, Number 3 (February, 1999) Y. Liu, K. L. Teo and S. Ito A dual parametrization approach to linear-quadratic semi-infinite programming problems 471-495 M. Laumen A comparison of numerical methods for optimal shape design problems 497-537 K. Schittkowski PDEFIT: A FORTRAN code for parameter estimation in partial differential equations 539-582 Book Rewiew: Panos M. Pardalos Parallel Optimization: Theory, Algorithms and Applications (Yair Censor and Stavros A. Zenios) 583-586 Volume 10, Number 4 (April, 1999) L. Grippo and M. Sciandrone Globally convergent block-coordinate techniques for unconstrained optimization 587-637 G. Poenisch, U. Schnabel und H. Schwetlick Computing multiple turning points by using simple extended systems and computational differentiation 639-668 Volume 10, Number 5 (June, 1999) M.C. Ferris, A. Meeraus and T.F. Rutherford Computing Wardropian equilibria in a complementarity framework 669-685 J.M. Peng, C. Kanzow and M. Fukushima A hybrid Josephy-Newton method for solving box constrained variational inequality problems via the D-gap function 687-710 I.V. Konnov A combined relaxation method for decomposable variational inequalities 711-728 B. Christianson Cheap Newton steps for optimal control problems: Automatic differentiation and Pantoja's algorithm 729-743 Book Review: Panos M. Pardalos Network Optimization: Continuous and Discrete Models (Dimitri P. Bertsekas) 745-746 Volume 10, Number 6 (August, 1999) A. Ebiefung The vertical linear complementarity problem associated with P_o-matrices 747-761 A. Rubinov and M. Andramonov Lipschitz programming via increasing convex-along-rays functions 763-781 G. Zanghirati Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems 783-801 M. Kiehl Sensitivity analysis of ODEs and DAEs - theory and implementation guide 803-821 Book Review: Panos M. Pardalos Semi-Infinite Programming (Rembert Reemtsen and Jan-J. Rueckmann, Eds) 823-824 Volumes 11&12 (December, 1999) Special Issue on Interior Point Methods (CD supplement with software) Guest Editors: Florian Potra, Cornelis Roos and Tamas Terlaky M.J. Todd A study of search directions in primal-dual interior-point methods for semidefinite programming 1-46 Masakazu Kojima, Masayuki Shida and Susumu Shindoh A note on the Nesterov-Todd and the Kojima-Shindoh-Hara search directions in semidefinite programming 47-52 Masayuki Shida On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions 53-66 Jean-Pierre Haeberly, Madhu V. Nayakkankuppam, and Michael L. Overton Extending Mehrotra and Gondzio higher order methods for mixed semidefinite-quadratic-linear programming 67-90 Renato D.C. Monteiro and Paulo R. Zanjacomo Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants 91-140 Takashi Tsuchiya A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming 141-182 J. Frederic Bonnans, Cecilia Pola, and Raja Rebai Perturbed path following predictor-corrector interior point algorithms 183-210 Stefania Bellavia and Maria Macconi An inexact interior point method for monotone NCP 211-241 Yu. Nesterov, O. Peton, J.-Ph. Vial Homogeneous analytic center cutting plane methods with approximate centers 243-273 Anna Altman and Jacek Gondzio Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization 275-302 Arkadi Nemirovski On self-concordant convex-concave functions 303-384 Yin Zhang User's guide to LIPSOL: Linear Programming Interior Point Solvers v0.4 385-396 Joseph Czyzyk, Sanjay Mehrotra, Michael Wagner and Stephen J. Wright PCx: An interior-point code for linear programming 397-430 Csaba Meszaros The BPMPD interior solver for convex quadratic problems 431-449 Robert J. Vanderbei LOQO: an interior point code for quadratic programming 451-484 Robert J. Vanderbei LOQO user's manual - version 3.10 485-514 Steven J. Benson, Yinyu Ye and Xiong Zhang Mixed linear and semidefinite programming for combinatorial and quadratic optimization 515-544 K.C. Toh, M.J. Todd and R.H. Tutuncu SDPT3 - a MATLAB software package for semidefinite programming, Version 1.3 545-581 Nathan Brinxius, Florian A. Potra and Rongqin Sheng SDPHA: a MATLAB implementation of homogeneous interior-point algorithms for semidefinite programming 583-596 Brian Borchers CSDP 2.3 user's guide 597-611 Brian Borchers CSDP, a C library for semidefinite programming 613-623 Jos F. Sturm Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones 625-653 H.D. Mittelman Benchmarking interior point LP/QP solvers 655-670 Istvan Maros, Csaba Meszaros A repository of convex quadratic programming problems 671-681 Brian Borchers SDPLIB 1.2, a library of semidefinite programming test problems 683-690 Volume 13, Number 1 (January, 2000) P.S. Bradley and O.L. Mangasarian Massive data discrimination via linear support vector machines 1-10 N. Krejic and J.M. Martinez A globally convergent inexact-Newton method for solving reducible nonlinear systems of equations 11-34 I. Charpentier and M. Chemires Efficient adjoint derivatives: application to the atmospheric model MESO-NH 35-63 W. Klein and A. Walther Application of techniques of computational differentiation to a cooling system 65-78 Volume 13, Number 2 (April, 2000) M.G. Gasparo A nonmonotone hybrid method for nonlinear systems 79-92 B. Hamma, S. Viitanen and A. Torn Parallel continuous simulated annealing for global optimization 93-116 J.L. Nazareth The DLP decision support system and its extension to stochastic programming 117-154 Volume 13, Number 3 (June, 2000) M. Al-Baali Extra updates for the BFGS method 159-179 Dong-Hui Li and Masao Fukushima A derivative-free line search and global convergence of Broyden-like method for nonlinear equations 181-201 M. Mongeau, H. Karsenty, V. Rouze, J.-B. Hiriart-Urruty Comparison of public-domain software for black-box global optimization 203-226 Volume 13, Number 4 (August, 2000) L. Mosheyev and M. Zibulevsky Penalty/barrier multiplier algorithm for semidefinite programming 235-261 Zhi Chen, Naiyang Deng and Emilio Spedicato Truncated difference ABS-type algorithm for nonlinear systems of equations 263-274 X. Chen and R.S. Womersley Random test problems and parallel methods for quadratic programs and quadratic stochastic programs 275-306 Volume 14, Numbers 1-2 (October, 2000) Special Issue. The International Conference on Nonlinear Programming and Variational Inequalities. December 15-18, 1998 (Hong Kong). Guest Editors: Ya-xiang Yuan and Jianzhong Zhang Ioannis Akrotirianakis and Berc Rustem A primal-dual interior point algorithm with an exact and differentiable merit function for nonlinear programming 1-35 P. Charnsethikul The constrained minimax linear assignment problem 37-48 G. Di Pillo, S. Lucidi and L. Palagi A superlinearly convergent primal-dual algorithm model for constrained optimization problems with bounded variables 49-73 N.I.M. Gould, S. Lucidi, M. Roma and Ph.L. Toint Exploiting negative curvature directions in linesearch methods for unconstrained optimization 75-98 Stephen G. Nash A multigrid approach to discretized optimization problems 99-116 Jiri V. Outrata On mathematical programs with complementarity constraints 117-137 Yufei Yang, Donghui Li and Shuzi Zhou A trust region method for a semismooth reformulation to variational inequality problems 139-157 Jinghao Zhu Applying optimal control method in the optimization of smooth functions 159-168 Volume 14, Number 3 (December, 2000) Z.-Q. Luo, J.F. Sturm and S. Zhang, Conic convex programming and self-dual embedding 169-218 C. Zopounidis and M. Doumpos Building additive utilities for multi-group hierarchical discrimination: the M.H.DIS method 219-240 Volume 14, Number 4 (February, 2001) G.L. Xue and M.R. Lasher Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure 245-266 E.K. Kostousova Control synthesis via parallelotopes: optimization and parallel computations 267-310 Volume 15, Number 1 (April, 2001) S. Kruk, M. Muramatsu, F. Rendl, R.J. Vanderbei and H. Wolkowicz The Gauss-Newton direction in semidefinite programming 1-28 G. Fung and O.L. Mangasarian Semi-supervised support vector machines for unlabeled data classification 29-44 M.A. Diniz-Ehrhardt, M.A. Gomes-Ruggiero and S.A. Santos Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization 45-66 R. Khalaf, P. van der Zee and L.C.W. Dixon Image reconstruction in optical tomography with the aid of reverse differentiation in the complex domain 67-85 Volume 15, Number 2 (June, 2001) A. Kaplan and R. Tichatschke Proximal interior point method for convex semi-infinite programming 87-119 Achiya Dax Loss and retention of accuracy in affine scaling methods 121-151 Guanghui Liu, Lixing Han and Lily Jing A nonmonotone Broyden method for unconstrained optimization 153-171 Volume 15, Numbers 3-4 (August, 2001) Samuel Burer and Renato D.C. Monteiro A projected gradient algorithm for solving the maxcut SDP relaxation 175-200 Sunyoung Kim and Masakazu Kojima Second order cone programming relaxation of nonconvex quadratic optimization problems 201-224 G. Pacelli and M.C. Recchioni An interior point algorithm for global optimal solutions and KKT points 225-256 Naiyang Deng, Zhaozhi Wang and Jianzhong Zhang An improved inexact Newton's method for unary optimization 257-282 D. Conforti and M. Mancini A curvilinear search algorithm for unconstrained optimization by automatic differentiation 283-297 T. Grund and A. Roesch Optimal control of a linear elliptic equation with a supremum-norm functional 299-329 Volume 16, Numbers 1-4 (November, 2001) Special issue dedicated to the 65th birthday of Professor L.C.W. Dixon M.C. Bartholomew-Biggs Laurence Dixon - a Tribute 1-20 I. Akrotirianakis, I. Maros and B. Rustem An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems 21-47 N. Brixius and K. Anstreicher Solving quadratic assignment problems using convex quadratic programing relaxations 49-68 M.C. Bartholomew-Biggs IP from an SQP point of view 69-84 E. Bodon, A. del Popolo, L. Luksan and E. Spedicato Computational experiments with ABS algorithms for KKT linear systems 85-99 C.G. Broyden On theorems of the alternative 101-111 C.G. Broyden and M.T. Vespucci On the convergence of Krylov linear equation solvers 113-129 Bruce Christianson A self-stabilizing Pantoja-like indirect algorithm for optimal control 131-149 N.Y. Deng, H. Zhang and C. Zhang Further improvements to the Newton-PCG algorithm with automatic differentiation 151-178 Hamid Esmaeili, Nezam Mahdavi-Amiri and Emilio Spedicato ABS solution of a class of linear integer inequalities and integer LP problems 179-192 Yu.G. Evtushenko, V.G. Zhadan and A.M. Rubinov General Lagrange-type functions in constrained global optimization. Part I: auxiliary functions and optimality conditions 193-230 Yu.G. Evtushenko, V.G. Zhadan and A.M. Rubinov General Lagrange-type functions in constrained global optimization. Part II: exact auxiliary functions 231-256 L. Luksan and J.Vlcek Numerical experience with iterative methods for equality constrained nonlinear programming problems 257-287 M.J.D. Powell On the Lagrange functions of quadratic models that are defined by interpolation 289-309 Volume 17, Number 1 (February, 2002) Marko M. Makela Survey of bundle methods for nonsmooth optimization 1-29 Adil M. Bagirov A method for minimization of quasidifferentiable functions 31-60 Jianzhong Zhang and Zhenhong Liu An oracle strongly polynomial algorithm for bottleneck expansion problems 61-75 S. Volkwein Mesh-independence of Lagrange-SQP methods with Lipschitz-continuous Lagrange multiplier updates 77-111 M. Gaviano and D. Lera A complexity analysis of local search algorithms in global optimization 113-127 Chr. Faure Adjoining strategies for multi-layered programs 129-164 Volume 17, Number 2 (April, 2002) A. B. Kurzhanski and P. Varaiya On ellipsoidal techniques for reachability analysis Part I: External approximations 177-206 A. B. Kurzhanski and P. Varaiya On ellipsoidal techniques for reachability analysis Part II: Internal approximations box-valued constraints 207-237 Murat Subasi Optimal control of heat source in a heat conductivity problem 239-250 K. Beer and V.A. Skokov Cutting plane methods based on the analytic barrier for minimization of a convex function subject to box-constraints 251-269 Igor V. Konnov A combined relaxation method for nonlinear variational inequalities 271-292 M. Doumpos and C. Zopounidis On the development of an outranking relation for ordinal classification problems: An experimental investigation of a new methodology 293-317 J.W. Chinneck Discovering the characteristics of mathematical programs via sampling 319-352 Volume 17, Number 3 (June, 2002) Special Issue on Stochastic Programming Guest Editors: A. Prekopa and A. Ruszczynski P. Beraldi and A. Ruszczynski A branch and bound method for stochastic integer problems under probabilistic constraints 359 - 382 J. Blomvall and P.O. Lindberg A Riccati-based primal interior point solver for multistage stochastic programming - Extensions 383 - 407 J. Bukszar and T. Szantai Probability bounds given by hypercherry trees 409 - 422 Ch. Condevaux-Lanloy, E. Fragniere and A.J. King SISP, simplified interface for stochastic programming establishing a hard link between mathematical programming modeling languages and SMPS codes 423 - 443 C. Fabian, A. Prekopa and O. Ruf-Fiedler On a dual method for a specially structured linear programming problem with application to stochastic programming 445 - 492 S.D. Flam Stochastic programming, cooperation and risk exchange 493 - 504 R. Lepp Approximation of the quantile minimization problem with decision rules 505 - 522 A. Shapiro and A. Kleywegt Minimax analysis of stochastic problems 523 - 542 Bela Vizvari The integer programming background of a stochastic integer programming algorithm of Dentcheva-Prekopa-Ruszczynski 543 - 559 Volume 17, Number 4 (August, 2002) Maria Grazia Gasparo, Sandra Pieraccini and Alessandro Armellini An infeasible interior-point method with nonmonotonic comlementarity gaps 561 - 586 Zongwu Zhu A Modified Trust Region Algorithm 587 - 604 Hiroshige Dan, Nobuo Yamashita and Masao Fukushima Convergence properties of the inexact Levenberg-Marquardt method under local error bound conditions 605 - 626 F. Guerriero, M. Manchini and R. Musmanno New rollout algorithms for combinatorial optimization problems 627 - 654 Bao-Zhu Guo Riesz basis approach to the stabilization of a flexible beam with a tip rigid body without dissipativity 655 - 681 Dexuan Xie and Tamar Schlick A more lenient stopping rule for line search algorithms 683 - 700 Brian J. Driessen and Nader Sadegh Inequality/equality constrained optimization: an analytical robustness comparison of a feasibility method versus l1 sequential quadratic programming 701 - 716 Sungmook Lim and Soondal Park LPAKO: a Simplex-based Linear Programming Program 717 - 745 Volume 17, Number 5 (October, 2002) Special 10th anniversary issue: Part I Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan Generating dual-bounded hypergraphs 749 - 781 A.V. Demyanov, V.F. Demyanov and V.N. Malozemov Minmaxmin problems revisited 783 - 804 Jean-Louis Goffin and Jean-Philippe Vial Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method 805 - 867 Andreas Griewank and Andrea Walther On constrained optimization by adjoint based quasi-Newton methods 869 - 889 Abdel-Rahman Hedar and Masao Fukushima Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization 891 - 912 O. L. Mangasarian A finite Newton method for classification problems 913 - 929 A.M. Rubinov, X.Q. Yang and A.M. Bagirov Penalty functions with a small penalty parameter 931 - 964 M.V. Solodov and B.F. Svaiter A new proximal-based globalization strategy for the Josephy-Newton method for variational inequalities 965 - 983 Volume 17, Number 6 (December, 2002) Special 10th anniversary issue: Part II Y. Q. Bai, C. Roos and M. El Ghami A primal-dual interior-point method for linear optimization based on a new proximity function 985-1008 Michael C. Ferris and Meta M. Voelker Slice models in general purpose modeling systems: An application to DEA 1009-1032 Paola Festa, Panos Pardalos, Mauricio Resende, and Celso Ribeiro Randomized heuristics for the MAX-CUT problem 1033-1058 G. Ghiani, F.Guerriero, L. Grandinetti and R. Musmanno A Lagrangean heuristic for the plant location problem with multiple facilities in the same site 1059-1076 J. Peng and T. Terlaky A dynamic large-update primal-dual interior-point method for linear optimization 1077-1104 Jos F. Sturm Implementation of interior point methods for mixed semidefinite and second order cone optimization problems 1105-1154 Volume 18, Number 1 (February, 2003) Samuel Burer and Renato D. Monteiro A general framework for establishing polynomial convergence of long-step methods for semidefinite programming 1-38 Pamela J. Williams, Amr S. El-Bakry and Richard A. Tapia Using indicators in finite termination procedures 39-52 Igor Konnov On convergence properties of a subgradient method 53-62 K. Mittinen, A.V. Lotov, G.K. Kamenev and V.E. Berezkin Integration of two multiobjective optimization methods for nonlinear problems 63-80 L.D. Iasemidis, P.M. Pardalos, D.-S. Shiau, W. Chaovalitwongse, K. Narayanan, S. Kumar, P.R. Carney and J.C. Sackellares Prediction of human epileptic seizures based on optimization and phase changes of brain electrical activity 81-104 K. Eppler and H. Harbrecht Numerical solution of elliptic shape optimization problems using wavelet-based BEM 105-123 Volume 18, Number 2 (April, 2003) Special Issue. The Second Japanese-Sino Optimization Meeting, September 25-27, 2002 (Kyoto, Japan). Part I Guest Editors: Masao Fukushima and Ya-xiang Yuan Y. Asahiro, M. Ishibashi and M. Yamashita Independent and cooperative parallel search methods for the generalized assignment problem 129-141 Shu-Cherng Fang and Liqun Qi Manufacturing network flows: A generalized network flow model for manufacturing process modeling 143-165 Satoru Fujishige Submodular function minimization and related topics 167-180 Qiying Hu and Wuyi Yue Optimal replacement of a system according to a semi-Markov decision process in a semi-Markov environment 181-196 Hidefumi Kawasaki Analysis of conjugate points for constant tridiagonal Hesse matrices of a class of extremal problems 197-205 Satoko Moriguchi and Kazuo Murota Capacity scaling algorithm for scalable M-convex submodular flow problems 207-218 Siegfried Schaible and Jianming Shi Fractional programming: The sum-of-ratios case 219-229 Akihisa Tamura On convolution of L-convex functions 231-245 Volume 18, Number 3 (June, 2003) Yuhong Dai, John D. Lamb and Wenbin Liu Novel supervisor-searcher cooperation algorithms for minimisation problems with strong noise 247-264 Abdel-Rahman Hedar and Masao Fukushima Minimizing multimodal functions by simplex coding genetic algorithms 265-282 Quin Ni A globally convergent method of moving asymptotes with trust region technique 283-297 Michael Hinze and Thomas Slawig Adjoint gradients compared to gradients from algorithmic differentiation in instantaneous control of the Navier-Stokes equations 299-315 M. Kocvara and M. Stingl PENNON: A code for convex nonlinear and semidefinite programming 317-333 Janos D. Pinter Globally optimized calibration of nonlinear models: techniques, software and applications 335-355 Volume 18, Number 4 (August, 2003) Special Issue. The Second Japanese-Sino Optimization Meeting, September 25-27, 2002 (Kyoto, Japan). Part II Guest Editors: Masao Fukushima and Ya-xiang Yuan Alfred Auslender Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone 359-376 A. Beck and M. Teboulle Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems 377-394 Jun-ya Gotoh, Nguyen Van Thoai and Yoshitsugu Yamamoto Global optimization method for solving the minimum maximal flow problem 395-415 Takayuki Ishizeki and Hiroshi Imai Standard pairs for Lawrence-type matrices and their applications to several Lawrence-type integer programs 417-426 Hiro Ito, Kazuhisa Makino, Kouji Arata, Shoji Honami, Yuichiro Itatsu and Satoru Fujishige Source location problem with flow requirements in directed networks 427-435 Masafumi Ito and Ryuichi Hirabayashi Computing test sets for integer programming 437-452 Gang Kou, Xiantao Liu, Yi Peng, Yong Shi, Morgan Wise and Weixuan Xu Multiple criteria linear programming approach to data mining: Models, algorithm designs and software development 453-473 Y. Maruyama Strong representation theorems for bitone sequential decision processes 475-489 Makoto Yamashita, Katsuki Fujisawa and Masakazu Kojima Implementation and evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0) 491-505 Volume 18, Number 5 (October, 2003) John E. Mitchell Polynomial interior point cutting plane methods 507-534 Sunyoung Kim, Masakazu Kojima and Makoto Yamashita Second order cone programming relaxation of a positive semidefinite constraint 535-541 Yair Censor and Eli Tom Convergence of string-averaging projection schemes for inconsistent convex feasibility problems 543-554 Larry Nazareth On conjugate gradient algorithms as objects of scientific study 555-565 Yifan Xu A mixed and superlinearly convergent algorithm for constrained optimization 567-581 William La Cruz and Marcos Raydan Nonmonotone spectral methods for large-scale nonlinear systems 583-599 T. Larsson, M. Patriksson and C. Rydergren Inverse nonlinear multicommodity flow optimization by column generation 601-613 Francois Courty, Alain Dervieux, Bruno Koobus and Laurent Hascoet Reverse automatic differentiation for optimum design: from adjoint state assembly to gradient computation 615-627 Volume 18, Number 6 (December, 2003) Special Issue (Part I). The First International Conference on Optimization Methods and Software (December 15-18, 2002 Hangzhou, China) Guest Editors: Cornelis Roos and Jian-Zhong Zhang Y.Q. Bai and C. Roos A plynomial-time algorithm for linear optimization based on a new simple kernel function 631-646 Yong He and Ting Chen Optimal algorithms for recombination distance problem 647-655 Ying-Jun Jiang, Dong-Hui Li, Jin-Ping Zeng Weighted max-norm estimate of additive Schwarz methods for solving nonlinear complementarity problems 657-672 A. Ismael Vaz, E. Fernandes, M. Gomes A quasi-Newton interior point method for semi-infinite programming 673-687 Vladmir M. Veliov Newton's method for problems of optimal control of heterogeneous systems 689-703 Dachuan Xu, Yinyu Ye, Jiawei Zhang Approximate the 2-catalog segmentation problem using semidefinite programming relaxations 705-719 Jinghao Zhu and Kangdi Li An iterative method for solving stochastic Riccati differential equations for the stochastic LQR problem 721-732 Volume 19, Number 1 (February, 2004) Special issue dedicated to Professor Jochem Zowe Guest Editors: Florian Jarre and Michal Kocvara J.-N. Corvellec and S. D. Flam Non-convex feasibility problems and proximal point methods 3-14 R. Fletcher and S. Leyffer Solving mathematical programs with complementarity constraints as nonlinear programs 15-40 Charles Fortin and Henry Wolkowicz The trust region subproblem and semidefinite programming 41-67 R. Freund and F. Jarre An extension of the positive real lemma to descriptor systems 69-87 A. Fuduli, M. Gaudioso and G. Giallombardo A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization 89-102 Ch. Zillober, K. Schittkowski and K. Moritzen Very large scale optimization by sequential convex programming 103-121 Volume 19, Number 2 (April, 2004) Liu Hongwei, Wang Xinhui and Liu Sanyang Feasible direction algorithm for solving SDP relaxation of the quadratic {-1,1} programming problems 125-136 Gleb Beliakov The cutting angle method - a tool for global optimization 137-151 M. Al-Baali, A. Fuduli and R. Musmanno On the performance of switching BFGS/SR1 algorithms for unconstrained optimization 153-164 F. Baki and R.G. Vickson One operator two machine scheduling with set-up times for machines and weighted number of tardy jobs objective 165-178 Stefan Volkwein Nonlinear conjugate gradient methods for the optimal control of laser surface hardening 179-199 F. Troltzsch and D. Wachsmuth On the convergence of an instantaneous control type method for parabolic boundary control 201-216 Roland Griess Parametric sensitivity analysis in optimal control of a reaction diffusion system - Part II: practical methods and examples 217-242 Volume 19, Numbers 3-4 (June-August, 2004) Special Issue (Part II). The First International Conference on Optimization Methods and Software (December 15-18, 2002 Hangzhou, China) Guest Editors: Cornelis Roos and Jian-Zhong Zhang Naiyang Deng and Haibin Zhang Theoretical efficiency of a new inexact method of tangent hyperbolas 247-265 Giovanni Fasano A CG-type method for the solution of Newton's equation within optimization frameworks 267-290 Abdel-Rahman Hedar and Masao Fukushima Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization 291-308 Christian Kanzow Inexact semismooth Newton methods for large-scale complementarity problems 309-325 S. Koerkel, E. Kostina, H. Georg Bock and J.P. Schloeder Numerical methods for optimal control problems in design of robust optimal experiments for nonlinear dynamic processes 327-338 U. Ledzewicz, T. Brown and H. Schattler A comparison of optimal controls for a model in cancer chemotherapy with L1- and L2-type objectives 339-350 D. Lei and J. Mason Minimax approximation from a least squares solution 351-359 H. Liang, X. Liu and F. Bai An optimization problem in multi-homogeneous homotopy method 361-369 Stefano Lucidi and Veronica Piccialli A derivative-based algorithm for a particular class of mixed variable optimization problems 371-387 Shaohua Pan, Xingsi Li A self-adjusting primal-dual interior point method for linear programs 389-397 M.J.D. Powell On the use of quadratic models in unconstrained minimization without derivatives 399-411 A. Siburian and V. Rehbock A numerical procedure for solving a class of singular optimal control problems 413-426 Bram Verweij and Laurence A. Wolsey Uncapacitated lot-sizing with buying, sales and backlogging 427-436 J.L. Nazareth On CG algorithms as objects of scientific study: An appendix 437-438 Volume 19, Number 5 (October, 2004) Special issue dedicated to Professor Olvi Mangasarian on the occasion of his 70th birthday Guest Editors: Michael Ferris and Mikhail Solodov M. Seetharama Gowda Inverse and implicit function theorems for H-differentiable and semismooth functions 443-461 Robert Mifflin and Claudia Sagastizabal VU-smoothness and proximal point results for some nonconvex functions 463-478 Boris S. Mordukhovich Equilibrium problems with equilibrium constraints via multiobjective optimization 479-492 Asuman E. Ozdaglar and Dimitri P. Bertsekas The relation of pseudonormality and quasiregularity in constrained optimization 493-506 Christian Kanzow and Stefania Petra On a semismooth least squares formulation of complementarity problems with gap reduction 507-525 D. Ralph and S. Wright Some properties of regularization and penalization schemes for MPECs 527-556 M.V. Solodov A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework 557-575 Michael C. Ferris, Meta M. Voelker and Hao Helen Zhang Model building with likelihood basis pursuit 577-594 M. Kocvara and M. Stingl Solving nonconvex SDP problems of structural optimization with stability control 595-609 Jong-Shi Pang and Sven Leyffer On the global minimization of the value-at-risk 611-631 Nobuo Yamashita and Zhi-Quan Luo A nonlinear complementarity approach to multiuser power control for digital subscriber lines 633-652 Volume 19, Number 6 (December, 2004) H. Wolkowicz Solving semidefinite programs using preconditioned conjugate gradients 653-672 M. Haarala, K. Miettinen and M.M. Makela New limited memory bundle method for large-scale nonsmooth optimization 673-692 X.Q. Yang and X.X. Huang Lower order penalty methods for mathematical programs with complementarity constraints 693-720 Jerry Eriksson and Per-Ake Wedin Truncated Gauss-Newton algorithms for ill-conditioned nonlinear least squares problems 721-737 Volume 20, Number 1 (February, 2005) Special issue dedicated to Professor Yury Evtushenko on the occasion of his 65th birthday Guest Editors: Oleg Burdakov, Andreas Griewank and Alexander Lotov Earl Barnes and Antonio Moretti Some results on centers of polytopes 9-24 C.D. Bisbos, A. Makrodimopoulos and P.M. Pardalos Second order cone programming approaches to static shakedown analysis in steel plasticity 25-52 V.F. Demyanov An old problem and new tools 53-70 Luigi Grippo and Stefano Lucidi Convergence conditions, line search algorithms and trust region implementations for the Polak-Ribiere conjugate gradient method 71-98 M. Halicka, E. de Klerk and C. Roos Limiting behavior of the central path in semidefinite optimization 99-113 O.L. Mangasarian Support vector machine classification via parameterless robust linear programming 115-125 Panos M. Pardalos, Eduardo L. Pasiliao and Leonidas S. Pitsoulis Branch and bound algorithms for the multidimensional assignment problem 127-143 Florian Potra and Xing Liu Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path 145-168 Maziar Salahi and Tamas Terlaky An adaptive self-regular proximity based large-update IPM for LO 169-185 Volume 20, Numbers 2-3 (April-June, 2005) Special issue on mathematical diagnostics dedicated to Professor Franco Giannessi on the occasion of his 70th birthday Guest Editors: Vladimir F. Demyanov and Manlio Gaudioso V. Boltyanski Separation of convex cones and extremal problems 189-195 V. F. Demyanov Mathematical diagnosis via nonsmooth analysis 197-218 J. Grzybowski, D. Pallaschke and R. Urbanski Data classification and the separation law for closed bounded sets 219-229 A. B. Kurzhanski The diagnostics of safety zones in motion 231-239 A. Alessandri, M. Sanguineti Optimization of approximating networks for optimal fault diagnosis 241-266 A. Astorino and M. Gaudioso Ellipsoidal separation for classification problems 267-276 A. M. Bagirov Max-min separability 277-296 R. Bruni Error correction for massive data sets 297-316 L. Palagi and M. Sciandrone On the convergence of a modified version of SVM light algorithm 317-334 R. Ghosh, A. Rubinov and J. Zhang Optimization approach for clustering datasets with weights 335-351 T. Serafini, G. Zanghirati and L. Zanni Gradient projection methods for quadratic programs and applications in training SVM 353-378 R. De Leone A parallel algorithm for support vector machines training and quadratic optimization problems 379-388 W. Chaovalitwongse, P. M. Pardalos, L. D. Iasemidis, Deng-Shan Shiau and J. C. Sackellares Dynamical approaches and multi-quadratic integer programming for seizure prediction 389-400 D. Conforti and R. Guido Kernel-based support vector machine classifiers for early detection of myocardial infarction 401-413 Volume 20, Numbers 4-5 (August-October, 2005) Special issue on Numerical Methods for Local and Global Optimization: Sequential and Parallel Algorithms Responsible Guest-editor: Roger Fletcher Guest Editors: Yaroslav D. Sergeyev, Roman G. Strongin and Valeria Ruggiero Bernardetta Addis, Marco Locatelli and Fabio Schoen Local optima smoothing for global optimization 417-437 Balabhaskar Balasundaram and Sergiy Butenko Constructing test functions for global optimization using continuous formulations of optimization problems on graphs 439-452 Stefania Bellavia and Benedetta Morini An interior global method for nonlinear systems with simple bounds 453-474 Silvia Bonettini A nonmonotone inexact Newton method 475-491 Benoit Colson and Philippe L. Toint Optimizing partially separable functions without derivatives 493-508 Pierluigi Contucci, Cristian Giardina, Claudio Giberti, Francesco Unguendolic and Cecilia Vernia Interpolating greedy and reluctant algorithms 509-514 Yu.G. Evtushenko, A.I. Golikov and N. Mollaverdy Augmented Lagrangian and Newton methods for linear programming 515-524 M. Gaviano and D. Lera Complexity of general continuous minimization problems 525-544 Germana Landi and Elena Loli Piccolomini A total variation regularization strategy in dynamic MRI 545-558 Sven Leyffer The penalty interior-point method fails to converge 559-568 Ladislav Luksan, Ctirad Matonoha and Jan Vlcek Interior-point methods for large-scale nonlinear programming 569-582 Thomas Serafini and Luca Zanni On the working set selection in gradient projection-based decomposition techniques for support vector machines 583-596 Mark Sofroniou and Giulia Spaletta Symmetric composition of symmetric numerical integration methods 597-613 Fabiana Zama and Elena Loli Piccolomini A descent method for regularization of ill-posed problems 615-628 Volume 20, Numbers 6 (December, 2005) Soon-Yi Wu, Dong-Hui Li, Liqun Qi and Guanglu Zhou An iterative method for solving KKT system of the semi-infinite programming 629-643 M. Hinze and J. Sternberg A-Revolve: An adaptive memory-reduced procedure for calculating adjoints; with an application to computing adjoints of the instationary Navier-Stokes system 645-663 Qiaoming Han, Wenyu Sun, Jiye Han and Raimudo Sampaio An adaptive conic trust-region method for unconstrained optimization 665-677 M. Al-Baali and H. Khalfan A wide interval for efficient self-scaling quasi-Newton algorithms 679-691 Massimo Roma Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization 693-713 Z. Dostal Semi-monotonic inexact augmented Lagrangians for quadratic programming with equality constraints 715-727 Osman Guler Convergence rate estimates for the gradient differential inclusions 729-735 Li Zhang A globally convergent BFGS method for nonconvex minimization without line searches 737-747 Volume 21, Number 1 (February, 2006) L. Han and M. Neumann Effect of dimensionality on the Nelder-Mead simplex method 1 - 16 Katsuki Fujisawa, Mituhiro Fukuda and Kazuhide Nakata Preprocessing sparse semidefinite programs via matrix completion 17 - 39 Ming-Jong Yao and Yu-Chun Wang A new algorithm for one-warehouse multi-retailer systems under stationary nested policy 41 - 56 Kartik Krishnan and John E. Mitchell A unifying framework for several cutting plane methods for semidefinite programming 57 - 74 Johnny Tak Wai Cheng and Shuzhong Zhang On implementation of a self-dual embedding method for convex programming 75 - 103 Hans D. Mittelmann and Armin Pruessner A server for automated performance analysis of benchmarking data 105 - 120 Arnd Rosch Error estimates for linear quadratic control problems with control constraints 121 - 134 K. Eppler and H. Harbrecht 2nd order shape optimization using wavelet BEM 135 - 153 Steven J. Benson and Todd S. Munson Flexible complementarity solvers for large scale applications 155 - 168 Volume 21, Number 2 (April, 2006) M.H. Farahi, H. H. Mehne and A. H. Borzabadi Wing drag minimization by using measure theory 169 - 177 Houduo Qi and Xiaoqi Yang Armijo Newton method for convex best interpolation 179 - 200 Arinbjorn Olafsson and Stephen J. Wright Linear programming formulations and algorithms for radiotherapy treatment planning 201 - 231 Anthony J. Kearsley A matrix-free algorithm for the large-scale constrained trust-region subproblem 233 - 245 Zsolt Csizmadia and Tibor Illes New criss-cross type algorithms for linear complementarity problems with sufficient matrices 247 - 266 Juan C. de los Reyes A primal-dual active set method for control constrained optimal control of the Stokes equation 267 - 293 Masakazu Muramatsu, A pivoting procedure for a class of second-order cone programming 295 - 315 L. Faybusovich, T. Mouktonglang and T. Tsuchiya Implementation of infinite dimensional interior point method for solving multi-criteria linear quadratic control problem 315 - 341 Volume 21, Number 3 (June, 2006) P. Kaelo and M. M. Ali Probabilistic adaptations of point generation schemes in some global optimization algorithms 343-357 Ping Zhong and Masao Fukushima A new multi-class support vector algorithm 359-372 Igor Konnov Partial proximal point method for non monotone equilibrium problems 373-384 Regina Burachik, Claudia Sagastizabal and Susana Scheimberg An inexact method of partial inverses and a parallel bundle method 385-400 Kaj Holmberg and Krzysztof Kiwiel Mean value cross decomposition for nonlinear convex problems 401-417 Joo-Siong Chai and Kim-Chuan Toh Computation of condition numbers for linear programming problems using Pena's method 419-443 Alfio Borzi and Karl Kunisch A globalization strategy for the multigrid solution of elliptic optimal control problems 445-459 Jia-Yen Huang A new search algorithm for solving the maintenance scheduling problem for a family of machines 461-477 C.J. Price and Ph.L. Toint Exploiting problem structure in pattern search methods for unconstrained optimization 479-491 Sam Burer and Changhui Choi Computational enhancements in low-rank semidefinite programming 493-512 Volume 21, Number 4 (August, 2006) Special Issue. The International Conference on Optimization Techniques and Applications (ICOTA, December 9-11, 2004) Guest Editors: Alexander Rubinov and Adil Bagirov F.S. Bai, Z.Y. Wu and D.L. Zhu Lower order calmness and exact penalty function 515 - 525 Rafail N. Gasimov and Gurkan Ozturk Separation via polyhedral conic functions 527 - 540 Wei Li, Ping-Qi Pan, Guangting Chen A combined projected gradient algorithm for linear programming 541 - 550 Gui-hua Lin and Masao Fukushima New reformulations for stochastic nonlinear complimentarity problems 551 - 564 Janos D. Pinter, David Linder and Paulina Chin Global optimization toolbox for Maple: An introduction with illustrative applications 565 - 582 Farzad Safaei and Iradj Ouveysi Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation 583 - 595 Jie Sun and Zhen-Hai Huang A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution 597 - 615 Xiaoling Sun, Ning Ruan and Duan Li An efficient algorithm for nonlinear integer programming problems arising in series-parallel reliability systems 617 - 633 Jun Wu, Wuyi Yue, Yoshitsugu Yamamoto and Shouyang Wang Risk analysis of a pay to delay capacity reservation contracts 635 - 651 Wenxing Zhu A globally concavized filled function method for the box constrained continuous global minimization problem 653 - 666 Florian Potra and Xing Liu Erratum: Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path 677 - 678 Volume 21, Number 5 (October, 2006) H.W.J. Lee and K.H. Wong Semi-infinite programming approach to nonlinear time-delayed optimal control problems with linear continuous constraints 679-691 V. Jeyakumar, J. Ormerod and R. S. Womersley Knowledge-based semidefinite linear programming classifiers 693-706 Weijun Zhou and Zhang Li A nonlinear conjugate gradient method based on the MBFGS secant condition 707-714 R. Baker Kearfott Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization 715-731 Csaba Meszaros Sparsity in convex quadratic programming with interior point methods 733-745 Etienne Emmrich and Horst Schmitt Numerical treatment of a class of optimal control problems arising in economics 747-767 Jean-Pierre Dussault and Benoit Hamelin Robust descent in differentiable optimization using automatic finite differences 769-777 Walter Gomez and Juan Gomez Cutting plane algorithms for robust conic convex optimization problems 779-803 Yong Xia and Ya-xiang Yuan A new linearization method for quadratic assignment problems 805-818 Keyvan Amini and Nezam Mahdavi-Amiri Solving rank one perturbed linear Diophantine systems by the ABS methods 819-831 Indraneel Das An active set quadratic programming algorithm for real-time model predictive control 833-849 Antoine Deza, Elissa Nematollahi, Reza Peyghami and Tamas Terlaky The central path visits all the vertices of the Klee-Minty cube 851-865 Volume 21, Number 6 (December, 2006) Special issue on Parameter Estimation and Experimental Design Guest Editors: Ekaterina Kostina and Hubert Schwetlick T. Gaenzler, S. Volkwein and M. Weiser SQP methods for parameter identification problems arising in hyperthermia 869-887 I. Gherman, V. Schulz and J.T. Betts Optimal flight trajectories for the validation of aerodynamic models 889-900 M.D. Haunschild, S.A. Wahl, B. Freisleben and W. Wiechert A general framework for large scale model selection 901-917 Richard W. Longman and Minh Q. Phan Iterative learning control as a method of experiment design for improved system identification 919-941 M.R. Osborne Least squares methods in maximum likelihood problems 943-959 Regular papers: F. Diele, C. Marangi, S. Ragni Coupling quadrature and continuous Runge-Kutta methods for optimal control problems 961-975 Anthony Kearsley Algorithms for optimal signal set design 977-994 Volume 22, Number 1 (February, 2007) Special Issue on Systems Analysis, Optimization and Data Mining in Biomedicine Guest Editors: Christodoulos A. Floudas and Oleg A. Prokopyev Stanislav Busygin, Oleg A. Prokopyev and Panos M. Pardalos An optimization based approach for data classification 3-9 W.A. Chaovalitwongse, T.Y. Berger-Wolf, B. Dasgupta and M.V. Ashley Set covering approach for reconstruction of sibling relationships 11-24 Claudio Cifarelli and Giacomo Patrizi Solving large protein secondary structure classification problems by a nonlinear complementarity algorithm with {0,1} variables 25-49 H.K. Fung, M.S. Taylor and C.A. Floudas Novel formulations for the sequence selection problem in de novo protein design with flexible templates 51-71 M.R. Guarracino, C. Cifarelli, O. Seref, P.M. Pardalos A classification method based on generalized eigenvalue problems 73-81 S.-P. Kim, J.C. Sanchez and J.C. Principe Real time input subset selection for linear time-variant MIMO systems 83-98 M.A. Mammadov, A.M. Rubinov and J. Yearwood The study of drug-reaction relationships using global optimization techniques 99-126 S.R. McAllister, R. Rajgaria, and C.A. Floudas Global pairwise sequence alignment through mixed-integer linear programming: A template-free approach 127-144 Cheong Hee Park, Moongu Jeon, Panos Pardalos and Haesun Park Quality assessment of gene selection in microarray data 145-154 Florian A. Potra and Xing Liu Protein image alignment via tensor product cubic splines 155-168 My T. Thai, Zhipeng Cai and Ding-Zhu Du Genetic networks: Processing data, regulatory network modeling, and their analysis 169-185 Theodore B. Trafalis and Robin C. Gilbert Robust support vector machines for classification and computational issues 187-198 Athina Salappa, Michael Doumpos and Constantin Zopounidis Feature selection algorithms in classification problems: An experimental evaluation 199-214 Z.Q. Zhang, A.R. Kammerdiner, S. Busygin, A.K.Ottens, S.F. Larner, F.H. Kobeissy, P.M. Pardalos, R.L. Hayes and K.K. Wang Application of the data mining techniques to the systems biology of neuritogenesis 215-224 Ping Zhong and Masao Fukushima A regularized nonsmooth Newton method for multi-class support vector machines 225-236 Volume 22, Number 2 (April, 2007) Ji-Wei Zhang and Dong-Hui Li A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems 237-252 Tao-wen Liu and Dong-hui Li A practical update criterion for SQP method 253-266 Shaohua Pan, Suyan He and Xingsi Li A smoothing method for minimizing the sum of the r largest functions 267-277 Andreas Griewank, Andrea Walther and Maciek Korzec Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians 279-295 Jiangtao Mo, Nengzhu Gu and Zengxun Wei Hybrid conjugate gradient methods for unconstrained optimization 297-307 E.Boudinov and A.I.Manevich An efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems 309-328 Cai-hong Ye and Xiao-ming Yuan A descent method for structured monotone variational inequalities 329-338 J.X. Cruz Neto, O.P. Ferreira, A.N. Iusem and R.D.C. Monteiro Dual convergence of the proximal point method with Bregman distances for linear programming 339-360 Volume 22, Number 3 (June, 2007) Choong Ming Chin, Abdul Halim bin Abdul Rashid and Khalid bin Mohamed Nor Global and local convergence theory of a filter line search method for nonlinear programming 365-390 M. Alber and R. Reemtsen Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method 391-411 Martin Weiser, Peter Deuflhard and Bodo Erdmann Affine conjugate adaptive Newton methods for nonlinear elastomechanics 413-431 R. Baier, C. B\"uskens, I. A. Chahma, M. Gerdts Approximation of reachable sets by direct solution methods for optimal control problems 433-452 Radek Kucera Minimizing quadratic functions with separable quadratic constraints 453-467 Yu. Nesterov Modified Gauss-Newton scheme with worst-case guarantees for global performance 469-483 E. Alba, G. Luque, C.A.C. Coello and E.A.H. Luna A comparative study of serial and parallel heuristics used to design combinational logic circuits 485-509 Li Zhang, W. Zhou and D. Li Global convergence of the DY conjugate gradient method with Armijo line serch for unconstrained optimization problems 511-517 H. Mansouri and C. Roos A simplified O(nL) infeasible interior-point algorithm for linear optimization using full Newton steps 519-530 C.Z. Wu, K.L. Teo, YI Zhao and W.Y. Yan An optimal control problem involving impulsive integrodifferential systems 531-549 Volume 22, Number 4 (August, 2007) Georg Vossen, Volker Rehbock and Argenes Siburian Numerical solution methods for singular control with multiple state dependent forms 551-559 Neculai Andrei Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization 561-571 Antonio Frangioni and Claudio Gentile Experiments with a hybrid interior point/combinatorial approach for network flow problems 573-585 Qing Xu, Bo Yu, Guo-chen Feng and Chuangyin Dang Condition for global convergence of a homotopy method for variational inequalities problems on unbounded sets 587-599 Kamal Mirnia and Alireza Ghaffari Hadigheh Support set expansion sensitivity analysis in convex quadratic optimization 601-616 Adam Ouorou A proximal subgradient projection algorithm for linearly constrained strictly convex problems 617-636 Silvia Bonettini and Federica Tinti A nonmonotone semismooth inexact Newton method 637-657 Xin-long Luo, Li-Zhi Liao and Hon Wah Tam Convergence analysis of the Levenberg-Marquardt method 659-678 Filiz Bilen, Zsolt Csizmadia and Tibor Illes Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems 679-695 Li Zhang, Weijun Zhou and Donghui Li Some decent three-term conjugate gradient methods and their global convergence 697-711 Volume 22, Number 5 (October, 2007) Christian Kanzow and Stefania Petra Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems 713-735 L. Luksan, C. Matonoha and J. Vlcek Trust-region interior-point method for large sparse l_1 optimization 737-753 Arpad Buermen and Tadej Tuma Sprouting search - an algorithmic framework for asynchronous parallel unconstrained optimization 755-776 Dominikus Noll Local convergence of an augmented Lagrangian method for matrix inequality constrained programming 777-802 Roummel F. Marcia, Julie C. Mitchell and Stephen J. Wright Global optimization in protein docking using convex underestimation and semidefinite programming 803-811 Roland Becker, Dominik Meidner and Boris Vexler Efficient numerical solution of parabolic optimization problems by finite element methods 813-833 C. Sainvitu and Ph.L. Toint A filter-trust-region method for simple-bound constrained optimization 835-848 Zhaosong Lu and Renato Monteiro Limiting behavior of the Alizadeh-Haeberly-Overton weighted paths in semidefinite programming 849-870 Volume 22, Number 6 (December, 2007) C. Meyer, U. Pruefert and F. Troeltzsch On two numerical methods for state-constrained elliptic control problems 871-899 Gleb Beliakov Smoothing Lipschitz functions 901-916 Michael Herty, Rene Pinnau, Mohammed Seaid Optimal control in radiative transfer 917-936 Maria D. Gonzalez-Lima Enhancing the behavior of interior-point methods via identification of variables 937-958 Boban Marinkovic Optimality conditions for a discrete optimal control problems 959-969 Gianpaolo Ghiani, Antonella Quaranta and Chefi Triki New policies for the dynamic traveling salesman problem 971-983 Volume 23, Number 1 (February, 2008) Special Issue on Nonsmooth Optimization and Related Topics, Dedicated to the Memory of Professor Naum Shor Guest Editors: Boris Mordukhovich, Mikhail Solodov and Michael Todd S. Damla Ahipasaoglu, Peng Sun, and Michael J. Todd Linear convergence of a modified Frank-Wolfe algorithm for computing minimum volume enclosing ellipsoids 5-19 Dan Butnariu and Ben Zion Shklyar Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem 21-37 Arkadii A. Chikrii Optimization of game interaction of fractional-order controlled systems 39-72 Alfredo Iusem and Alberto Seeger Antipodal pairs, critical pairs, and Nash angular equilibria in convex cones 73-93 A. Kaplan and R. Tichatschke Bregman functions and auxiliary problem principle 95-107 Yurii Nesterov Rounding of convex sets and efficient gradient methods for linear programming problems 109-128 P.M. Pardalos, O.A. Prokopyev, O.V Shylo, and V.P. Shylo Global equilibrium search applied to the unconstrained binary quadratic optimization problem 129-140 Roman A. Polyak Primal-dual exterior point method for convex optimization 141-160 Andrzej Ruszczynski A merit function approach to the subgradient method with averaging 161-172 Volume 23, Number 2 (April, 2008) Special Issue Dedicated to Professor Michael J.D. Powell on the Occasion of his 70th Birthday. Guest Editors: Philippe Toint and Ya-xiang Yuan E.G. Birgin and J.M. Martinez Improving ultimate convergence of an augmented Lagrangian method 177-195 R. Byrd, J. Nocedal and R. Waltz Steering exact penalty methods for nonlinear programming 197-213 Andreas Griewank, Sebastian Schlenkrich, and Andrea Walther The optimal r-order of an adjoint Broyden method without assumption of linearly independent steps 215-225 Liusheng Hou and Wenyu Sun On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization 227-235 Donghui Li, Liqun Qi and V. Roshchina A new class of quasi-Newton updating formulas 237-249 Ye Lu and Ya-xiang Yuan An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints 251-258 Maziar Salahi and Tamas Terlaky Mehrotra-type predictor-corrector algoritms revisited 259-273 G. Yu, L. Guan and W.Chen Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization 275-293 Volume 23, Number 3 (June, 2008) Mark Abramson, Olga Brezhneva, John E. Dennis, and Rachael Pingel Pattern search in the presence of degenerate linear constraints 297-319 Roland Griesse, Thomas Grund and Daniel Wachsmuth Update strategies for perturbed nonsmooth equations 321-343 G. Al-Jeiroudi, J. Gondzio and J.A.J. Hall Preconditioning indefinite systems in interior point methods for large scale linear optimization 345-363 O.L. Mangasarian and M.E. Thompson Chunking for massive nonlinear kernel classification 365-374 Yaodong Cui, Tianlong Gu and Wei Hu An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem 375-393 Youjun Deng and Zhenhai Liu Two derivative-free algorithms for nonlinear equations 395-410 Dong X. Shaw, Shucheng Liu and Leonid Kopman A Lagrengian relaxation procedure for cardinality-constrained portfolio optimization 411-420 Yu Xia Complexity of the primal-dual path-following algorithms for the weighted determinant maximisation problems with linear matrix inequalities in the narrow neighbourhood 421-440 Yong Xia Second order cone programming relaxation for the quadratic assignment problem 441-449 Ting Chen and Yong He Optimal recombination algorithms for generalized chains 451-469 Volume 23, Number 4 (August, 2008) Special Issue on Mathematical Programming in Data Mining and Machine Learning Guest Editors: Katya Scheinberg and Jiming Peng Gautam Kunapuli, Kristin P. Bennett, Jing Hu and Jong-Shi Pang Classification model selection via bilevel programming 475-489 Reshma Khemchandani, Jayadeva and Suresh Chandra Linear potential proximal support vector machines for pattern classification 491-500 Joachim Dahl, Lieven Vandenberghe and Vwani Roychowdhury Covariance selection for non-chordal graphs via chordal embedding 501-520 Volkan Vural, Glenn Fung, Jennifer G. Dy and Bharat Rao Fast semi-supervised SVM classifiers using a-priori metric information 521-532 Yongqiao Wang, Xun Zhang, Shouyang Wang and K.K. Lai Nonlinear clustering-based support vector machine for large datasets 533-549 Regular papers: Ahmet Duran and Gunduz Caginalp Parameter optimization for differential equations in asset price forecasting 551-574 Christopher Anand, Tingting Ren and Tamas Terlaky Optimizing teardrop, an MRI sampling trajectory 575-592 Elisa Castorini, Paolo Nobili, and Chefi Triki Optimal routing and resource allocation in multi-hop wireless networks 593-608 T. Pham Dinh, H.A. Le Thi and F. Akoa Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming 609-629 Michael P. Friedlander and Kathrin Hatz Computing nonnegative tensor factorizations 631-647 Volume 23, Number 5 (October, 2008) Special issue: the Joint EUROPT-OMS Conference on Optimization, July 4-7, 2007, Prague, Czech Republic Part I Guest Editors: Regina Burachik, Joerg Fliege and Michal Kocvara M.S. Apostolopoulou, D.G. Sotiropoulos and P. Pintelas Solving the quadratic trust-region subproblem in a low-memory BFGS 651-674 A. Astorino, A. Fuduli and E. Gorgone Nonsmoothness in classification problems 675-688 L.G. Casado, J.A. Martinez, I. Garcia and E.M.T. Hendrix Branch-and-Bound interval global optimization on shared memory multiprocessors 689-701 Deren Han, Liqun Qi and Ed X. Wu Extreme diffusion values for non-Gaussian diffusions 703-716 Eligius M.T. Hendrix and Niels J. Olieman The smoothed Monte Carlo method in robustness optimisation 717-729 Milan Hladik Computing the tolerances in multiobjective linear programming 731-739 Dorit S. Hochbaum and Erick Moreno-Centeno Country credit-risk rating aggregation via the separation-deviation model 741-762 Hezhi Luo, Xiaoling Sun and Huixian Wu Convergence properties of augmented Lagrangian methods for constrained global optimization 763-778 Juana L. Redondo, Jose Fernandez, Inmaculada Garcia and Pilar M. Ortigosa Parallel algorithms for continuous competitive location problems 779-791 N. Sukhorukova A generalisation of the Remez algorithm to a class of linear spline approximation problems with constraints on spline parameters 793-810 F.J. Toledo Some results on Lipschitz properties of the optimal values in semi-infinite programming 811-820 Volume 23, Number 6 (December, 2008) Brian C. Fabien Implementation of a robust SQP algorithm 827-846 E. Huebner and R. Tichatschke Relaxed proximal point algorithms for variational inequalities with multi-valued operators 847-877 Peter Benner, Enrique S. Quintana-Orti, Gregorio Quintana-Orti Solving linear-quadratic optimal control problems on parallel computers 879-909 B. Rustem, S. Zakovic, P. Parpas An interior point algorithm for continuous minimax: Implementation and computation 911-928 Marina Potaptchik, Levent Tuncel, Henry Wolkowicz Large scale portfolio optimization with piecewise linear transaction costs 929-952 Anna von Heusinger and Christian Kanzow SC^1-optimization reformulations of the generalized Nash equilibrium problem 953-973 Arun Sen and David A. Shanno Optimization and dynamical systems algorithms for finding equilibria of stochastic games 975-993 Volume 24, Number 1 (February, 2009) I. Charpentier and J. Utkel Fast higher-order derivative tensors with Rapsodia 1-14 M. Baglietto, M. Sanguineti and R. Zoppoli The extended Ritz method for functional Optimization: Overview and applications to single-person and team optimal decision problems 15-43 Osman Guler, Filiz Gurtuna and Olena Shevchenko Duality in quasi-Newton methods and new variational characterizations of the DFP and BFGS updates 45-62 A.K. Alekseev, I.M. Navon and J.L. Steward Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems 63-87 Neculai Andrei Another nonlinear conjugate gradient algorithm for unconstrained optimization 89-104 Radu Serban A parallel computational model for sensitivity analysis in optimization for robustness 105-121 Zhaosong Lu, Renato D.C. Monteiro and Jerome W. O`Neal An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners 123-143 Giovanni Fasano, Jose Luis Morales and Jorge Nocedal On the geometry phase in model-based algorithms for derivative-free optimization 145-154 Volume 24, Number 2 (April, 2009) Special issue: the Joint EUROPT-OMS Conference on Optimization, July 4-7, 2007, Prague, Czech Republic Part II Guest Editors: Regina Burachik, Joerg Fliege and Michal Kocvara Timo Aittokoski, Sami Ayramo and Kaisa Miettinen Clustering aided approach for decision making in computationally expensive multiobjective optimization 157-174 Robin C. Gilbert and Theodore B. Trafalis Quadratic programming formulations for classification and regression 175-185 Pablo Guerrero-Garcia and Angel Santos-Palomo A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides' primal-dual simplex-type algorithm 187-204 Ronald H.W. Hoppe and Svetozara I. Petrova Path-following methods for shape optimal design of periodic microstructural materials 205-218 Maria Macconi, Benedetta Morini and Margherita Porcelli A Gauss-Newton method for solving bound-constrained underdetermined nonlinear systems 219-235 Andreas Potschka, Hans Georg Bock and Johannes P. Schloeder A minima tracking variant of semi-infinite programming for the treatment of path constraints within direct solution of optimal control problems 237-252 Ana Maria A.C. Rocha and Edite M.G.P. Fernandes Modified movement force vector in a electromagnetism-like mechanism for global optimization 253-270 Georgi V. Smirnov and Vera Sa On the linear convergence of Newton-Krylov methods 271-283 Nadezda Sukhorukova, Julien Ugon and John Yearwood Workload coverage through nonsmooth optimisation 285-298 Ph. L. Toint, D. Tomanos and M. Weber-Mendonca A multilevel algorithm for solving the trust-region subproblem 299-311 Volume 24, Number 3 (June, 2009) Johan Löfberg Dualize it: software for automatic primal and dual conversions of conic programs 313-325 Qing Xu, Xi Dai and Bo Yu Solving generalized Nash equilibrium problem with equality and inequality constrains 327-337 Shao-Jian Qu, Qing-Pu Zhang and Su-Da Jiang A nonmonotone quasi-Newton trust-region method of conic model for unconstrained optimization 339-367 Roman Polyak On the local quadratic convergence of the primal-dual augmented Lagrangian method 369-379 Almir Mutapcic and Stephen Boyd Cutting-set methods for robust convex optimization with pessimizing oracles 381-406 Hiroshi Yamashita and Hiroshi Yabe A primal-dual interior point method for nonlinear optimization over second order cones 407-426 A. Dittel, A. Fuegenschuh, S. Goettlich and M. Herty MIP presolve techniques for a PDE-based supply chain model 427-445 Sheng-Long Hu, Zheng-Hai Huang and Ping Wang A non-monotone smoothing Newton algorithm for solving nonlinear complementarity problems 447-460 Joao P.M. Goncalves, Robert H. Storer and Jacek Gondzio A Family of linear programming algorithms based on an algorithm by von Neumann 461-478 Volume 24, Numbers 4-5 (August-October, 2009) Special issue on global optimization Guest-Editor: Nick Sahinidis Xiaowei Bao, Nikolaos V. Sahinidis, and Mohit Tawarmalani Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs 485-504 Andreas Lundell and Tapio Westerlund Convex underestimation strategies for signomial functionse 505-522 Samuel Burer and Jieqiu Chen A p-cone sequential relaxation procedure for 0-1 integer programs 523-548 Joaquim J. Judice, Hanif D. Sherali, Isabel M. Ribeiro and Silverio S. Rosa On the asymmetric eigenvalue complementarity problem 549-568 Wei Wang, Archis Ghate and Zelda B. Zabinsky Adaptive parameterized Improving Hit-and-Run for global optimization 569-594 Pietro Belotti, Jon Lee, Leo Liberti, Francois Margot and Andreas Wachter Branching and bounds tightening techniques for non-convex MINLP 597-634 Zsolt Ugray, Leon Lasdon, John C. Plummer, and Michael Bussieck Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP 635-656 Youdong Lin and Linus Schrage The global solver in the LINDO API 657-668 A.I.F. Vaz and L.N. Vicente PSwarm: A hybrid solver for linearly constrained global derivative-free optimization 669-685 R. Baker Kearfott GlobSol User Guide 687-708 Y. Lebbah ICOS: A branch and bound based solver for rigorous global optimization 709-726 Ferenc Domes GloptLab - A configurable framework for the rigorous global solution of quadratic constraint satisfaction problems 727-747 L. Pal and T. Csendes INTLAB implementation of an interval global optimization algorithm 749-759 Didier Henrion, Jean-Bernard Lasserre and Johan Lofberg GloptiPoly 3: moments, optimization and semidefinite programming 761-779 Joao M. Natali and Jose M. Pinto Piecewise polynomial interpolations and approximations of one-dimensional functions through mixed integer linear programming 783-803 M.F. Anjos, and G. Yen Provably near-optimal solutions for very large single-row facility layout problems 805-817 Andrea Cassioli, Marco Locatelli and Fabio Schoen Global optimization of binary Lennard-Jones clusters 819-835 Scott R. McAllister and Christodoulos A. Floudas Enhanced bounding techniques to reduce the protein conformational search space 837-855 Dale Henderson and J. Cole Smith An exact reformulation-linearization technique algorithm for solving a parameter extraction problem arising in compact thermal models 857-870 Volume 24, Number 6 (December, 2009) Cosmin Petra, Bogdan Gavrea, Mihai Anitescu and Florian Potra A computational study of the use of an optimization-based method for simulating large multibody systems 871-894 Giancarlo Bigi, Marco Castellani and Massimo Pappalardo A new solution method for equilibrium problems 895-911 Shuisheng Zhou, Hongwei Liu, Feng Ye and Lihua Zhou A new iterative algorithm training SVM 913-932 Xiaojiao Tong, Felix Wu and Liqun Qi Worst-case CVaR based portfolio optimization models with applications to scenario planning 933-958 Etienne de Klerk and Renata Sotirov A new library of structured semidefinite programming instances 959-971 L.E. Torres Guardia and A. Parracho Sant'Anna A separable nonlinear model for the multicommodity flow problem 973-987 Volume 25, Number 1 (February, 2010) Special issue dedicated to Professor Vladimir F. Demyanov on the occasion of his 70th birthday Guest Editors: Masao Fukushima, Manlio Gaudioso, Franco Giannessi and Diethard Pallaschke Adil M. Bagirov and Asef Nazari Ganjehlou A quasisecant method for minimizing nonsmooth functions 3?18 G. Bigi, A. Frangioni and Q. Zhang Approximate optimality conditions and stopping criteria in canonical DC programmings 19?27 Giancarlo Bigi and Barbara Panicucci A successive linear programming algorithm for nonsmooth monotone variational inequalities 29?35 Radu Ioan Bot and Sorin-Mihai Grad Lower semicontinuous type regularity conditions for subdifferential calculus 37?48 Marco Castellani, Massimo Pappalardo and Mauro Passacantando Existence results for nonconvex equilibrium problems 49?58 Manlio Gaudioso and Enrico Gorgone Gradient set splitting in nonconvex nonsmooth numerical optimization 59?74 I. Ginchev, A. Guerraggio and M. Rocca Second-order Dini set-valued directional derivative in C1,1 vector optimization 75?87 J. Grzybowski, D. Pallaschke and R. Urbanski On the amount of minimal pairs of convex sets 89?96 E.A. Nurminski Envelope stepsize control for iterative algorithms based on Fejer processes with attractants 97?108 N. Ovcharova Second-order analysis of the Moreau-Yosida and the Lasry-Lions regularizations 109?116 F. Rinaldi and M. Sciandrone Feature selection combining linear support vector machines and concave optimization 117?128 Vera Roshchina Mordukhovich subdifferential of pointwise minimum of approximate convex functions 129?141 A. Uderzo On a perturbation approach to open mapping theorems 143?167 FORTHCOMING PAPERS Mohammad H. Koulaei and Tamas Terlaky On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization Jian-Wen Peng and Jen-Chih Yao Some new extragradient-like methods for generalized equilibrium problems, fixed points problems and variational inequality problems Napsu Karmitsa and Marko M. Makela Limited memory bundle method for large bound constrained nonsmooth optimization: Convergence analysis A. Malek, N. Hosseinipour-Mahani and S. Ezazipour Efficient recurrent neural network model for the solution of general nonlinear optimization problems Marcia A. Gomes-Ruggiero, Mael Sachine and Sandra A. Santos A spectral updating for the method of moving asymptotes Haibin Zhang On Halley class of methods for unconstrained optimization problems Indra Adrianto and Theodore B. Trafalis The p-center machine for regression analysis Constantin Gaul, Sascha Kurz and Joerg Rambau On the lot-type design problem Serge Gratton and Philippe L. Toint Approximate invariant subspaces and quasi-Newton optimization methods Kun He and Wenqi Huang Solving the single container loading problem by a fast heuristic method O.I. Kostyukova and T.V. Tchemisova Sufficient optimality conditions for convex semi-infinite programming M.I. Velazco, A.R.L. Oliveira and F.F. Campos A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods C.M.O. Pimentel, F.P. e Alvelos and J.M.V. de Carvalho Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem Martin Gugat Michael Herty The smoothed penalty algorithm for state constrained optimal control problems for partial differential equations Julia Sternberg and Michael Hinze A memory-reduced implementation of the Newton-CG method in optimal control of non-linear time dependent PDEs M. Diehl, A. Walther, H.G. Bock and E. Kostina An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization Joshua D. Griffin and Tamara G. Kolda Asynchronous parallel hybrid optimization combining DIRECT and GSS Leonid Faybusovich Jordan-algebraic aspects of optimization: randomization Yong-Jun Wang Improving particle swarm optimization performance with local search for high dimensional function optimization R. De Leone and C. Lazzari Error bounds for support vector machines with application to the identification of active constraints J. Freixas and X. Molinero Weighted games without a unique minimal representation in integers Sanming Liu and Enmin Feng The exponential penalty function method for multiobjective programming problems Guanghui Wang and Song Wang Convergence of a finite element approximation to a degenerate parabolic variational inequality with non-smooth data arising from American option valuation Kai Zhang, Xiaoqi Yang, Song Wang and Kok Lay Teo Numerical performance of penalty method for American option pricing Shigeru Hanba Globally convergent Jacobian-free nonlinear equation solvers based on non-monotone norm descent conditions and a modified line search technique Shaohua Pan and Jein-Shan Chen A least-square semismooth Newton method for the second-order cone complementarity problem Didier Henrion and Jerome Malick Projection methods for conic feasibility problems, applications to polynomial sum-of-squares decompositions Mohamed El Ghami, Cornelis Roos and Trond Steihaug A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions Geir Gundersen and Trond Steihaug On large scale unconstrained optimization problems and higher order methods Ebrahim Nasrabadi and S. Mehdi Hashemi Minimum cost time-varying network flow problems S. Gratton, M. Mouffe, A. Sartenaer, Ph.L. Toint and D. Tomanos Numerical experience with a recursive trust-region method for multilevel nonlinear optimization Enrico Angelelli, Maria Grazia Speranza, József Szoldatics and Zsolt Tuza Geometric representation for semi on-line scheduling on uniform processors Ebrahim Nasrabadi and S. Mehdi Hashemi Minimum cost time-varying network flow problems Csaba Meszaros On the implementation of interior point methods for dual-core platforms M. Halicka and M. Trnovska Limiting behavior and analyticity of weighted central paths in semidefinite programming Alireza Ghaffari-Hadigheh, Oleksandr Romanko and Tamas Terlaky Bi-Parametric Convex Quadratic Optimization K.F.C. Yiu, W.Y. Yan, K.L. Teo and S.Y. Low A new hybrid descent method with application to the optimal design of finite precision FIR filters V. Guigues A stabilized model and an efficient solution method for the yearly optimal power management Debora Mahlke, Alexander Martin and Susanne Moritz A mixed integer approach for time-dependent gas network optimization Adel Hamdi and Andreas Griewank Properties of an augmented Lagrangian for design optimization Zhaosong Lu Robust portfolio selection based on a joint ellipsoidal uncertainty set H. Martin Bucker, Johannes Willkomm, Sven Gross and Oliver Fortmeier Discrete and continuous adjoint approaches to estimate boundary heat fluxes in falling films Luigi Grippo and Marco Sciandrone Nonmonotone globalization of the finite-difference Newton-GMRES method for nonlinear equations Nils Langenberg Convergence analysis of an extended auxiliary problem principle with various stopping criteria W.L. de Oliveira, C. Sagastizabal, D.D.J. Penna, M.E.P. Maceira and J.M. Damazio Optimal scenario tree reduction for stochastic streamflows in power generation planning problems Yaodong Cui and Zhiyong Liu C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction Sven Leyffer and Todd Munson Solving multi-leader-common-follower games S. Ozogur-Akyuz and G.-W. Weber Infinite kernel learning via infinite and semi-infinite programming Felipe Alvarez, Julio Lopez and Hector Ramirez C. Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines F. Guerriero and L. Di Puglia Pugliese Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows