Optimization Methods and Software , Volume 23

Volume 23, Number 1, 2008

Original Articles

• 
  Selin Damla Ahipasaoglu, Peng Sun, Michael J. Todd:
  Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids. 5-19
• 
  Dan Butnariu, 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 N. Iusem, Alberto Seeger:
  Antipodal pairs, critical pairs, and Nash angular equilibria in convex cones. 73-93
• 
  Alexander Kaplan, Rainer Tichatschke:
  Bregman functions and auxiliary problem principle. 95-107
• 
  Yurii E. Nesterov:
  Rounding of convex sets and efficient gradient methods for linear programming problems. 109-128
• 
  Panos M. Pardalos, Oleg A. Prokopyev, Oleg V. Shylo, Vladimir 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

Book Reviews

• 
  Panos M. Pardalos:
  Book review. 173

Volume 23, Number 2, 2008

Special Issue: Dedicated to Professor Michael J.D. Powell on the occasion of his 70th birthday Preface

• 
  Philippe L. Toint, Ya-Xiang Yuan:
  Preface. 175-176

Original Articles

• 
  Ernesto G. Birgin, José Mario Martínez:
  Improving ultimate convergence of an augmented Lagrangian method. 177-195
• 
  Richard H. Byrd, Jorge Nocedal, Richard A. Waltz:
  Steering exact penalty methods for nonlinear programming. 197-213
• 
  Andreas Griewank, Sebastian Schlenkrich, Andrea Walther:
  Optimal r-order of an adjoint Broyden method without the assumption of linearly independent steps. 215-225
• 
  Liusheng Hou, Wenyu Sun:
  On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization. 227-235
• 
  Dong-Hui Li, Liqun Qi, Vera Roshchina:
  A new class of quasi-Newton updating formulas. 237-249
• 
  Ye Lu, Ya-Xiang Yuan:
  An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints. 251-258
• 
  Maziar Salahi, Tamás Terlaky:
  Mehrotra-type predictor-corrector algorithm revisited. 259-273
• 
  Gaohang Yu, Lutai Guan, Wufan Chen:
  Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization. 275-293

Book Reviews

• 
  Raymond J. Spiteri:
  Book Review. 295-296

Volume 23, Number 3, 2008

Original Articles

• 
  Mark A. Abramson, Olga Brezhneva, John E. Dennis Jr., Rachael L. Pingel:
  Pattern search in the presence of degenerate linear constraints. 297-319
• 
  Roland Griesse, Thomas Grund, Daniel Wachsmuth:
  Update strategies for perturbed nonsmooth equations. 321-343
• 
  Ghussoun Al-Jeiroudi, Jacek Gondzio, J. A. Julian Hall:
  Preconditioning indefinite systems in interior point methods for large scale linear optimisation. 345-363
• 
  O. L. Mangasarian, M. E. Thompson:
  Chunking for massive nonlinear kernel classification. 365-374
• 
  Yaodong Cui, Tianlong Gu, Wei Hu:
  An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem. 375-393
• 
  Youjun Deng, Zhenhai Liu:
  Two derivative-free algorithms for nonlinear equations. 395-410
• 
  Dong X. Shaw, Shucheng Liu, Leonid Kopman:
  Lagrangian relaxation procedure for cardinality-constrained portfolio optimization. 411-420
• 
  Yu Xia:
  Complexity of the primal-dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood. 421-440
• 
  Yong Xia:
  Second order cone programming relaxation for quadratic assignment problems. 441-449
• 
  Ting Chen, Yong He:
  Optimal recombination algorithms for generalized chains. 451-469

Book Reviews

• 
  Panos M. Pardalos:
  Book Review. 471-472

Volume 23, Number 4, 2008

Special Issue: Mathematical programming in data mining and machine learning Preface

• 
  Katya Scheinberg, Jiming Peng:
  PREFACESpecial section on mathematical programming in data mining and machine learning. 473-474

Original Articles

• 
  Gautam Kunapuli, Kristin P. Bennett, Jing Hu, Jong-Shi Pang:
  Classification model selection via bilevel programming. 475-489
• 
  Reshma Khemchandani, Jayadeva, Suresh Chandra:
  Linear potential proximal support vector machines for pattern classification. 491-500
• 
  Joachim Dahl, Lieven Vandenberghe, Vwani P. Roychowdhury:
  Covariance selection for nonchordal graphs via chordal embedding. 501-520
• 
  Volkan Vural, Glenn Fung, Jennifer G. Dy, Bharat Rao:
  Fast semi-supervised SVM classifiers using a priori metric information. 521-532
• 
  Yongqiao Wang, Xun Zhang, Shouyang Wang, K. K. Lai:
  Nonlinear clustering-based support vector machine for large data sets. 533-549

Regular papers

• 
  Ahmet Duran, Gunduz Caginalp:
  Parameter optimization for differential equations in asset price forecasting. 551-574
• 
  Christopher Kumar Anand, Tingting Ren, Tamás Terlaky:
  Optimizing Teardrop, an MRI sampling trajectory. 575-592
• 
  Elisa Castorini, Paolo Nobili, Chefi Triki:
  Optimal routing and resource allocation in multi-hop wireless networks. 593-608
• 
  Tao Pham Dinh, Hoai An Le Thi, F. Akoa:
  Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming. 609-629
• 
  Michael P. Friedlander, Kathrin Hatz:
  Computing non-negative tensor factorizations. 631-647

Volume 23, Number 5, 2008

The Joint Europt-OMS Conference on Optimization, 4-7 July, 2007, Prague, Czech Republic, Part I Preface

• 
  Regina Sandra Burachik, Jörg Fliege, Michal Kocvara:
  Preface. 649-650

Original Articles

• 
  M. S. Apostolopoulou, Dimitris G. Sotiropoulos, Panayiotis E. Pintelas:
  Solving the quadratic trust-region subproblem in a low-memory BFGS framework. 651-674
• 
  Annabella Astorino, Antonio Fuduli, Enrico Gorgone:
  Non-smoothness in classification problems. 675-688
• 
  Leocadio G. Casado, J. A. Martínez, Inmaculada García, Eligius M. T. Hendrix:
  Branch-and-Bound interval global optimization on shared memory multiprocessors. 689-701
• 
  Deren Han, Liqun Qi, Ed X. Wu:
  Extreme diffusion values for non-Gaussian diffusions. 703-716
• 
  Eligius M. T. Hendrix, Niels J. Olieman:
  The smoothed Monte Carlo method in robustness optimization. 717-729
• 
  Milan Hladík:
  Computing the tolerances in multiobjective linear programming. 731-739
• 
  Dorit S. Hochbaum, Erick Moreno-Centeno:
  Country credit-risk rating aggregation via the separation-deviation model. 741-762
• 
  Hezhi Luo, Xiaoling Sun, Huixian Wu:
  Convergence properties of augmented Lagrangian methods for constrained global optimization. 763-778
• 
  Juana López Redondo, José Fernández, Inmaculada García, Pilar Martínez Ortigosa:
  Parallel algorithms for continuous competitive location problems. 779-791
• 
  Nadezda Sukhorukova:
  A generalization of the Remez algorithm to a class of linear spline approximation problems with constraints on spline parameters. 793-810
• 
  F. Javier Toledo:
  Some results on Lipschitz properties of the optimal values in semi-infinite programming. 811-820

Book Reviews

• 
  Richard W. Cottle:
  Book Review. 821-825

Volume 23, Number 6, 2008

Original Articles

• 
  Brian C. Fabien:
  Implementation of a robust SQP algorithm. 827-846
• 
  Ewgenij Huebner, Rainer Tichatschke:
  Relaxed proximal point algorithms for variational inequalities with multi-valued operators. 847-877
• 
  Peter Benner, Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí:
  Solving linear-quadratic optimal control problems on parallel computers. 879-909
• 
  Berç Rustem, Stanislav Zakovic, Panos Parpas:
  An interior point algorithm for continuous minimax: implementation and computation. 911-928
• 
  Marina Potaptchik, Levent Tunçel, Henry Wolkowicz:
  Large scale portfolio optimization with piecewise linear transaction costs. 929-952
• 
  Anna von Heusinger, Christian Kanzow:
  SC ¹ optimization reformulations of the generalized Nash equilibrium problem. 953-973
• 
  Arun Sen, David F. Shanno:
  Optimization and dynamical systems algorithms for finding equilibria of stochastic games. 975-993