Infeasible start semidefinite programming algorithms via self-dual embeddings Report 97-10

@inproceedings{Roos1997InfeasibleSS,
  title={Infeasible start semidefinite programming algorithms via self-dual embeddings Report 97-10},
  author={C. Roos and Tam{\'a}s Terlaky},
  year={1997}
}
The development of algorithms for semide nite programming is an active research area, based on extensions of interior point methods for linear programming. As semide nite programming duality theory is weaker than that of linear programming, only partial information can be obtained in some cases of infeasibility, nonzero optimal duality gaps, etc. Infeasible start algorithms have been proposed which yield di erent kinds of information about the solution. In this paper a comprehensive treatment… CONTINUE READING

From This Paper

Topics from this paper.
25 Citations
23 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Interior point trajectories in semide nite program- ming

  • D. Goldfarb, K. Scheinberg
  • Working Paper, Dept. of IEOR,
  • 1996
Highly Influential
8 Excerpts

Combinatorial optimization with interior point methods and semi{ de nite matrices

  • F. Alizadeh
  • PhD thesis,
  • 1991
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…