{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BVFWAOOPEU3SGBYR22SFG3BCO3","short_pith_number":"pith:BVFWAOOP","schema_version":"1.0","canonical_sha256":"0d4b6039cf2537230711d6a4536c2276f2cde8deac55af800428ec1e0b277c90","source":{"kind":"arxiv","id":"1711.05812","version":2},"attestation_state":"computed","paper":{"title":"Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA"],"primary_cat":"math.OC","authors_text":"Yangyang Xu","submitted_at":"2017-11-15T21:20:54Z","abstract_excerpt":"Augmented Lagrangian method (ALM) has been popularly used for solving constrained optimization problems. Practically, subproblems for updating primal variables in the framework of ALM usually can only be solved inexactly. The convergence and local convergence speed of ALM have been extensively studied. However, the global convergence rate of inexact ALM is still open for problems with nonlinear inequality constraints. In this paper, we work on general convex programs with both equality and inequality constraints. For these problems, we establish the global convergence rate of inexact ALM and e"},"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":"1711.05812","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-15T21:20:54Z","cross_cats_sorted":["cs.DS","math.NA"],"title_canon_sha256":"7945a1d6585e8efaddc9d54c195e7de604f91f9b3615f91fa6fe46201ced39c7","abstract_canon_sha256":"de80d14aee4d3bbc96c9ae6a220f3423457b578b3ea8495e0f747ae7484b8837"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:16.506408Z","signature_b64":"6CLk1JNwGtWb2DeH/uhtMEQJozuWjGKFyDELv0R2HyUaWFfMf27ziraX5NYhK2QIX+Nq2ZHry+LvS3/9rdFxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d4b6039cf2537230711d6a4536c2276f2cde8deac55af800428ec1e0b277c90","last_reissued_at":"2026-05-18T00:20:16.505871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:16.505871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA"],"primary_cat":"math.OC","authors_text":"Yangyang Xu","submitted_at":"2017-11-15T21:20:54Z","abstract_excerpt":"Augmented Lagrangian method (ALM) has been popularly used for solving constrained optimization problems. Practically, subproblems for updating primal variables in the framework of ALM usually can only be solved inexactly. The convergence and local convergence speed of ALM have been extensively studied. However, the global convergence rate of inexact ALM is still open for problems with nonlinear inequality constraints. In this paper, we work on general convex programs with both equality and inequality constraints. For these problems, we establish the global convergence rate of inexact ALM and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05812","kind":"arxiv","version":2},"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":"1711.05812","created_at":"2026-05-18T00:20:16.505952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05812v2","created_at":"2026-05-18T00:20:16.505952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05812","created_at":"2026-05-18T00:20:16.505952+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVFWAOOPEU3S","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVFWAOOPEU3SGBYR","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVFWAOOP","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01871","citing_title":"Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3","json":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3.json","graph_json":"https://pith.science/api/pith-number/BVFWAOOPEU3SGBYR22SFG3BCO3/graph.json","events_json":"https://pith.science/api/pith-number/BVFWAOOPEU3SGBYR22SFG3BCO3/events.json","paper":"https://pith.science/paper/BVFWAOOP"},"agent_actions":{"view_html":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3","download_json":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3.json","view_paper":"https://pith.science/paper/BVFWAOOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05812&json=true","fetch_graph":"https://pith.science/api/pith-number/BVFWAOOPEU3SGBYR22SFG3BCO3/graph.json","fetch_events":"https://pith.science/api/pith-number/BVFWAOOPEU3SGBYR22SFG3BCO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3/action/storage_attestation","attest_author":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3/action/author_attestation","sign_citation":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3/action/citation_signature","submit_replication":"https://pith.science/pith/BVFWAOOPEU3SGBYR22SFG3BCO3/action/replication_record"}},"created_at":"2026-05-18T00:20:16.505952+00:00","updated_at":"2026-05-18T00:20:16.505952+00:00"}