The NATO Advanced Study Institute on "Algorithms for continuous optimiza tion: the state of the art" was held September 5-18, 1993, at II Ciocco, Barga, Italy.

In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For prob

Interest in constrained optimization originated with the simple linear pro gramming model since it was practical and perhaps the only computationally tractable

In science, engineering and economics, decision problems are frequently modelled by optimizing the value of a (primary) objective function under stated feasibil

This treatment focuses on the analysis and algebra underlying the workings of convexity and duality and necessary/sufficient local/global optimality conditions