{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AZC5MAAK26BWVG3P55AZE5LRXQ","short_pith_number":"pith:AZC5MAAK","canonical_record":{"source":{"id":"1210.3039","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-10T20:01:29Z","cross_cats_sorted":["cs.NA","math.NA","stat.CO","stat.ML"],"title_canon_sha256":"6e4078b25a87cdf333575dd569aa96db534c8a236641cae869a6267c1275087e","abstract_canon_sha256":"db22f62fb15e91692a3aac1208785bd562605a6e4efdb1a34d9e9fa451ac5527"},"schema_version":"1.0"},"canonical_sha256":"0645d6000ad7836a9b6fef41927571bc184006b4cb06e3c926162893b4106e0c","source":{"kind":"arxiv","id":"1210.3039","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3039","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3039v3","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3039","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"AZC5MAAK26BW","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"pith_short_16","alias_value":"AZC5MAAK26BWVG3P","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"pith_short_8","alias_value":"AZC5MAAK","created_at":"2026-06-03T23:07:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AZC5MAAK26BWVG3P55AZE5LRXQ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3039","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-10T20:01:29Z","cross_cats_sorted":["cs.NA","math.NA","stat.CO","stat.ML"],"title_canon_sha256":"6e4078b25a87cdf333575dd569aa96db534c8a236641cae869a6267c1275087e","abstract_canon_sha256":"db22f62fb15e91692a3aac1208785bd562605a6e4efdb1a34d9e9fa451ac5527"},"schema_version":"1.0"},"canonical_sha256":"0645d6000ad7836a9b6fef41927571bc184006b4cb06e3c926162893b4106e0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:07:28.488622Z","signature_b64":"yzdAcgp8hVBxb33zHf6M6ZBqS+V9sUdZo4u0d6Md5wPcg89o5xzncOpWU1xz12Uqd81LdOt44F4hNQ+J+kleDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0645d6000ad7836a9b6fef41927571bc184006b4cb06e3c926162893b4106e0c","last_reissued_at":"2026-06-03T23:07:28.488115Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:07:28.488115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3039","source_version":3,"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-06-03T23:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExV4Ry2ppvN3ugKz3HLPOfURm+eZqJEWljd5fhMe0NNDdPYtL6l1NmuP2AJqxdvhku4rNiCBRiizMQuRK2vKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:57:14.764398Z"},"content_sha256":"2515a7f366e07949bc91456b8f15b0532a777a33a4591cbedf932ff7bae747f3","schema_version":"1.0","event_id":"sha256:2515a7f366e07949bc91456b8f15b0532a777a33a4591cbedf932ff7bae747f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AZC5MAAK26BWVG3P55AZE5LRXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Zhaosong Lu","submitted_at":"2012-10-10T20:01:29Z","abstract_excerpt":"In this paper we study a broad class of structured nonlinear programming (SNLP) problems. In particular, we first establish the first-order optimality conditions for them. Then we propose sequential convex programming (SCP) methods for solving them in which each iteration is obtained by solving a convex programming problem. Under some suitable assumptions, we establish that any accumulation point of the sequence generated by the methods is a KKT point of the SNLP problems. In addition, we propose a variant of the SCP method for SNLP in which nonmonotone scheme and ``local'' Lipschitz constants"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3039","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1210.3039/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-06-03T23:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rl4AiFkHZ+u2EDZvcUhbmvOLTg0JnaSFkTRQye+8CJ8VS6R/2lBkh/Afqoi4QgJHcSNZthQ2b44bCFCY61rhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:57:14.764907Z"},"content_sha256":"7cd4f3a948614667ec31d21020508e8c4661c860e9f8fba671a2336ac70103b0","schema_version":"1.0","event_id":"sha256:7cd4f3a948614667ec31d21020508e8c4661c860e9f8fba671a2336ac70103b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/bundle.json","state_url":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/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-08T13:57:14Z","links":{"resolver":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ","bundle":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/bundle.json","state":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AZC5MAAK26BWVG3P55AZE5LRXQ","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":"db22f62fb15e91692a3aac1208785bd562605a6e4efdb1a34d9e9fa451ac5527","cross_cats_sorted":["cs.NA","math.NA","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-10T20:01:29Z","title_canon_sha256":"6e4078b25a87cdf333575dd569aa96db534c8a236641cae869a6267c1275087e"},"schema_version":"1.0","source":{"id":"1210.3039","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3039","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3039v3","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3039","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"AZC5MAAK26BW","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"pith_short_16","alias_value":"AZC5MAAK26BWVG3P","created_at":"2026-06-03T23:07:28Z"},{"alias_kind":"pith_short_8","alias_value":"AZC5MAAK","created_at":"2026-06-03T23:07:28Z"}],"graph_snapshots":[{"event_id":"sha256:7cd4f3a948614667ec31d21020508e8c4661c860e9f8fba671a2336ac70103b0","target":"graph","created_at":"2026-06-03T23:07:28Z","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/1210.3039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study a broad class of structured nonlinear programming (SNLP) problems. In particular, we first establish the first-order optimality conditions for them. Then we propose sequential convex programming (SCP) methods for solving them in which each iteration is obtained by solving a convex programming problem. Under some suitable assumptions, we establish that any accumulation point of the sequence generated by the methods is a KKT point of the SNLP problems. In addition, we propose a variant of the SCP method for SNLP in which nonmonotone scheme and ``local'' Lipschitz constants","authors_text":"Zhaosong Lu","cross_cats":["cs.NA","math.NA","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-10T20:01:29Z","title":"Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3039","kind":"arxiv","version":3},"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:2515a7f366e07949bc91456b8f15b0532a777a33a4591cbedf932ff7bae747f3","target":"record","created_at":"2026-06-03T23:07:28Z","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":"db22f62fb15e91692a3aac1208785bd562605a6e4efdb1a34d9e9fa451ac5527","cross_cats_sorted":["cs.NA","math.NA","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-10T20:01:29Z","title_canon_sha256":"6e4078b25a87cdf333575dd569aa96db534c8a236641cae869a6267c1275087e"},"schema_version":"1.0","source":{"id":"1210.3039","kind":"arxiv","version":3}},"canonical_sha256":"0645d6000ad7836a9b6fef41927571bc184006b4cb06e3c926162893b4106e0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0645d6000ad7836a9b6fef41927571bc184006b4cb06e3c926162893b4106e0c","first_computed_at":"2026-06-03T23:07:28.488115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T23:07:28.488115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yzdAcgp8hVBxb33zHf6M6ZBqS+V9sUdZo4u0d6Md5wPcg89o5xzncOpWU1xz12Uqd81LdOt44F4hNQ+J+kleDA==","signature_status":"signed_v1","signed_at":"2026-06-03T23:07:28.488622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3039","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2515a7f366e07949bc91456b8f15b0532a777a33a4591cbedf932ff7bae747f3","sha256:7cd4f3a948614667ec31d21020508e8c4661c860e9f8fba671a2336ac70103b0"],"state_sha256":"2dfaa605518a5f9708419db64d484ce5747936e303c6c3a57d2ad2e9faed05fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fR7a2ePM83GYKDVan5fQkMS9tdK5US8hjwWFRQiMYHwJ9KQ15axaHh128uMU+iNSnUrA9tGV30zrtJdcY4GCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:57:14.769748Z","bundle_sha256":"8ab7022ba207cc89810f50c64b524a549bf0b48b541462d49a4f99bd9a2d9245"}}