{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4RGQZZN7SXLMVDB4HPDLGYWE72","short_pith_number":"pith:4RGQZZN7","schema_version":"1.0","canonical_sha256":"e44d0ce5bf95d6ca8c3c3bc6b362c4fea63d6e12f6d7626fa53d0451106ed916","source":{"kind":"arxiv","id":"1601.08166","version":1},"attestation_state":"computed","paper":{"title":"Proximal-gradient algorithms for fractional programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ern\\\"o Robert Csetnek, Radu Ioan Bot","submitted_at":"2016-01-29T16:00:13Z","abstract_excerpt":"In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either concave or convex. In the iterative schemes, we perform a proximal step with respect to the nonsmooth numerator and a gradient step with respect to the smooth denominator. The algorithm in case of a concave denominator has the particularity that it generates sequences which approach both the (global) optimal solutions set and the optimal objective value of "},"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":"1601.08166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-29T16:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"7228c4fc3701a20d7330414226bb0faed650939ee477271c9104d86649ba93e8","abstract_canon_sha256":"e7d9846022e9c0fd631bb731e887049043b0e49da1f2ed4be505b5ef768cb3fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:40.199108Z","signature_b64":"wPpb6VMQ9XmmAR/WGnYsMon4x0CeVG5OybvYisP0Ei5lo7XnF9ajQ2R/AwDHprGgZfBbrp6WHNQEBh766fTyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e44d0ce5bf95d6ca8c3c3bc6b362c4fea63d6e12f6d7626fa53d0451106ed916","last_reissued_at":"2026-05-18T01:21:40.198623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:40.198623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal-gradient algorithms for fractional programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ern\\\"o Robert Csetnek, Radu Ioan Bot","submitted_at":"2016-01-29T16:00:13Z","abstract_excerpt":"In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either concave or convex. In the iterative schemes, we perform a proximal step with respect to the nonsmooth numerator and a gradient step with respect to the smooth denominator. The algorithm in case of a concave denominator has the particularity that it generates sequences which approach both the (global) optimal solutions set and the optimal objective value of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08166","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":"1601.08166","created_at":"2026-05-18T01:21:40.198698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.08166v1","created_at":"2026-05-18T01:21:40.198698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08166","created_at":"2026-05-18T01:21:40.198698+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RGQZZN7SXLM","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RGQZZN7SXLMVDB4","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RGQZZN7","created_at":"2026-05-18T12:29:58.707656+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/4RGQZZN7SXLMVDB4HPDLGYWE72","json":"https://pith.science/pith/4RGQZZN7SXLMVDB4HPDLGYWE72.json","graph_json":"https://pith.science/api/pith-number/4RGQZZN7SXLMVDB4HPDLGYWE72/graph.json","events_json":"https://pith.science/api/pith-number/4RGQZZN7SXLMVDB4HPDLGYWE72/events.json","paper":"https://pith.science/paper/4RGQZZN7"},"agent_actions":{"view_html":"https://pith.science/pith/4RGQZZN7SXLMVDB4HPDLGYWE72","download_json":"https://pith.science/pith/4RGQZZN7SXLMVDB4HPDLGYWE72.json","view_paper":"https://pith.science/paper/4RGQZZN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.08166&json=true","fetch_graph":"https://pith.science/api/pith-number/4RGQZZN7SXLMVDB4HPDLGYWE72/graph.json","fetch_events":"https://pith.science/api/pith-number/4RGQZZN7SXLMVDB4HPDLGYWE72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RGQZZN7SXLMVDB4HPDLGYWE72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RGQZZN7SXLMVDB4HPDLGYWE72/action/storage_attestation","attest_author":"https://pith.science/pith/4RGQZZN7SXLMVDB4HPDLGYWE72/action/author_attestation","sign_citation":"https://pith.science/pith/4RGQZZN7SXLMVDB4HPDLGYWE72/action/citation_signature","submit_replication":"https://pith.science/pith/4RGQZZN7SXLMVDB4HPDLGYWE72/action/replication_record"}},"created_at":"2026-05-18T01:21:40.198698+00:00","updated_at":"2026-05-18T01:21:40.198698+00:00"}