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

Grippo, Luigi, Palagi, Laura, Piccialli, Veronica (2011) An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Mathematical Programming, 126 (1). 119-146 doi:10.1007/s10107-009-0275-8

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleAn unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
JournalMathematical Programming
AuthorsGrippo, LuigiAuthor
Palagi, LauraAuthor
Piccialli, VeronicaAuthor
Year2011 (January)Volume126
Issue1
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1007/s10107-009-0275-8Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11270704Long-form Identifiermindat:1:5:11270704:4
GUID0
Full ReferenceGrippo, Luigi, Palagi, Laura, Piccialli, Veronica (2011) An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Mathematical Programming, 126 (1). 119-146 doi:10.1007/s10107-009-0275-8
Plain TextGrippo, Luigi, Palagi, Laura, Piccialli, Veronica (2011) An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem. Mathematical Programming, 126 (1). 119-146 doi:10.1007/s10107-009-0275-8
In(2011, January) Mathematical Programming Vol. 126 (1) Springer Science and Business Media LLC

See Also

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

Grippo, Luigi, Palagi, Laura, Piacentini, Mauro, Piccialli, Veronica, Rinaldi, Giovanni (2012) SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances. Mathematical Programming, 136 (2). 353-373 doi:10.1007/s10107-012-0593-0
Ma, Shiqian, Goldfarb, Donald, Chen, Lifeng (2011) Fixed point and Bregman iterative methods for matrix rank minimization. Mathematical Programming, 128 (1). 321-353 doi:10.1007/s10107-009-0306-5
Lu, Shu (2011) Implications of the constant rank constraint qualification. Mathematical Programming, 126 (2). 365-392 doi:10.1007/s10107-009-0288-3
Li, Wenjing; Bian, Wei; Toh, Kim-Chuan (2025) On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models. Mathematical Programming, 212 (1). doi:10.1007/s10107-024-02103-1
Piccialli, Veronica; Sudoso, Antonio M. (2025) Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming. Mathematical Programming, 211 (1). doi:10.1007/s10107-023-02021-8
Hemmecke, Raymond, Onn, Shmuel, Weismantel, Robert (2011) A polynomial oracle-time algorithm for convex integer minimization. Mathematical Programming, 126 (1). 97-117 doi:10.1007/s10107-009-0276-7
Chen, Jein-Shan, Tseng, Paul (2005) An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. Mathematical Programming, 104 (2). 293-327 doi:10.1007/s10107-005-0617-0
Chakrabarty, Deeparnab, Devanur, Nikhil R., Vazirani, Vijay V. (2011) New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. Mathematical Programming, 130 (1). 1-32 doi:10.1007/s10107-009-0299-0
Lu, Zhaosong (2014) Iterative reweighted minimization methods for $$l_p$$ l p regularized unconstrained nonlinear programming. Mathematical Programming, 147 (1). 277-307 doi:10.1007/s10107-013-0722-4
Wang, Alex L., Kılınç-Karzan, Fatma (2022) On the tightness of SDP relaxations of QCQPs. Mathematical Programming, 193 (1) 33-73 doi:10.1007/s10107-020-01589-9
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
 
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 06:57:09
Go to top of page