{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DMYVEG4JZLCPNLURS5UETVCUL4","short_pith_number":"pith:DMYVEG4J","schema_version":"1.0","canonical_sha256":"1b31521b89cac4f6ae91976849d4545f00eae4334040be97a8ab21fe327e6ee0","source":{"kind":"arxiv","id":"1604.05694","version":3},"attestation_state":"computed","paper":{"title":"Proximal Distance Algorithms: Theory and Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hua Zhou, Kenneth Lange, Kevin L. Keys","submitted_at":"2016-04-19T19:05:28Z","abstract_excerpt":"Proximal distance algorithms combine the classical penalty method of constrained minimization with distance majorization. If $f(\\boldsymbol{x})$ is the loss function, and $C$ is the constraint set in a constrained minimization problem, then the proximal distance principle mandates minimizing the penalized loss $f(\\boldsymbol{x})+\\frac{\\rho}{2}\\mathop{dist}(x,C)^2$ and following the solution $\\boldsymbol{x}_{\\rho}$ to its limit as $\\rho$ tends to $\\infty$. At each iteration the squared Euclidean distance $\\mathop{dist}(\\boldsymbol{x},C)^2$ is majorized by the spherical quadratic $\\| \\boldsymbol"},"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":"1604.05694","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-19T19:05:28Z","cross_cats_sorted":[],"title_canon_sha256":"311ccb37c791efb10223813b82902df0c720d9ed33fdd47c728fcda176a8c507","abstract_canon_sha256":"93e1a4af9e5000e3dcd97887b463aef33c8d45586124f4ebde3422d075cfc424"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:53.701158Z","signature_b64":"JiQKPrETECpePxE4dBYZj/Dcl4ihd1jShgYJ48BgGz1ZM8RhSTNEvE9V8B4zGNau74lcQ9Qbe4O/2/4dIaW6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b31521b89cac4f6ae91976849d4545f00eae4334040be97a8ab21fe327e6ee0","last_reissued_at":"2026-05-17T23:45:53.700752Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:53.700752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal Distance Algorithms: Theory and Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hua Zhou, Kenneth Lange, Kevin L. Keys","submitted_at":"2016-04-19T19:05:28Z","abstract_excerpt":"Proximal distance algorithms combine the classical penalty method of constrained minimization with distance majorization. If $f(\\boldsymbol{x})$ is the loss function, and $C$ is the constraint set in a constrained minimization problem, then the proximal distance principle mandates minimizing the penalized loss $f(\\boldsymbol{x})+\\frac{\\rho}{2}\\mathop{dist}(x,C)^2$ and following the solution $\\boldsymbol{x}_{\\rho}$ to its limit as $\\rho$ tends to $\\infty$. At each iteration the squared Euclidean distance $\\mathop{dist}(\\boldsymbol{x},C)^2$ is majorized by the spherical quadratic $\\| \\boldsymbol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05694","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":""},"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":"1604.05694","created_at":"2026-05-17T23:45:53.700820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05694v3","created_at":"2026-05-17T23:45:53.700820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05694","created_at":"2026-05-17T23:45:53.700820+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMYVEG4JZLCP","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMYVEG4JZLCPNLUR","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMYVEG4J","created_at":"2026-05-18T12:30:12.583610+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/DMYVEG4JZLCPNLURS5UETVCUL4","json":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4.json","graph_json":"https://pith.science/api/pith-number/DMYVEG4JZLCPNLURS5UETVCUL4/graph.json","events_json":"https://pith.science/api/pith-number/DMYVEG4JZLCPNLURS5UETVCUL4/events.json","paper":"https://pith.science/paper/DMYVEG4J"},"agent_actions":{"view_html":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4","download_json":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4.json","view_paper":"https://pith.science/paper/DMYVEG4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05694&json=true","fetch_graph":"https://pith.science/api/pith-number/DMYVEG4JZLCPNLURS5UETVCUL4/graph.json","fetch_events":"https://pith.science/api/pith-number/DMYVEG4JZLCPNLURS5UETVCUL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/action/storage_attestation","attest_author":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/action/author_attestation","sign_citation":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/action/citation_signature","submit_replication":"https://pith.science/pith/DMYVEG4JZLCPNLURS5UETVCUL4/action/replication_record"}},"created_at":"2026-05-17T23:45:53.700820+00:00","updated_at":"2026-05-17T23:45:53.700820+00:00"}