{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J3THCQ7BBF5H23NRSHNO52NUBO","short_pith_number":"pith:J3THCQ7B","schema_version":"1.0","canonical_sha256":"4ee67143e1097a7d6db191daeee9b40b80e2ba36c4c5c592e60dba30f51e04ea","source":{"kind":"arxiv","id":"1812.10349","version":1},"attestation_state":"computed","paper":{"title":"Fast minimization of structured convex quartics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Brian Bullins","submitted_at":"2018-12-26T15:54:35Z","abstract_excerpt":"We propose faster methods for unconstrained optimization of \\emph{structured convex quartics}, which are convex functions of the form \\begin{equation*} f(x) = c^\\top x + x^\\top \\mathbf{G} x + \\mathbf{T}[x,x,x] + \\frac{1}{24} \\mathopen\\| \\mathbf{A} x \\mathclose\\|_4^4 \\end{equation*} for $c \\in \\mathbb{R}^d$, $\\mathbf{G} \\in \\mathbb{R}^{d \\times d}$, $\\mathbf{T} \\in \\mathbb{R}^{d \\times d \\times d}$, and $\\mathbf{A} \\in \\mathbb{R}^{n \\times d}$ such that $\\mathbf{A}^\\top \\mathbf{A} \\succ 0$. In particular, we show how to achieve an $\\epsilon$-optimal minimizer for such functions with only $O(n^{"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1812.10349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-26T15:54:35Z","cross_cats_sorted":[],"title_canon_sha256":"d78f68343f912deece672c3bcc7e3e694d95ac13be36d49764bc052409cb2baa","abstract_canon_sha256":"427181edcc817717d1d9ed8e8c00e291b62d64955281e682b45d4c2b4d257b16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:24.385142Z","signature_b64":"LGR2Bu1CQs7wPQtcyhtv/I4J8SOwH0iT/71Wo8mjm4sZ0ts8OCzCxi4TuYB7AysTVJI2P54Yqt2f051swh/DAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee67143e1097a7d6db191daeee9b40b80e2ba36c4c5c592e60dba30f51e04ea","last_reissued_at":"2026-05-17T23:57:24.384583Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:24.384583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast minimization of structured convex quartics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Brian Bullins","submitted_at":"2018-12-26T15:54:35Z","abstract_excerpt":"We propose faster methods for unconstrained optimization of \\emph{structured convex quartics}, which are convex functions of the form \\begin{equation*} f(x) = c^\\top x + x^\\top \\mathbf{G} x + \\mathbf{T}[x,x,x] + \\frac{1}{24} \\mathopen\\| \\mathbf{A} x \\mathclose\\|_4^4 \\end{equation*} for $c \\in \\mathbb{R}^d$, $\\mathbf{G} \\in \\mathbb{R}^{d \\times d}$, $\\mathbf{T} \\in \\mathbb{R}^{d \\times d \\times d}$, and $\\mathbf{A} \\in \\mathbb{R}^{n \\times d}$ such that $\\mathbf{A}^\\top \\mathbf{A} \\succ 0$. In particular, we show how to achieve an $\\epsilon$-optimal minimizer for such functions with only $O(n^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10349","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.10349","created_at":"2026-05-17T23:57:24.384675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10349v1","created_at":"2026-05-17T23:57:24.384675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10349","created_at":"2026-05-17T23:57:24.384675+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3THCQ7BBF5H","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3THCQ7BBF5H23NR","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3THCQ7B","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO","json":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO.json","graph_json":"https://pith.science/api/pith-number/J3THCQ7BBF5H23NRSHNO52NUBO/graph.json","events_json":"https://pith.science/api/pith-number/J3THCQ7BBF5H23NRSHNO52NUBO/events.json","paper":"https://pith.science/paper/J3THCQ7B"},"agent_actions":{"view_html":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO","download_json":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO.json","view_paper":"https://pith.science/paper/J3THCQ7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10349&json=true","fetch_graph":"https://pith.science/api/pith-number/J3THCQ7BBF5H23NRSHNO52NUBO/graph.json","fetch_events":"https://pith.science/api/pith-number/J3THCQ7BBF5H23NRSHNO52NUBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/action/storage_attestation","attest_author":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/action/author_attestation","sign_citation":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/action/citation_signature","submit_replication":"https://pith.science/pith/J3THCQ7BBF5H23NRSHNO52NUBO/action/replication_record"}},"created_at":"2026-05-17T23:57:24.384675+00:00","updated_at":"2026-05-17T23:57:24.384675+00:00"}