Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions Renato D.C. MonteiroTakashi Tsuchiya Pages: 39 - 53
Metric regularity and quantitative stability in stochastic programs with probabilistic constraints René HenrionWerner Römisch Pages: 55 - 88
Shallow, deep and very deep cuts in the analytic center cutting plane method Jean-Louis GoffinJean-Philippe Vial Pages: 89 - 103
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation Shinji MizunoFlorian Jarre Pages: 105 - 122
Characterization of the smoothness and curvature of a marginal function for a trust-region problem David A. AndrewsLuís N. Vicente Pages: 123 - 135
Asymptotic constraint qualifications and global error bounds for convex inequalities Diethard KlatteWu Li Pages: 137 - 160
Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters Francisco A. M. GomesMaría Cristina MacielJosé Mario Martínez Pages: 161 - 200
Dual conditions characterizing optimality for convex multi-objective programs B.M. GloverV. JeyakumarA.M. Rubinov Pages: 201 - 217