Revision as of 17:16, 26 February 2024 edit Starlighsky (talk \| contribs) Extended confirmed users 8,256 edits m →Special cases: Added links and minor correction Tags: nowiki added Visual edit Newcomer task Newcomer task: references ← Previous edit		Revision as of 17:19, 26 February 2024 edit undo Starlighsky (talk \| contribs) Extended confirmed users 8,256 edits m →Special cases Tags: Visual edit Newcomer task Newcomer task: references Next edit →
Line 72: {{cite journal \|last1=Agrawal \|first1=Akshay \|last2=Verschueren \|first2=Robin \|last3=Diamond \|first3=Steven \|last4=Boyd \|first4=Stephen \|year=2018 \|title=A rewriting system for convex optimization problems \|url=https://web.stanford.edu/~boyd/papers/pdf/cvxpy_rewriting.pdf \|journal=Control and Decision \|volume=5 \|issue=1 \|pages=42–60 \|arxiv=1709.04494 \|doi=10.1080/23307706.2017.1397554 \|s2cid=67856259}}</ref> [[File:Hierarchy compact convex.png\|thumb\|~~<nowiki>~~A hierarchy of convex optimization problems. (LP: [[linear ~~program~~programming]], QP: [[quadratic ~~program~~programming]], SOCP [[Second-order cone programming\|second-order cone program]], SDP: [[semidefinite ~~program~~programming]], CP: [[Code optimization\|cone optimization]].)~~</nowiki>~~]] *[[Linear programming]] problems are the simplest convex programs. In LP, the objective and constraint functions are all linear.

Convex optimization: Difference between revisions