The solution of convex and non-convex optimisation problems, including those involving linear, quadratic and nonlinear programming, are vital concerns. Both theoretical analysis, involving complexity and convergence, and practical issues, such as the design and implementation of new algorithms, are considered.
