{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:H3TWSYWSMRXZBSMCTJV7K72UBY","short_pith_number":"pith:H3TWSYWS","canonical_record":{"source":{"id":"2011.08569","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-11-17T11:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"b0e217f0bb978e61ef1b08a36d005d3477600db465309b619a9a21a88c07d539","abstract_canon_sha256":"bb359b75911f2810d9b644614a58803874f8721b7304027f65e8d7d98e68f374"},"schema_version":"1.0"},"canonical_sha256":"3ee76962d2646f90c9829a6bf57f540e0af0c0ed425ad2be59a5667ccaa43c6e","source":{"kind":"arxiv","id":"2011.08569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.08569","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"2011.08569v1","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.08569","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"H3TWSYWSMRXZ","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"pith_short_16","alias_value":"H3TWSYWSMRXZBSMC","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"pith_short_8","alias_value":"H3TWSYWS","created_at":"2026-07-05T01:52:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:H3TWSYWSMRXZBSMCTJV7K72UBY","target":"record","payload":{"canonical_record":{"source":{"id":"2011.08569","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-11-17T11:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"b0e217f0bb978e61ef1b08a36d005d3477600db465309b619a9a21a88c07d539","abstract_canon_sha256":"bb359b75911f2810d9b644614a58803874f8721b7304027f65e8d7d98e68f374"},"schema_version":"1.0"},"canonical_sha256":"3ee76962d2646f90c9829a6bf57f540e0af0c0ed425ad2be59a5667ccaa43c6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:06.591549Z","signature_b64":"L//WbVtlZYqgmqF6EM9aK+aEE+Ki1bUvni7ZFyJODiNaxvDEbKRpGF7MverFp3TsUKrPLYS8UD7oaDENn7uMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ee76962d2646f90c9829a6bf57f540e0af0c0ed425ad2be59a5667ccaa43c6e","last_reissued_at":"2026-07-05T01:52:06.591206Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:06.591206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.08569","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:52:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M9ogdKM3i3LslliMzqdYc/UMA16mwVmBx9s17tO9wiV+GhhY9lsSOLGZI/5e5/3l0Nvo1YxRnZ0cZIXkvByXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:25:25.859559Z"},"content_sha256":"b063e0efe2f9ba073fa8e1f479462b7af8043fce52008d9b1a3261a178f4d5b9","schema_version":"1.0","event_id":"sha256:b063e0efe2f9ba073fa8e1f479462b7af8043fce52008d9b1a3261a178f4d5b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:H3TWSYWSMRXZBSMCTJV7K72UBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Aug-PDG: Linear Convergence of Convex Optimization with Inequality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Min Meng, Xiuxian Li","submitted_at":"2020-11-17T11:26:59Z","abstract_excerpt":"This paper investigates the convex optimization problem with general convex inequality constraints. To cope with this problem, a discrete-time algorithm, called augmented primal-dual gradient algorithm (Aug-PDG), is studied and analyzed. It is shown that Aug-PDG can converge semi-globally to the optimizer at a linear rate under some mild assumptions, such as the quadratic gradient growth condition for the objective function, which is strictly weaker than strong convexity. To our best knowledge, this paper is the first to establish a linear convergence for the studied problem in the discrete-ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.08569","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.08569/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:52:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIwt1laYH8HD67TGYds4fHO0CvvmmFgNjQAkjhZcAGcDcI6YreByDmD5HRJ8fVVws7AA+vzP1ZVluIHn4ppZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:25:25.860055Z"},"content_sha256":"e471feb9f03564faeeae1812943600af48db116c84afde4180e86566fe659527","schema_version":"1.0","event_id":"sha256:e471feb9f03564faeeae1812943600af48db116c84afde4180e86566fe659527"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3TWSYWSMRXZBSMCTJV7K72UBY/bundle.json","state_url":"https://pith.science/pith/H3TWSYWSMRXZBSMCTJV7K72UBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3TWSYWSMRXZBSMCTJV7K72UBY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-22T13:25:25Z","links":{"resolver":"https://pith.science/pith/H3TWSYWSMRXZBSMCTJV7K72UBY","bundle":"https://pith.science/pith/H3TWSYWSMRXZBSMCTJV7K72UBY/bundle.json","state":"https://pith.science/pith/H3TWSYWSMRXZBSMCTJV7K72UBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3TWSYWSMRXZBSMCTJV7K72UBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:H3TWSYWSMRXZBSMCTJV7K72UBY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bb359b75911f2810d9b644614a58803874f8721b7304027f65e8d7d98e68f374","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-11-17T11:26:59Z","title_canon_sha256":"b0e217f0bb978e61ef1b08a36d005d3477600db465309b619a9a21a88c07d539"},"schema_version":"1.0","source":{"id":"2011.08569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.08569","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"2011.08569v1","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.08569","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"H3TWSYWSMRXZ","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"pith_short_16","alias_value":"H3TWSYWSMRXZBSMC","created_at":"2026-07-05T01:52:06Z"},{"alias_kind":"pith_short_8","alias_value":"H3TWSYWS","created_at":"2026-07-05T01:52:06Z"}],"graph_snapshots":[{"event_id":"sha256:e471feb9f03564faeeae1812943600af48db116c84afde4180e86566fe659527","target":"graph","created_at":"2026-07-05T01:52:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.08569/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates the convex optimization problem with general convex inequality constraints. To cope with this problem, a discrete-time algorithm, called augmented primal-dual gradient algorithm (Aug-PDG), is studied and analyzed. It is shown that Aug-PDG can converge semi-globally to the optimizer at a linear rate under some mild assumptions, such as the quadratic gradient growth condition for the objective function, which is strictly weaker than strong convexity. To our best knowledge, this paper is the first to establish a linear convergence for the studied problem in the discrete-ti","authors_text":"Min Meng, Xiuxian Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-11-17T11:26:59Z","title":"Aug-PDG: Linear Convergence of Convex Optimization with Inequality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.08569","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b063e0efe2f9ba073fa8e1f479462b7af8043fce52008d9b1a3261a178f4d5b9","target":"record","created_at":"2026-07-05T01:52:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bb359b75911f2810d9b644614a58803874f8721b7304027f65e8d7d98e68f374","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-11-17T11:26:59Z","title_canon_sha256":"b0e217f0bb978e61ef1b08a36d005d3477600db465309b619a9a21a88c07d539"},"schema_version":"1.0","source":{"id":"2011.08569","kind":"arxiv","version":1}},"canonical_sha256":"3ee76962d2646f90c9829a6bf57f540e0af0c0ed425ad2be59a5667ccaa43c6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ee76962d2646f90c9829a6bf57f540e0af0c0ed425ad2be59a5667ccaa43c6e","first_computed_at":"2026-07-05T01:52:06.591206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:06.591206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L//WbVtlZYqgmqF6EM9aK+aEE+Ki1bUvni7ZFyJODiNaxvDEbKRpGF7MverFp3TsUKrPLYS8UD7oaDENn7uMAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:06.591549Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.08569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b063e0efe2f9ba073fa8e1f479462b7af8043fce52008d9b1a3261a178f4d5b9","sha256:e471feb9f03564faeeae1812943600af48db116c84afde4180e86566fe659527"],"state_sha256":"2df2d929fc07cd1b67275df794f9b14ab519924295d4e80b70ea9b2320d3e439"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nEsNqTO9QTT/Cv6BtEKFuHdthHI9jYE0bBKyS9a628+eYiQgeg+wPmgHdxxIFl/53bp31U3yE6uWL3ykeERAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:25:25.863961Z","bundle_sha256":"4c9d379a46d501233ced5b70f0cde055a54eedaf46f075e92d9187f4da6498b8"}}