Jump to content

Talk:Sequential quadratic programming

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This entry appears to plagiarize the article it cites.

Compare:

http://en.wikipedia.org/wiki/Sequential_quadratic_programming

http://www-fp.mcs.anl.gov/otc/Guide/OptWeb/continuous/constrained/nonlinearcon/section2_1_1.html

Consider putting implementations in a table

Might be useful to list: Author, Year of initial work and latest changes, algorithm used, memory usage, if bounds are supported, and licensing. For example, in the nlopt documentation, the SLSQP code requires O(n^2) storage and O(n^3) time. That's useful guidance for potential users. https://nlopt.readthedocs.io/en/latest/NLopt_Algorithms/#slsqp — Preceding unsigned comment added by Ericjster (talk • contribs) 07:05, 1 February 2019 (UTC)[reply]

What is y_i ?

It is never defined. — Preceding unsigned comment added by 2607:F2C0:E01A:61:DCBD:3A25:5743:E076 (talk) 01:14, 29 December 2019 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Sequential_quadratic_programming&oldid=1230550093"