This volume contains refereed papers presented at the workshop on ""Semidefinite Programming and Interior-Point Approaches for Combinatorial Optimization Problems"" held at The Fields Institute in May 1996. Semidefinite programming (SDP) is a generalization of linear programming (LP) in that the nonnegativity constraints on the variables are replaced by a positive semidefinite constraint on matrix variables. Many of the elegant theoretical properties and powerful solution techniques follow through from LP to SDP. In particular, the primal-dual interior-point methods, which are currently so successful for LP, can be used to efficiently solve SDP problems.In addition to the interesting theoretical and algorithmic questions, SDP has found many important applications in combinatorial optimization, control theory and other areas of mathematical programming. SDP is currently a very hot area of research. The papers in this volume cover a wide spectrum of recent developments in SDP. The volume would be suitable as a textbook for advanced courses in optimization.
Publisher: American Mathematical Society
Weight: 709 g
You may also be interested in...
Please sign in to write a review
Thank you for your reservation
Your order is now being processed and we have sent a confirmation email to you at
When will my order be ready to collect?
Call us on or send us an email at
Unfortunately there has been a problem with your order
Please try again or alternatively you can contact your chosen shop on or send us an email at