Volume 26, Number 1, 2011

• 
  Shaohua Pan, Jein-Shan Chen: A least-square semismooth Newton method for the second-order cone complementarity problem. 1-22
• 
  Didier Henrion, Jérôme Malick: Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions. 23-46
• 
  Richard H. Byrd, Richard A. Waltz: An active-set algorithm for nonlinear programming using parametric linear programming. 47-66
• 
  V. Guigues: A stabilized model and an efficient solution method for the yearly optimal power management. 67-88
• 
  Zhaosong Lu: Robust portfolio selection based on a joint ellipsoidal uncertainty set. 89-104
• 
  H. Martin Bücker, Johannes Willkomm, Sven Groß, Oliver Fortmeier: Discrete and continuous adjoint approaches to estimate boundary heat fluxes in falling films. 105-125
• 
  Nils Langenberg: Convergence analysis of an extended auxiliary problem principle with various stopping criteria. 127-154
• 
  Yaodong Cui, Zhiyong Liu: C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction. 155-167

Volume 26, Number 2, 2011

• 
  Arnd Rösch, Daniel Wachsmuth: Semi-smooth Newton method for an optimal control problem with control and mixed control-state constraints. 169-186
• 
  Zhe Sun, Jinping Zeng: A damped semismooth Newton method for mixed linear complementarity problems. 187-205
• 
  Juana López Redondo, Blas Pelegrín, Pascual Fernández, Inmaculada García, Pilar Martínez Ortigosa: Finding multiple global optima for unconstrained discrete location problems. 207-224
• 
  Alan P. French, B. Nygreen, John M. Wilson: An LP-based metaheuristic procedure for the k-sequential generalized assignment problem. 225-238
• 
  Christian Kirches, Hans Georg Bock, Johannes P. Schlöder, Sebastian Sager: Block-structured quadratic programming for the direct multiple shooting method for optimal control. 239-257
• 
  Ralph Baker Kearfott: Interval computations, rigour and non-rigour in deterministic continuous global optimization. 259-279
• 
  Yongkai Liu, Defu Zhang, Francis Y. L. Chin: A clique-based algorithm for constructing feasible timetables. 281-294
• 
  Francesca Guerriero, Luigi Di Puglia Pugliese: Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows. 295-340

• 
  Christodoulos A. Floudas: Nonlinear analysis and variational problems - in honour of George Isac. 341

Volume 26, Number 3, 2011

• 
  Andreas Griewank: Obituary for Charles Broyden. 343-344

• 
  Botond Bertók, Zoltán Süle, Tamás Terlaky: Preface. 345-346

• 
  Pawel Bialon: Cases of ineffectiveness of geometric cuts in sequential projection methods. 347-361
• 
  Kristijan Cafuta, Igor Klep, Janez Povh: NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials. 363-380
• 
  Milan Hladík: Tolerance analysis in linear systems and linear programming. 381-396
• 
  Csanád Imreh, Tamás Németh: Parameter learning algorithm for the online data acknowledgment problem. 397-404
• 
  Radomil Matousek, Eva Zampachova: Promising GAHC and HC12 algorithms in global optimization tasks. 405-419
• 
  Csaba Mészáros: Solving quadratically constrained convex optimization problems with an interior-point method. 421-429
• 
  Lingfeng Niu, Ya-Xiang Yuan: A parallel decomposition algorithm for training multiclass kernel-based vector machines. 431-454
• 
  Figen Öztoprak, S. Ilker Birbil: A symmetric rank-one quasi-Newton line-search method using negative curvature directions. 455-486
• 
  Remigijus Paulavicius, Julius Zilinskas, Andreas Grothey: Parallel branch and bound for global optimization with combination of Lipschitz bounds. 487-498
• 
  Julius Zilinskas, Mirjam Dür: Depth-first simplicial partition for copositivity detection, with an application to MaxClique. 499-510

Volume 26, Numbers 4-5, 2011

• 
  Charlie Elliott, Michael Hintermüller, Günter Leugering, Jan Sokolowski: Special issue on advances in shape and topology optimization: theory, numerics and new applications areas. 511-512

• 
  Michael Hintermüller, V. A. Kovtunenko: From shape variation to topological changes in constrained minimization: a velocity method-based concept. 513-532
• 
  H. S. Ho, Bonnie F. Y. Lui, Michael Yu Wang: Parametric structural optimization with radial basis functions and partition of unity method. 533-553
• 
  Samuel Amstutz: Analysis of a level set method for topology optimization. 555-573
• 
  R. Dziri, Jean-Paul Zolésio: Drag reduction for non-cylindrical Navier-Stokes flows. 575-600
• 
  Jukka I. Toivanen, Raino A. E. Mäkinen: Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization. 601-616
• 
  O. Lass, Christoph Posch, G. Scharrer, Stefan Volkwein: Space mapping techniques for a structural optimization problem governed by the p-Laplace equation. 617-642
• 
  Harbir Antil, Matthias Heinkenschloss, Ronald H. W. Hoppe: Domain decomposition and balanced truncation model reduction for shape optimization of the Stokes system. 643-669
• 
  Juan Carlos de los Reyes, Tatjana Stykel: A balanced truncation-based strategy for optimal control of evolution problems. 671-692
• 
  Stephen G. Nash, Robert Michael Lewis: Assessing the performance of an optimization-based multilevel method. 693-717
• 
  Alex A. Kurzhanskiy, Pravin Varaiya: Theory and computational techniques for analysis of discrete-time control systems with disturbances. 719-746
• 
  Stefano Berrone, M. Verani: A new marking strategy for the adaptive finite element approximation of optimal control constrained problems. 747-775
• 
  Michael Hintermüller, Michael Hinze, Moulay Hicham Tber: An adaptive finite-element Moreau-Yosida-based solver for a non-smooth Cahn-Hilliard problem. 777-811
• 
  Liming Feng, Vadim Linetsky, José Luis Morales, Jorge Nocedal: On the solution of complementarity problems arising in American options pricing. 813-825
• 
  Yair Censor, Aviv Gibali, Simeon Reich: Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space. 827-845
• 
  Alexey F. Izmailov, A. L. Pogosyan, Mikhail V. Solodov: Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints. 847-872
• 
  Serge Gratton, Philippe L. Toint, Anke Tröltzsch: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization. 873-894

Volume 26, Number 6, 2011

• 
  Yu-Hong Dai: Convergence of conjugate gradient methods with constant stepsizes. 895-909
• 
  Hande Y. Benson: Mixed integer nonlinear programming using interior-point methods. 911-931
• 
  Yufeng Shang, Qing Xu, Bo Yu: A globally convergent non-interior point homotopy method for solving variational inequalities. 933-943
• 
  B. A. Sawyerr, M. M. Ali, A. O. Adewumi: A comparative study of some real-coded genetic algorithms for unconstrained global optimization. 945-970
• 
  F. Rinaldi: Concave programming for finding sparse solutions to problems with convex constraints. 971-992
• 
  Anthony Almudevar: A commentary on some recent methods in sibling group reconstruction based on set coverings. 993-1003

last updated on Thu May 23 04:34:50 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page