Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications /
Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear p...
Main Author: | |
---|---|
Corporate Author: | |
Format: | Electronic |
Language: | English |
Published: |
Boston, MA :
Springer US,
2002.
|
Series: | Applied Optimization,
65 |
Subjects: | |
Online Access: | View fulltext via EzAccess |
Table of Contents:
- Theory and Algorithms
- Duality, Optimality, and Degeneracy
- The Central Path
- Self-Dual Embeddings
- The Primal Logarithmic Barrier Method
- Primal-Dual Affine-Scaling Methods
- Primal-Dual Path-Following Methods
- Primal-Dual Potential Reduction Methods
- Selected Applications
- Convex Quadratic Approximation
- The Lovász ?-Function
- Graph Coulouring and the Max-K-Cut Problem
- The Stability Number of a Graph and Standard Quadratic Optimization
- The Satisfiability Problem.