{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AYUXIGKF3SCB4PZIQZ5IHLQGYP","short_pith_number":"pith:AYUXIGKF","schema_version":"1.0","canonical_sha256":"0629741945dc841e3f28867a83ae06c3f2b95e98c6ac6741ccdfa6e3f9671401","source":{"kind":"arxiv","id":"2402.18423","version":1},"attestation_state":"computed","paper":{"title":"An interior-point trust-region method for nonsmooth regularized bound-constrained optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dominique Orban, Geoffroy Leconte","submitted_at":"2024-02-28T15:44:33Z","abstract_excerpt":"We develop an interior-point method for nonsmooth regularized bound-constrained optimization problems. Our method consists of iteratively solving a sequence of unconstrained nonsmooth barrier subproblems. We use a variant of the proximal quasi-Newton trust-region algorithm TR of arXiv:2103.15993v3 to solve the barrier subproblems, with additional assumptions inspired from well-known smooth interior-point trust-region methods. We show global convergence of our algorithm with respect to the criticality measure of arXiv:2103.15993v3. Under an additional assumption linked to the convexity of the n"},"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":"2402.18423","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-28T15:44:33Z","cross_cats_sorted":[],"title_canon_sha256":"784fc69c2ac1be599650a5bde4b4bff93420716102e0a1fa41ec42785230eae0","abstract_canon_sha256":"878122029f021e76383dfaac2fabcc7e9337760a4f1c4d00c69e5566664f3900"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:16.079761Z","signature_b64":"kxuplczOxzFonkDhP6LXnKiwUW1oWBWc1Vn/WBof7h6GYgRWvkgUk7DWoTj/DbBTaJRQZnyKS8KJvw2PUP6qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0629741945dc841e3f28867a83ae06c3f2b95e98c6ac6741ccdfa6e3f9671401","last_reissued_at":"2026-07-05T07:50:16.079204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:16.079204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An interior-point trust-region method for nonsmooth regularized bound-constrained optimization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dominique Orban, Geoffroy Leconte","submitted_at":"2024-02-28T15:44:33Z","abstract_excerpt":"We develop an interior-point method for nonsmooth regularized bound-constrained optimization problems. Our method consists of iteratively solving a sequence of unconstrained nonsmooth barrier subproblems. We use a variant of the proximal quasi-Newton trust-region algorithm TR of arXiv:2103.15993v3 to solve the barrier subproblems, with additional assumptions inspired from well-known smooth interior-point trust-region methods. We show global convergence of our algorithm with respect to the criticality measure of arXiv:2103.15993v3. Under an additional assumption linked to the convexity of the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18423","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.18423/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":"2402.18423","created_at":"2026-07-05T07:50:16.079261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.18423v1","created_at":"2026-07-05T07:50:16.079261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18423","created_at":"2026-07-05T07:50:16.079261+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYUXIGKF3SCB","created_at":"2026-07-05T07:50:16.079261+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYUXIGKF3SCB4PZI","created_at":"2026-07-05T07:50:16.079261+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYUXIGKF","created_at":"2026-07-05T07:50:16.079261+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.02079","citing_title":"A simple and practical adaptive trust-region method","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP","json":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP.json","graph_json":"https://pith.science/api/pith-number/AYUXIGKF3SCB4PZIQZ5IHLQGYP/graph.json","events_json":"https://pith.science/api/pith-number/AYUXIGKF3SCB4PZIQZ5IHLQGYP/events.json","paper":"https://pith.science/paper/AYUXIGKF"},"agent_actions":{"view_html":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP","download_json":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP.json","view_paper":"https://pith.science/paper/AYUXIGKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.18423&json=true","fetch_graph":"https://pith.science/api/pith-number/AYUXIGKF3SCB4PZIQZ5IHLQGYP/graph.json","fetch_events":"https://pith.science/api/pith-number/AYUXIGKF3SCB4PZIQZ5IHLQGYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/action/storage_attestation","attest_author":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/action/author_attestation","sign_citation":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/action/citation_signature","submit_replication":"https://pith.science/pith/AYUXIGKF3SCB4PZIQZ5IHLQGYP/action/replication_record"}},"created_at":"2026-07-05T07:50:16.079261+00:00","updated_at":"2026-07-05T07:50:16.079261+00:00"}