Watch the Dallas Symposium LIVE, and fundraiser auction
Ticket proceeds support mindat.org! - click here...
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Burer, Samuel, Monteiro, Renato D.C. (2003) A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming, 95 (2). 329-357 doi:10.1007/s10107-002-0352-8

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
JournalMathematical Programming
AuthorsBurer, SamuelAuthor
Monteiro, Renato D.C.Author
Year2003 (February 1)Volume95
Issue2
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1007/s10107-002-0352-8Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11269124Long-form Identifiermindat:1:5:11269124:4
GUID0
Full ReferenceBurer, Samuel, Monteiro, Renato D.C. (2003) A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming, 95 (2). 329-357 doi:10.1007/s10107-002-0352-8
Plain TextBurer, Samuel, Monteiro, Renato D.C. (2003) A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming, 95 (2). 329-357 doi:10.1007/s10107-002-0352-8
In(2003, February) Mathematical Programming Vol. 95 (2) Springer Science and Business Media LLC

See Also

These are possibly similar items as determined by title/reference text matching only.

Burer, Samuel, Monteiro, Renato D.C., Zhang, Yin (2002) Solving a class of semidefinite programs via nonlinear programming. Mathematical Programming, 93 (1). 97-122 doi:10.1007/s101070100279
Burer, Samuel, Monteiro, Renato D.C. (2005) Local Minima and Convergence in Low-Rank Semidefinite Programming. Mathematical Programming, 103 (3). 427-444 doi:10.1007/s10107-004-0564-1
Burer, Samuel, Monteiro, Renato D.C., Zhang, Yin (2003) A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. Mathematical Programming, 95 (2). 359-379 doi:10.1007/s10107-002-0353-7
Burer, Samuel, Vandenbussche, Dieter (2008) A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Mathematical Programming, 113 (2). 259-282 doi:10.1007/s10107-006-0080-6
Burer, Samuel, Monteiro, Renato D.C., Zhang, Yin (2002) Maximum stable set formulations and heuristics based on continuous optimization. Mathematical Programming, 94 (1). 137-166 doi:10.1007/s10107-002-0356-4
Sturm, Jos F. (2003) Avoiding numerical cancellation in the interior point method for solving semidefinite programs. Mathematical Programming, 95 (2). 219-247 doi:10.1007/s10107-002-0348-4
Benson, Hande Y., Vanderbei, Robert J. (2003) Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming. Mathematical Programming, 95 (2). 279-302 doi:10.1007/s10107-002-0350-x
Wright, Stephen J. (2003) Constraint identification and algorithm stabilization for degenerate nonlinear programs. Mathematical Programming, 95 (1). 137-160 doi:10.1007/s10107-002-0344-8
Lu, Zhaosong, Nemirovski, Arkadi, Monteiro, Renato D. C. (2007) Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm. Mathematical Programming, 109 (2). 211-237 doi:10.1007/s10107-006-0031-2
T�t�nc�, R. H., Toh, K. C., Todd, M. J. (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Mathematical Programming, 95 (2). 189-217 doi:10.1007/s10107-002-0347-5
Burer, Samuel, Ye, Yinyu (2020) Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Mathematical Programming, 181 (1) 1-17 doi:10.1007/s10107-019-01367-2
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: August 19, 2025 18:43:47
Go to top of page