{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XOWFSDJUEPEBYJA26LSZ6CY5V3","short_pith_number":"pith:XOWFSDJU","schema_version":"1.0","canonical_sha256":"bbac590d3423c81c241af2e59f0b1daee412444ffd5409a798f316d41c26b5f0","source":{"kind":"arxiv","id":"1403.5784","version":2},"attestation_state":"computed","paper":{"title":"Subgradient algorithms for solving variable inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Bouza Allende, J.Y. Bello Cruz, L.R. Lucambio Perez","submitted_at":"2014-03-23T18:34:40Z","abstract_excerpt":"In this paper we consider the variable inequality problem, that is, to find a solution of the inclusion given by the sum of a function and a point-to-cone application. This problem can be seen as a generalization of the classical system inequality problem taking a variable order structure. Exploiting this special structure, we propose two variants of the subgradient algorithm for solving a system of variable inequalities. The convergence analysis is given under convex-like conditions which, when the point-to-cone application is constant, contains the old subgradient schemes."},"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":"1403.5784","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-23T18:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"1e414b1b0f1e5e58d08d8639d424fff6de17650b02ae2e297df4496e6397054f","abstract_canon_sha256":"65edc8b266177769602a1ed47fbc62e6fb9d3b25e2f485df5aa6a1e212a0a7de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:16.130343Z","signature_b64":"Z4uBt8xncC/qt/UzWNOSSVg5Q9UMewjpEu2sNFW7KL3LjJkoYo4VuZXIWZB4anRmTvaS4O2ralOKgauBqsy3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbac590d3423c81c241af2e59f0b1daee412444ffd5409a798f316d41c26b5f0","last_reissued_at":"2026-05-18T02:43:16.129695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:16.129695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgradient algorithms for solving variable inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Bouza Allende, J.Y. Bello Cruz, L.R. Lucambio Perez","submitted_at":"2014-03-23T18:34:40Z","abstract_excerpt":"In this paper we consider the variable inequality problem, that is, to find a solution of the inclusion given by the sum of a function and a point-to-cone application. This problem can be seen as a generalization of the classical system inequality problem taking a variable order structure. Exploiting this special structure, we propose two variants of the subgradient algorithm for solving a system of variable inequalities. The convergence analysis is given under convex-like conditions which, when the point-to-cone application is constant, contains the old subgradient schemes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5784","kind":"arxiv","version":2},"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":"1403.5784","created_at":"2026-05-18T02:43:16.129788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5784v2","created_at":"2026-05-18T02:43:16.129788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5784","created_at":"2026-05-18T02:43:16.129788+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOWFSDJUEPEB","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOWFSDJUEPEBYJA2","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOWFSDJU","created_at":"2026-05-18T12:28:57.508820+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/XOWFSDJUEPEBYJA26LSZ6CY5V3","json":"https://pith.science/pith/XOWFSDJUEPEBYJA26LSZ6CY5V3.json","graph_json":"https://pith.science/api/pith-number/XOWFSDJUEPEBYJA26LSZ6CY5V3/graph.json","events_json":"https://pith.science/api/pith-number/XOWFSDJUEPEBYJA26LSZ6CY5V3/events.json","paper":"https://pith.science/paper/XOWFSDJU"},"agent_actions":{"view_html":"https://pith.science/pith/XOWFSDJUEPEBYJA26LSZ6CY5V3","download_json":"https://pith.science/pith/XOWFSDJUEPEBYJA26LSZ6CY5V3.json","view_paper":"https://pith.science/paper/XOWFSDJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5784&json=true","fetch_graph":"https://pith.science/api/pith-number/XOWFSDJUEPEBYJA26LSZ6CY5V3/graph.json","fetch_events":"https://pith.science/api/pith-number/XOWFSDJUEPEBYJA26LSZ6CY5V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOWFSDJUEPEBYJA26LSZ6CY5V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOWFSDJUEPEBYJA26LSZ6CY5V3/action/storage_attestation","attest_author":"https://pith.science/pith/XOWFSDJUEPEBYJA26LSZ6CY5V3/action/author_attestation","sign_citation":"https://pith.science/pith/XOWFSDJUEPEBYJA26LSZ6CY5V3/action/citation_signature","submit_replication":"https://pith.science/pith/XOWFSDJUEPEBYJA26LSZ6CY5V3/action/replication_record"}},"created_at":"2026-05-18T02:43:16.129788+00:00","updated_at":"2026-05-18T02:43:16.129788+00:00"}