{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WT3MVXZ5G7LGG3GVQN44CKHVBM","short_pith_number":"pith:WT3MVXZ5","schema_version":"1.0","canonical_sha256":"b4f6cadf3d37d6636cd58379c128f50b08ef2cceb9ceabc5e27f38f530242bbf","source":{"kind":"arxiv","id":"1505.03175","version":1},"attestation_state":"computed","paper":{"title":"Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara, Quoc Tran-Dinh","submitted_at":"2015-05-12T21:49:18Z","abstract_excerpt":"In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in [15] and the newly introduced inexact oracle framework from [4]. We analyze several algorithmic instances with constant and adaptive smoothing parameters and derive total computational complexity results in terms of projections onto a simple primal set. For the basic inexact fast augmented Lagrangian algorithm we obtain the overall computational complexity of o"},"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":"1505.03175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-12T21:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"57699ba6834908b6228f06599d97d54bbf3623e3e6052a5fda29bd686e1f476b","abstract_canon_sha256":"49ce1c8a74f8449bb90e676061043a6c82a1a31daaacf503bf667882258accad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.276535Z","signature_b64":"GxShlSgT3xtQut6TufhmbfsiAUesuclaaV0ND+RaHRzee7iFrIXu33t1Gkgi3NURJMN17ADcND849277duHLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f6cadf3d37d6636cd58379c128f50b08ef2cceb9ceabc5e27f38f530242bbf","last_reissued_at":"2026-05-18T02:12:10.275698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.275698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrei Patrascu, Ion Necoara, Quoc Tran-Dinh","submitted_at":"2015-05-12T21:49:18Z","abstract_excerpt":"In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in [15] and the newly introduced inexact oracle framework from [4]. We analyze several algorithmic instances with constant and adaptive smoothing parameters and derive total computational complexity results in terms of projections onto a simple primal set. For the basic inexact fast augmented Lagrangian algorithm we obtain the overall computational complexity of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03175","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":"1505.03175","created_at":"2026-05-18T02:12:10.275834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03175v1","created_at":"2026-05-18T02:12:10.275834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03175","created_at":"2026-05-18T02:12:10.275834+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT3MVXZ5G7LG","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT3MVXZ5G7LGG3GV","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT3MVXZ5","created_at":"2026-05-18T12:29:47.479230+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/WT3MVXZ5G7LGG3GVQN44CKHVBM","json":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM.json","graph_json":"https://pith.science/api/pith-number/WT3MVXZ5G7LGG3GVQN44CKHVBM/graph.json","events_json":"https://pith.science/api/pith-number/WT3MVXZ5G7LGG3GVQN44CKHVBM/events.json","paper":"https://pith.science/paper/WT3MVXZ5"},"agent_actions":{"view_html":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM","download_json":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM.json","view_paper":"https://pith.science/paper/WT3MVXZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03175&json=true","fetch_graph":"https://pith.science/api/pith-number/WT3MVXZ5G7LGG3GVQN44CKHVBM/graph.json","fetch_events":"https://pith.science/api/pith-number/WT3MVXZ5G7LGG3GVQN44CKHVBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/action/storage_attestation","attest_author":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/action/author_attestation","sign_citation":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/action/citation_signature","submit_replication":"https://pith.science/pith/WT3MVXZ5G7LGG3GVQN44CKHVBM/action/replication_record"}},"created_at":"2026-05-18T02:12:10.275834+00:00","updated_at":"2026-05-18T02:12:10.275834+00:00"}