Volume 26, Number 1, 2011 Original Articles
, Jérôme Malick
: Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions.
: A stabilized model and an efficient solution method for the yearly optimal power management.
: Robust portfolio selection based on a joint ellipsoidal uncertainty set.
: Convergence analysis of an extended auxiliary problem principle with various stopping criteria.
, Zhiyong Liu
: C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction.
Volume 26, Number 2, 2011 Original Articles
, Daniel Wachsmuth
: Semi-smooth Newton method for an optimal control problem with control and mixed control-state constraints.
, Jinping Zeng
: A damped semismooth Newton method for mixed linear complementarity problems.
Ralph Baker Kearfott
: Interval computations, rigour and non-rigour in deterministic continuous global optimization.
Volume 26, Number 3, 2011 Miscellany
: Cases of ineffectiveness of geometric cuts in sequential projection methods.
: Tolerance analysis in linear systems and linear programming.
: Solving quadratically constrained convex optimization problems with an interior-point method.
, Ya-Xiang Yuan
: A parallel decomposition algorithm for training multiclass kernel-based vector machines.
, Mirjam Dür
: Depth-first simplicial partition for copositivity detection, with an application to MaxClique.
Volume 26, Numbers 4-5, 2011 Special Issue:
Advances in Shape and Topology Optimization:
Theory, Numerics and New Applications Areas Miscellany
: Analysis of a level set method for topology optimization.
, M. Verani
: A new marking strategy for the adaptive finite element approximation of optimal control constrained problems.
Volume 26, Number 6, 2011 Original Articles
: Convergence of conjugate gradient methods with constant stepsizes.
Hande Y. Benson
: Mixed integer nonlinear programming using interior-point methods.
, Qing Xu
, Bo Yu
: A globally convergent non-interior point homotopy method for solving variational inequalities.
: Concave programming for finding sparse solutions to problems with convex constraints.
: A commentary on some recent methods in sibling group reconstruction based on set coverings.