On solving Linear Complementarity Problems by DC programming and DCA
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Computational Optimization and Applications.
Volume (Year): 50 (2011)
Issue (Month): 3 (December)
Contact details of provider:
Web page: http://www.springer.com/math/journal/10589
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Joaquim Júdice & Ana Faustino & Isabel Ribeiro, 2002. "On the solution of NP-hard linear complementarity problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 10(1), pages 125-145, June.
- Joaquim Júdice, 2012. "Algorithms for linear programming with linear complementarity constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 20(1), pages 4-25, April.
- Liming Yang & Laisheng Wang, 2013. "A class of semi-supervised support vector machines by DC programming," Advances in Data Analysis and Classification, Springer, vol. 7(4), pages 417-433, December.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.