Vote for your favorite mineral in #MinCup25! - Stibnite vs. Okenite
It's a battle of dark and light as soft, dramatic stibnite goes up against adorable cottonballs of Okenite.
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

Xu, Song (2004) A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints. Computational Optimization and Applications, 27 (3). 285-303 doi:10.1023/b:coap.0000013060.16224.31

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints
JournalComputational Optimization and Applications
AuthorsXu, SongAuthor
Year2004 (March)Volume27
Issue3
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1023/b:coap.0000013060.16224.31Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID9538437Long-form Identifiermindat:1:5:9538437:3
GUID0
Full ReferenceXu, Song (2004) A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints. Computational Optimization and Applications, 27 (3). 285-303 doi:10.1023/b:coap.0000013060.16224.31
Plain TextXu, Song (2004) A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints. Computational Optimization and Applications, 27 (3). 285-303 doi:10.1023/b:coap.0000013060.16224.31
In(2004, March) Computational Optimization and Applications Vol. 27 (3) Springer Science and Business Media LLC

See Also

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

Kuo, Yu-Ju, Mittelmann, Hans D. (2004) Interior Point Methods for Second-Order Cone Programming and OR Applications. Computational Optimization and Applications, 28 (3). 255-285 doi:10.1023/b:coap.0000033964.95511.23
Griva, Igor (2004) Numerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming. Computational Optimization and Applications, 29 (2). 173-195 doi:10.1023/b:coap.0000042029.73199.83
Bellavia, Stefania, Pieraccini, Sandra (2004) Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming. Computational Optimization and Applications, 29 (3). 289-313 doi:10.1023/b:coap.0000044183.43473.34
Chen, Xiaojun, Fukushima, Masao (2004) A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints. Computational Optimization and Applications, 27 (3). 223-246 doi:10.1023/b:coap.0000013057.54647.6d
Zhou, Guanglu, Toh, Kim-Chuan, Zhao, Gongyun (2004) Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems. Computational Optimization and Applications, 27 (3). 269-283 doi:10.1023/b:coap.0000013059.84424.af
Rosen, J. Ben, Marcia, Roummel F. (2004) Convex Quadratic Approximation. Computational Optimization and Applications, 28 (2). 173-184 doi:10.1023/b:coap.0000026883.13660.84
Drummond, L.M. Graña, Iusem, A.N. (2004) A Projected Gradient Method for Vector Optimization Problems. Computational Optimization and Applications, 28 (1). 5-29 doi:10.1023/b:coap.0000018877.86161.8b
Dostal, Zdenek, Schoberl, Joachim (2005) Minimizing Quadratic Functions Subject to Bound Constraints with the Rate of Convergence and Finite Termination. Computational Optimization and Applications, 30 (1). 23-43 doi:10.1023/b:coap.0000049888.80264.25
Obuchowska, W.T. (2004) On the Minimizing Trajectory of Convex Functions with Unbounded Level Sets. Computational Optimization and Applications, 27 (1). 37-52 doi:10.1023/b:coap.0000004979.76493.d4
Li, Dong-Hui, Fukushima, Masao, Qi, Liqun, Yamashita, Nobuo (2004) Regularized Newton Methods for Convex Minimization Problems with Singular Solutions. Computational Optimization and Applications, 28 (2). 131-147 doi:10.1023/b:coap.0000026881.96694.32
Alejandre, J.L., Allueva, Ana, Gonzalez, Jose Miguel (2004) A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming. Computational Optimization and Applications, 27 (1). 83-93 doi:10.1023/b:coap.0000004981.17496.9c
 
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: September 2, 2025 03:36:15
Go to top of page