{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4TATFTTNW2WV2S6TP5OW5BBX2H","short_pith_number":"pith:4TATFTTN","schema_version":"1.0","canonical_sha256":"e4c132ce6db6ad5d4bd37f5d6e8437d1d6f7b11da99c99f53a06744357c1b8cd","source":{"kind":"arxiv","id":"1702.08627","version":3},"attestation_state":"computed","paper":{"title":"An Optimization Framework with Flexible Inexact Inner Iterations for Nonconvex and Nonsmooth Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Risheng Liu, Xiaoliang Song, Yiyang Wang, Zhixun Su","submitted_at":"2017-02-28T03:22:55Z","abstract_excerpt":"In recent years, numerous vision and learning tasks have been (re)formulated as nonconvex and nonsmooth programmings(NNPs). Although some algorithms have been proposed for particular problems, designing fast and flexible optimization schemes with theoretical guarantee is a challenging task for general NNPs. It has been investigated that performing inexact inner iterations often benefit to special applications case by case, but their convergence behaviors are still unclear. Motivated by these practical experiences, this paper designs a novel algorithmic framework, named inexact proximal alterna"},"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":"1702.08627","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-28T03:22:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"427bfeedd52f1192fec61a83ad590911e9aa29bac4bfa7ad25af5d881582d9a1","abstract_canon_sha256":"ea43efbcaf5cbc4d5092cb914daa1c744af7b8e3e4a3e6381dd70c7b96ede415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:12.472150Z","signature_b64":"gzsuN1m1hKbzw9Q4SdDq8vkrR27HCIl/MzWAN/QMbzxbsyZ66Ezii6/9RksuSDiQItv+DERpZH8IfgDLPl+RCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c132ce6db6ad5d4bd37f5d6e8437d1d6f7b11da99c99f53a06744357c1b8cd","last_reissued_at":"2026-05-18T00:41:12.471438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:12.471438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimization Framework with Flexible Inexact Inner Iterations for Nonconvex and Nonsmooth Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Risheng Liu, Xiaoliang Song, Yiyang Wang, Zhixun Su","submitted_at":"2017-02-28T03:22:55Z","abstract_excerpt":"In recent years, numerous vision and learning tasks have been (re)formulated as nonconvex and nonsmooth programmings(NNPs). Although some algorithms have been proposed for particular problems, designing fast and flexible optimization schemes with theoretical guarantee is a challenging task for general NNPs. It has been investigated that performing inexact inner iterations often benefit to special applications case by case, but their convergence behaviors are still unclear. Motivated by these practical experiences, this paper designs a novel algorithmic framework, named inexact proximal alterna"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08627","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":"1702.08627","created_at":"2026-05-18T00:41:12.471551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08627v3","created_at":"2026-05-18T00:41:12.471551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08627","created_at":"2026-05-18T00:41:12.471551+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TATFTTNW2WV","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TATFTTNW2WV2S6T","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TATFTTN","created_at":"2026-05-18T12:31:00.734936+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/4TATFTTNW2WV2S6TP5OW5BBX2H","json":"https://pith.science/pith/4TATFTTNW2WV2S6TP5OW5BBX2H.json","graph_json":"https://pith.science/api/pith-number/4TATFTTNW2WV2S6TP5OW5BBX2H/graph.json","events_json":"https://pith.science/api/pith-number/4TATFTTNW2WV2S6TP5OW5BBX2H/events.json","paper":"https://pith.science/paper/4TATFTTN"},"agent_actions":{"view_html":"https://pith.science/pith/4TATFTTNW2WV2S6TP5OW5BBX2H","download_json":"https://pith.science/pith/4TATFTTNW2WV2S6TP5OW5BBX2H.json","view_paper":"https://pith.science/paper/4TATFTTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08627&json=true","fetch_graph":"https://pith.science/api/pith-number/4TATFTTNW2WV2S6TP5OW5BBX2H/graph.json","fetch_events":"https://pith.science/api/pith-number/4TATFTTNW2WV2S6TP5OW5BBX2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TATFTTNW2WV2S6TP5OW5BBX2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TATFTTNW2WV2S6TP5OW5BBX2H/action/storage_attestation","attest_author":"https://pith.science/pith/4TATFTTNW2WV2S6TP5OW5BBX2H/action/author_attestation","sign_citation":"https://pith.science/pith/4TATFTTNW2WV2S6TP5OW5BBX2H/action/citation_signature","submit_replication":"https://pith.science/pith/4TATFTTNW2WV2S6TP5OW5BBX2H/action/replication_record"}},"created_at":"2026-05-18T00:41:12.471551+00:00","updated_at":"2026-05-18T00:41:12.471551+00:00"}