Revision as of 18:44, 4 January 2024 edit Citation bot (talk \| contribs) Bots 5,862,772 edits Alter: title, template type. Add: volume, class, date, title, eprint, chapter-url, chapter, s2cid, authors 1-4. Removed or converted URL. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by Queen of Hearts \| Category:Articles with missing Cite arXiv inputs \| #UCB_Category ← Previous edit		Revision as of 10:31, 19 January 2024 edit undo 2.201.228.140 (talk) Fix spelling mistake Next edit →
Line 197: == Extensions == '''Polynomial ~~optimizaiton~~optimization'''<ref>{{Citation \|last=Tuy \|first=Hoang \|title=Polynomial Optimization \|date=2016 \|url=https://doi.org/10.1007/978-3-319-31484-6_12 \|work=Convex Analysis and Global Optimization \|pages=435–452 \|editor-last=Tuy \|editor-first=Hoang \|access-date=2023-12-16 \|series=Springer Optimization and Its Applications \|volume=110 \|place=Cham \|publisher=Springer International Publishing \|language=en \|doi=10.1007/978-3-319-31484-6_12 \|isbn=978-3-319-31484-6}}</ref> is a more general framework, in which the constraints can be [[polynomial function]]s of any degree, not only 2. ==See also==

Quadratic programming: Difference between revisions