Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method

Kuo-Ling Huang
Corresponding Author
Kuo-Ling Huang
[email protected]
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208
Search for more papers by this author
,
Sanjay Mehrotra
Sanjay Mehrotra
[email protected]
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208
Search for more papers by this author

Kuo-Ling Huang

Corresponding Author

Kuo-Ling Huang

[email protected]

Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208

Search for more papers by this author

Sanjay Mehrotra

[email protected]

Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208

Search for more papers by this author

Published Online:8 Nov 2016https://doi.org/10.1287/ijoc.2016.0715

Supplemental Material

ijoc.2016.0715-sm.pdf (422 KB)

cover image INFORMS Journal on Computing

Volume 29, Issue 1

Winter 2017

Pages 1-195

Article Information

Supplemental Material

Metrics

Information

Received:October 01, 2014
Accepted:March 01, 2016
Published Online:November 08, 2016

Cite as

Kuo-Ling Huang, Sanjay Mehrotra (2016) Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method. INFORMS Journal on Computing 29(1):36-53.

https://doi.org/10.1287/ijoc.2016.0715

Keywords

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method

Supplemental Material

Volume 29, Issue 1

Article Information

Supplemental Material

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News