{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FLTY542MXUSLMRM2RIJARWAXRD","short_pith_number":"pith:FLTY542M","schema_version":"1.0","canonical_sha256":"2ae78ef34cbd24b6459a8a1208d81788ce210525944e61ac63d10384af9f03f2","source":{"kind":"arxiv","id":"1609.06576","version":1},"attestation_state":"computed","paper":{"title":"Convergence of dual ascent in non-convex/non-differentiable optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carl Olsson, Fredrik Andersson, Marcus Carlsson","submitted_at":"2016-09-21T14:23:33Z","abstract_excerpt":"We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the convex envelope. We also introduce a new augmented version, which is shown to have superior convergence properties, and provide new results even for convex but non-differentiable objective functionals (as well as non-convex).\n  The results are applied to low rank approximation of a given matrix, subject to linear constraints. In particular, letting the linea"},"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":"1609.06576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-21T14:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"be9ca5ccdc351f8a28f2850521e18576b732166ea7f836f9d4f6db5729b90df5","abstract_canon_sha256":"48b741c636f5f213f5440e2e128910dc34f5fc7c42bef83e70ed466220284b34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:07.872754Z","signature_b64":"eH5uPGrinYN6QpNR+W2Muz1cvRkaDvy38oal3RmdSrF05TbtI6pVdWMY9tpApGMNfzXoz11M4LSr+Rov0IfXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ae78ef34cbd24b6459a8a1208d81788ce210525944e61ac63d10384af9f03f2","last_reissued_at":"2026-05-18T01:04:07.872068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:07.872068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of dual ascent in non-convex/non-differentiable optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carl Olsson, Fredrik Andersson, Marcus Carlsson","submitted_at":"2016-09-21T14:23:33Z","abstract_excerpt":"We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the convex envelope. We also introduce a new augmented version, which is shown to have superior convergence properties, and provide new results even for convex but non-differentiable objective functionals (as well as non-convex).\n  The results are applied to low rank approximation of a given matrix, subject to linear constraints. In particular, letting the linea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06576","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":""},"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":"1609.06576","created_at":"2026-05-18T01:04:07.872174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06576v1","created_at":"2026-05-18T01:04:07.872174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06576","created_at":"2026-05-18T01:04:07.872174+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLTY542MXUSL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLTY542MXUSLMRM2","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLTY542M","created_at":"2026-05-18T12:30:15.759754+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/FLTY542MXUSLMRM2RIJARWAXRD","json":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD.json","graph_json":"https://pith.science/api/pith-number/FLTY542MXUSLMRM2RIJARWAXRD/graph.json","events_json":"https://pith.science/api/pith-number/FLTY542MXUSLMRM2RIJARWAXRD/events.json","paper":"https://pith.science/paper/FLTY542M"},"agent_actions":{"view_html":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD","download_json":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD.json","view_paper":"https://pith.science/paper/FLTY542M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06576&json=true","fetch_graph":"https://pith.science/api/pith-number/FLTY542MXUSLMRM2RIJARWAXRD/graph.json","fetch_events":"https://pith.science/api/pith-number/FLTY542MXUSLMRM2RIJARWAXRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/action/storage_attestation","attest_author":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/action/author_attestation","sign_citation":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/action/citation_signature","submit_replication":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/action/replication_record"}},"created_at":"2026-05-18T01:04:07.872174+00:00","updated_at":"2026-05-18T01:04:07.872174+00:00"}