{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DGRZR2GDJDDP4HKFSPFWWKQIEK","short_pith_number":"pith:DGRZR2GD","schema_version":"1.0","canonical_sha256":"19a398e8c348c6fe1d4593cb6b2a08229a2b3be4381ca7e78bed38b2f606dfc7","source":{"kind":"arxiv","id":"1506.00385","version":1},"attestation_state":"computed","paper":{"title":"Variable metric inexact line-search based methods for nonsmooth optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Federica Porta, Ignace Loris, Marco Prato, Silvia Bonettini","submitted_at":"2015-06-01T08:36:36Z","abstract_excerpt":"We develop a new proximal-gradient method for minimizing the sum of a differentiable, possibly nonconvex, function plus a convex, possibly non differentiable, function. The key features of the proposed method are the definition of a suitable descent direction, based on the proximal operator associated to the convex part of the objective function, and an Armijo-like rule to determine the step size along this direction ensuring the sufficient decrease of the objective function. In this frame, we especially address the possibility of adopting a metric which may change at each iteration and an ine"},"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":"1506.00385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-01T08:36:36Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ae76ed8af0e44eccb57d52e8a5f4b2553319c12841eb69658d7dc53847e86bff","abstract_canon_sha256":"e89a7b8d0a9f69a944d5a442f821e84c9ed3444549a3aa2fe236509e705ec959"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:00.376584Z","signature_b64":"pWrM4avSk0ATX3LYO+eEF1GxmUYUl69l3g8Byl45+yupdp+rAcZcFqgjbCM/wv/NWz/ZwzBGj7Ptm+l0Lo2zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a398e8c348c6fe1d4593cb6b2a08229a2b3be4381ca7e78bed38b2f606dfc7","last_reissued_at":"2026-05-18T01:15:00.376030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:00.376030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variable metric inexact line-search based methods for nonsmooth optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Federica Porta, Ignace Loris, Marco Prato, Silvia Bonettini","submitted_at":"2015-06-01T08:36:36Z","abstract_excerpt":"We develop a new proximal-gradient method for minimizing the sum of a differentiable, possibly nonconvex, function plus a convex, possibly non differentiable, function. The key features of the proposed method are the definition of a suitable descent direction, based on the proximal operator associated to the convex part of the objective function, and an Armijo-like rule to determine the step size along this direction ensuring the sufficient decrease of the objective function. In this frame, we especially address the possibility of adopting a metric which may change at each iteration and an ine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00385","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":"1506.00385","created_at":"2026-05-18T01:15:00.376126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00385v1","created_at":"2026-05-18T01:15:00.376126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00385","created_at":"2026-05-18T01:15:00.376126+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGRZR2GDJDDP","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGRZR2GDJDDP4HKF","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGRZR2GD","created_at":"2026-05-18T12:29:17.054201+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/DGRZR2GDJDDP4HKFSPFWWKQIEK","json":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK.json","graph_json":"https://pith.science/api/pith-number/DGRZR2GDJDDP4HKFSPFWWKQIEK/graph.json","events_json":"https://pith.science/api/pith-number/DGRZR2GDJDDP4HKFSPFWWKQIEK/events.json","paper":"https://pith.science/paper/DGRZR2GD"},"agent_actions":{"view_html":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK","download_json":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK.json","view_paper":"https://pith.science/paper/DGRZR2GD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00385&json=true","fetch_graph":"https://pith.science/api/pith-number/DGRZR2GDJDDP4HKFSPFWWKQIEK/graph.json","fetch_events":"https://pith.science/api/pith-number/DGRZR2GDJDDP4HKFSPFWWKQIEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/action/storage_attestation","attest_author":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/action/author_attestation","sign_citation":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/action/citation_signature","submit_replication":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/action/replication_record"}},"created_at":"2026-05-18T01:15:00.376126+00:00","updated_at":"2026-05-18T01:15:00.376126+00:00"}