Methods for Nonconvex Nonlinear Programming : Complementarity Constraints

@inproceedings{Benson2002MethodsFN,
  title={Methods for Nonconvex Nonlinear Programming : Complementarity Constraints},
  author={Hande Y. Benson and David F. Shanno and Robert J. Vanderbei},
  year={2002}
}
In this paper, we present the formulation and solution of optimization problems with complementarity constraints using an interior-point method for nonconvex nonlinear programming. We identify possible difficulties that could arise, such as unbounded faces of dual variables, linear dependence of constraint gradients and initialization issues. We suggest remedies. We include encouraging numerical results on the MacMPEC test suite of problems. 
8 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-8 of 8 extracted citations

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Numerical experience with solving MPECs as NLPs

  • R. Fletcher, S. Leyffer
  • Technical Report Report NA-210, University of…
  • 2002
Highly Influential
7 Excerpts

AMPL: A Modeling Language for Mathematical Programming

  • R. Fourer, D. M. Gay, B. W. Kernighan
  • Scientific Press,
  • 1993
2 Excerpts

Similar Papers

Loading similar papers…