{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RJB346XASRAASYTEVDEWR6VXYY","short_pith_number":"pith:RJB346XA","schema_version":"1.0","canonical_sha256":"8a43be7ae09440096264a8c968fab7c6292d18dbda9b104f6f7a595b5a4ef77f","source":{"kind":"arxiv","id":"1005.4733","version":3},"attestation_state":"computed","paper":{"title":"A Unified Approach for Minimizing Composite Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Garud Iyengar, Necdet Serhat Aybat","submitted_at":"2010-05-26T04:39:41Z","abstract_excerpt":"We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem min |sigma(F(X)-G)|_alpha + |C(X)- d|_beta subject to A(X)-b in Q; where sigma(X) denotes the vector of singular values of X, the matrix norm |sigma(X)|_alpha denotes either the Frobenius, the nuclear, or the L2-operator norm of X, the vector norm |.|_beta denotes either the L1-norm, L2-norm or the L infty-norm; Q is a closed convex set and A(.), C(.), F(.) are linear operators from matrices to vector spaces of appropriate dimensions. Basis pursuit, matrix completion, robust principa"},"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":"1005.4733","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-26T04:39:41Z","cross_cats_sorted":[],"title_canon_sha256":"1cbddf379f595d48d68c081b90c38b7a5189079344bab3701555e613f15cbdfe","abstract_canon_sha256":"960b9def0e547697e0c0a64702b67af28e204796ba91e4ed9d1f9262d174bd6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:22.543880Z","signature_b64":"GlBkgnoqsTzrOBdMCLpriIXeR3Itsqu/YUQmvEM6yW7lrRamRY38MyNXepcLnbHaqIPmsw0jkvWAyvGJuMDMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a43be7ae09440096264a8c968fab7c6292d18dbda9b104f6f7a595b5a4ef77f","last_reissued_at":"2026-05-18T03:49:22.543290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:22.543290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Approach for Minimizing Composite Norms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Garud Iyengar, Necdet Serhat Aybat","submitted_at":"2010-05-26T04:39:41Z","abstract_excerpt":"We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem min |sigma(F(X)-G)|_alpha + |C(X)- d|_beta subject to A(X)-b in Q; where sigma(X) denotes the vector of singular values of X, the matrix norm |sigma(X)|_alpha denotes either the Frobenius, the nuclear, or the L2-operator norm of X, the vector norm |.|_beta denotes either the L1-norm, L2-norm or the L infty-norm; Q is a closed convex set and A(.), C(.), F(.) are linear operators from matrices to vector spaces of appropriate dimensions. Basis pursuit, matrix completion, robust principa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4733","kind":"arxiv","version":3},"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":"1005.4733","created_at":"2026-05-18T03:49:22.543400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.4733v3","created_at":"2026-05-18T03:49:22.543400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4733","created_at":"2026-05-18T03:49:22.543400+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJB346XASRAA","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJB346XASRAASYTE","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJB346XA","created_at":"2026-05-18T12:26:13.927090+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/RJB346XASRAASYTEVDEWR6VXYY","json":"https://pith.science/pith/RJB346XASRAASYTEVDEWR6VXYY.json","graph_json":"https://pith.science/api/pith-number/RJB346XASRAASYTEVDEWR6VXYY/graph.json","events_json":"https://pith.science/api/pith-number/RJB346XASRAASYTEVDEWR6VXYY/events.json","paper":"https://pith.science/paper/RJB346XA"},"agent_actions":{"view_html":"https://pith.science/pith/RJB346XASRAASYTEVDEWR6VXYY","download_json":"https://pith.science/pith/RJB346XASRAASYTEVDEWR6VXYY.json","view_paper":"https://pith.science/paper/RJB346XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.4733&json=true","fetch_graph":"https://pith.science/api/pith-number/RJB346XASRAASYTEVDEWR6VXYY/graph.json","fetch_events":"https://pith.science/api/pith-number/RJB346XASRAASYTEVDEWR6VXYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJB346XASRAASYTEVDEWR6VXYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJB346XASRAASYTEVDEWR6VXYY/action/storage_attestation","attest_author":"https://pith.science/pith/RJB346XASRAASYTEVDEWR6VXYY/action/author_attestation","sign_citation":"https://pith.science/pith/RJB346XASRAASYTEVDEWR6VXYY/action/citation_signature","submit_replication":"https://pith.science/pith/RJB346XASRAASYTEVDEWR6VXYY/action/replication_record"}},"created_at":"2026-05-18T03:49:22.543400+00:00","updated_at":"2026-05-18T03:49:22.543400+00:00"}