{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QLGJ46O55EUV4JQA6TKNF44535","short_pith_number":"pith:QLGJ46O5","schema_version":"1.0","canonical_sha256":"82cc9e79dde9295e2600f4d4d2f39ddf4faffdfd5f1ec32f5f00bdb5b3542038","source":{"kind":"arxiv","id":"1801.00261","version":5},"attestation_state":"computed","paper":{"title":"First-Order Primal-Dual Method for Nonlinear Convex Cone Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daoli Zhu, Lei Zhao","submitted_at":"2017-12-31T10:04:00Z","abstract_excerpt":"Nonlinear Convex Cone Programming (NCCP) problems are important and have many practical applications. In this paper, we introduces a flexible first-order primal-dual algorithm called the Variant Auxiliary Problem Principle (VAPP) for solving NCCP problems when the objective function and constraints are smooth and may be nonsmooth. Each iteration of VAPP generates a nonlinear approximation to the primal problem of an augmented Lagrangian method. The approximation incorporates both linearization and a variable distance-like function, and then the iterations of VAPP provide one decomposition prop"},"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":"1801.00261","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-31T10:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"a9babce4487ad803e3df3ea187778cf70bea395bd1003c28b0195d8472c8e342","abstract_canon_sha256":"00264d4fe80b92eaf1b6f5be9fcb69e19b7066be060911900403d9d61865cbd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:30.098824Z","signature_b64":"KiIHHWi5Ob9unOwbvYBzJjrTplwW6zZimkXdziBIL9rYuoe4k6Qu6NfMlNPZP+AhTOSEeMLrguMyoqXGn3WdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82cc9e79dde9295e2600f4d4d2f39ddf4faffdfd5f1ec32f5f00bdb5b3542038","last_reissued_at":"2026-07-05T00:16:30.098396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:30.098396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Order Primal-Dual Method for Nonlinear Convex Cone Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daoli Zhu, Lei Zhao","submitted_at":"2017-12-31T10:04:00Z","abstract_excerpt":"Nonlinear Convex Cone Programming (NCCP) problems are important and have many practical applications. In this paper, we introduces a flexible first-order primal-dual algorithm called the Variant Auxiliary Problem Principle (VAPP) for solving NCCP problems when the objective function and constraints are smooth and may be nonsmooth. Each iteration of VAPP generates a nonlinear approximation to the primal problem of an augmented Lagrangian method. The approximation incorporates both linearization and a variable distance-like function, and then the iterations of VAPP provide one decomposition prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00261","kind":"arxiv","version":5},"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/1801.00261/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":"1801.00261","created_at":"2026-07-05T00:16:30.098454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00261v5","created_at":"2026-07-05T00:16:30.098454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00261","created_at":"2026-07-05T00:16:30.098454+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLGJ46O55EUV","created_at":"2026-07-05T00:16:30.098454+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLGJ46O55EUV4JQA","created_at":"2026-07-05T00:16:30.098454+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLGJ46O5","created_at":"2026-07-05T00:16:30.098454+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/QLGJ46O55EUV4JQA6TKNF44535","json":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535.json","graph_json":"https://pith.science/api/pith-number/QLGJ46O55EUV4JQA6TKNF44535/graph.json","events_json":"https://pith.science/api/pith-number/QLGJ46O55EUV4JQA6TKNF44535/events.json","paper":"https://pith.science/paper/QLGJ46O5"},"agent_actions":{"view_html":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535","download_json":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535.json","view_paper":"https://pith.science/paper/QLGJ46O5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00261&json=true","fetch_graph":"https://pith.science/api/pith-number/QLGJ46O55EUV4JQA6TKNF44535/graph.json","fetch_events":"https://pith.science/api/pith-number/QLGJ46O55EUV4JQA6TKNF44535/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/action/storage_attestation","attest_author":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/action/author_attestation","sign_citation":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/action/citation_signature","submit_replication":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/action/replication_record"}},"created_at":"2026-07-05T00:16:30.098454+00:00","updated_at":"2026-07-05T00:16:30.098454+00:00"}