{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AZC5MAAK26BWVG3P55AZE5LRXQ","short_pith_number":"pith:AZC5MAAK","schema_version":"1.0","canonical_sha256":"0645d6000ad7836a9b6fef41927571bc184006b4cb06e3c926162893b4106e0c","source":{"kind":"arxiv","id":"1210.3039","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.3039","created_at":"2026-06-03T23:07:28.488173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.3039v3","created_at":"2026-06-03T23:07:28.488173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3039","created_at":"2026-06-03T23:07:28.488173+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZC5MAAK26BW","created_at":"2026-06-03T23:07:28.488173+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZC5MAAK26BWVG3P","created_at":"2026-06-03T23:07:28.488173+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZC5MAAK","created_at":"2026-06-03T23:07:28.488173+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/AZC5MAAK26BWVG3P55AZE5LRXQ","json":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ.json","graph_json":"https://pith.science/api/pith-number/AZC5MAAK26BWVG3P55AZE5LRXQ/graph.json","events_json":"https://pith.science/api/pith-number/AZC5MAAK26BWVG3P55AZE5LRXQ/events.json","paper":"https://pith.science/paper/AZC5MAAK"},"agent_actions":{"view_html":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ","download_json":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ.json","view_paper":"https://pith.science/paper/AZC5MAAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.3039&json=true","fetch_graph":"https://pith.science/api/pith-number/AZC5MAAK26BWVG3P55AZE5LRXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AZC5MAAK26BWVG3P55AZE5LRXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/action/storage_attestation","attest_author":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/action/author_attestation","sign_citation":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/action/citation_signature","submit_replication":"https://pith.science/pith/AZC5MAAK26BWVG3P55AZE5LRXQ/action/replication_record"}},"created_at":"2026-06-03T23:07:28.488173+00:00","updated_at":"2026-06-03T23:07:28.488173+00:00"}