Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
The first elementary exposition of core ideas of complexity theory for convex optimization, this book explores optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. Also covers polynomial-time interior-point methods.
Multicriteria analysis is a rapidly growing aspect of operations research and management science, with numerous practical applications in a wide range of fields. This book presents all the recent advances in multicriteria analysis, including multicriteria optimization, goal programming, outranking methods, and disaggregation techniques.
Collects papers that cover such areas as linear and nonlinear complementarity problems, variational inequality problems, nonsmooth equations and nonsmooth optimization problems, economic and network equilibrium problems, semidefinite programming problems, maximal monotone operator problems, and mathematical programs with equilibrium constraints.
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.