{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:M2UIDSBJCSIQJV7JBI4VZHO57T","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":"16ad445f6e6f288ce79678e69772704e805a266749dd628a25a56b06e9a43aab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-20T07:11:44Z","title_canon_sha256":"c892f94833b1b98e0b74383c0dfe9d6673e5b10094da6dc48a1e41d0f3db172d"},"schema_version":"1.0","source":{"id":"2001.06998","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.06998","created_at":"2026-07-05T02:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2001.06998v2","created_at":"2026-07-05T02:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.06998","created_at":"2026-07-05T02:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"M2UIDSBJCSIQ","created_at":"2026-07-05T02:39:00Z"},{"alias_kind":"pith_short_16","alias_value":"M2UIDSBJCSIQJV7J","created_at":"2026-07-05T02:39:00Z"},{"alias_kind":"pith_short_8","alias_value":"M2UIDSBJ","created_at":"2026-07-05T02:39:00Z"}],"graph_snapshots":[{"event_id":"sha256:a7035f67170ac2ac213fe02651090867a759ef530c69f19969345d9a469e8f0a","target":"graph","created_at":"2026-07-05T02:39:00Z","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/2001.06998/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the sequential convex programming method with monotone line search (SCP$_{ls}$) in [46] for a class of difference-of-convex (DC) optimization problems with multiple smooth inequality constraints. The SCP$_{ls}$ is a representative variant of moving-ball-approximation-type algorithms [6,10,13,54] for constrained optimization problems. We analyze the convergence rate of the sequence generated by SCP$_{ls}$ in both nonconvex and convex settings by imposing suitable Kurdyka-Lojasiewicz (KL) assumptions. Specifically, in the nonconvex settings, we assume that a special poten","authors_text":"Peiran Yu, Ting Kei Pong, Zhaosong Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-20T07:11:44Z","title":"Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.06998","kind":"arxiv","version":2},"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:12e50dff277d799585a908c6c597daf691f8ff67b2287e54e4b9a85e75f49158","target":"record","created_at":"2026-07-05T02:39:00Z","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":"16ad445f6e6f288ce79678e69772704e805a266749dd628a25a56b06e9a43aab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-01-20T07:11:44Z","title_canon_sha256":"c892f94833b1b98e0b74383c0dfe9d6673e5b10094da6dc48a1e41d0f3db172d"},"schema_version":"1.0","source":{"id":"2001.06998","kind":"arxiv","version":2}},"canonical_sha256":"66a881c829149104d7e90a395c9dddfcc90474efa3a7880ddeee826f5f288b39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66a881c829149104d7e90a395c9dddfcc90474efa3a7880ddeee826f5f288b39","first_computed_at":"2026-07-05T02:39:00.323935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:39:00.323935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VH/rtkx/VQ0sNib3aQzxwsYbfUgDbsoP5Bq6YlBAfcsGRHV3NlnpP/NOdFYwtlCldqp8CJdTCbmRknUaoRzLCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:39:00.324335Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.06998","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12e50dff277d799585a908c6c597daf691f8ff67b2287e54e4b9a85e75f49158","sha256:a7035f67170ac2ac213fe02651090867a759ef530c69f19969345d9a469e8f0a"],"state_sha256":"bbf3483b4a01482d97913f84b787b705df63f1d58277193fadfe02ca1153c5df"}