Revision as of 17:40, 11 March 2024 edit Matthewfahrbach (talk \| contribs) 3 edits m Fix typo: Delete extra period ← Previous edit		Revision as of 06:41, 25 March 2024 edit undo 2601:646:a081:6ff0:e6ed:28be:b283:f762 (talk) Corrected a link inside the caption to redirect to 'Conic optimization' instead of 'Code Optimization'. Tag: Visual edit 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\|A hierarchy of convex optimization problems. (LP: [[linear programming]], QP: [[quadratic programming]], SOCP [[Second-order cone programming\|second-order cone program]], SDP: [[semidefinite programming]], CP: [[~~Code optimization\|cone~~conic optimization]].)]] *[[Linear programming]] problems are the simplest convex programs. In LP, the objective and constraint functions are all linear.

Convex optimization: Difference between revisions