{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EVOYNFXJAV5MNV3GRMRSC73IQ6","short_pith_number":"pith:EVOYNFXJ","schema_version":"1.0","canonical_sha256":"255d8696e9057ac6d7668b23217f68878cdd6920ac44d8d0f0bac262b78cac97","source":{"kind":"arxiv","id":"1509.08007","version":3},"attestation_state":"computed","paper":{"title":"Approximate Projection Methods for Decentralized Optimization with Functional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael M. Zavlanos, Soomin Lee","submitted_at":"2015-09-26T16:41:58Z","abstract_excerpt":"We consider distributed convex optimization problems that involve a separable objective function and nontrivial functional constraints, such as Linear Matrix Inequalities (LMIs). We propose a decentralized and computationally inexpensive algorithm which is based on the concept of approximate projections. Our algorithm is one of the consensus based methods in that, at every iteration, each agent performs a consensus update of its decision variables followed by an optimization step of its local objective function and local constraints. Unlike other methods, the last step of our method is not an "},"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":"1509.08007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-26T16:41:58Z","cross_cats_sorted":[],"title_canon_sha256":"c86bd14ad8c80af9a5c71619fbc4bd5bb56802704cfc91c7ad137d35f8b680c6","abstract_canon_sha256":"bdd1ac0b0d7f73e20f5c65259a63f981b6fd0b4a49cf4d12a7179c65488723fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:35.106301Z","signature_b64":"2l9hBgwIIY8q/hcjO3c6T9Yd5hfHEZAtjhtEQVChdy9r8hC23KzQyFlacg0nHR5l0xDdkBJRx5zmFv0Su0RfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"255d8696e9057ac6d7668b23217f68878cdd6920ac44d8d0f0bac262b78cac97","last_reissued_at":"2026-05-18T00:25:35.105691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:35.105691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Projection Methods for Decentralized Optimization with Functional Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael M. Zavlanos, Soomin Lee","submitted_at":"2015-09-26T16:41:58Z","abstract_excerpt":"We consider distributed convex optimization problems that involve a separable objective function and nontrivial functional constraints, such as Linear Matrix Inequalities (LMIs). We propose a decentralized and computationally inexpensive algorithm which is based on the concept of approximate projections. Our algorithm is one of the consensus based methods in that, at every iteration, each agent performs a consensus update of its decision variables followed by an optimization step of its local objective function and local constraints. Unlike other methods, the last step of our method is not an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08007","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":"1509.08007","created_at":"2026-05-18T00:25:35.105773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08007v3","created_at":"2026-05-18T00:25:35.105773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08007","created_at":"2026-05-18T00:25:35.105773+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVOYNFXJAV5M","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVOYNFXJAV5MNV3G","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVOYNFXJ","created_at":"2026-05-18T12:29:19.899920+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/EVOYNFXJAV5MNV3GRMRSC73IQ6","json":"https://pith.science/pith/EVOYNFXJAV5MNV3GRMRSC73IQ6.json","graph_json":"https://pith.science/api/pith-number/EVOYNFXJAV5MNV3GRMRSC73IQ6/graph.json","events_json":"https://pith.science/api/pith-number/EVOYNFXJAV5MNV3GRMRSC73IQ6/events.json","paper":"https://pith.science/paper/EVOYNFXJ"},"agent_actions":{"view_html":"https://pith.science/pith/EVOYNFXJAV5MNV3GRMRSC73IQ6","download_json":"https://pith.science/pith/EVOYNFXJAV5MNV3GRMRSC73IQ6.json","view_paper":"https://pith.science/paper/EVOYNFXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08007&json=true","fetch_graph":"https://pith.science/api/pith-number/EVOYNFXJAV5MNV3GRMRSC73IQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/EVOYNFXJAV5MNV3GRMRSC73IQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVOYNFXJAV5MNV3GRMRSC73IQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVOYNFXJAV5MNV3GRMRSC73IQ6/action/storage_attestation","attest_author":"https://pith.science/pith/EVOYNFXJAV5MNV3GRMRSC73IQ6/action/author_attestation","sign_citation":"https://pith.science/pith/EVOYNFXJAV5MNV3GRMRSC73IQ6/action/citation_signature","submit_replication":"https://pith.science/pith/EVOYNFXJAV5MNV3GRMRSC73IQ6/action/replication_record"}},"created_at":"2026-05-18T00:25:35.105773+00:00","updated_at":"2026-05-18T00:25:35.105773+00:00"}