Adaptive constraint reduction for convex quadratic programming
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Kalyanmoy Deb & Soumil Srivastava, 2012. "A genetic algorithm based augmented Lagrangian method for constrained optimization," Computational Optimization and Applications, Springer, pages 869-902.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Da Tian, 2015. "An exterior point polynomial-time algorithm for convex quadratic programming," Computational Optimization and Applications, Springer, pages 51-78.
More about this item
KeywordsConvex quadratic programming; Constraint reduction; Column generation; Primal-dual interior-point method;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:51:y:2012:i:1:p:125-157. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .
We have no references for this item. You can help adding them by using this form .