A second-order cone cutting surface method: complexity and application
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-007-9141-x
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
- Jie Sun & Kim-Chuan Toh & Gongyun Zhao, 2002. "An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems," Mathematics of Operations Research, INFORMS, vol. 27(2), pages 332-346, May.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Mohammad R. Oskoorouchi & Hamid R. Ghaffari & Tamás Terlaky & Dionne M. Aleman, 2011. "An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application," Operations Research, INFORMS, vol. 59(5), pages 1184-1197, October.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Chee-Khian Sim, 2019. "Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence," Computational Optimization and Applications, Springer, vol. 74(2), pages 583-621, November.
- Vasile L. Basescu & John E. Mitchell, 2008. "An Analytic Center Cutting Plane Approach for Conic Programming," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 529-551, August.
- Mohammad R. Oskoorouchi & Jean-Louis Goffin, 2005. "An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 127-149, February.
- S. K. Chua & K. C. Toh & G. Y. Zhao, 2004. "Analytic Center Cutting-Plane Method with Deep Cuts for Semidefinite Feasibility Problems," Journal of Optimization Theory and Applications, Springer, vol. 123(2), pages 291-318, November.
- Mohammad R. Oskoorouchi & Hamid R. Ghaffari & Tamás Terlaky & Dionne M. Aleman, 2011. "An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application," Operations Research, INFORMS, vol. 59(5), pages 1184-1197, October.
- John Mitchell & Vasile Basescu, 2008. "Selective Gram–Schmidt orthonormalization for conic cutting surface algorithms," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 67(1), pages 91-115, February.
More about this item
Keywords
Second-order cone; Semidefinite inequality; Cutting plane techniques; Semidefinite programming;All these keywords.
Statistics
Access and download statisticsCorrections
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:43:y:2009:i:3:p:379-409. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.