{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KGYHHLEZAA7I4KFVCZUB74QCK4","short_pith_number":"pith:KGYHHLEZ","schema_version":"1.0","canonical_sha256":"51b073ac99003e8e28b516681ff2025722565cd27f29b28725e6894a50f25746","source":{"kind":"arxiv","id":"2503.01056","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Lahcen El Bourkhissi, Panagiotis Patrinos, Quoc Tran-Dinh","submitted_at":"2025-03-02T23:33:44Z","abstract_excerpt":"This paper addresses a class of general nonsmooth and nonconvex composite optimization problems subject to nonlinear equality constraints. We assume that a part of the objective function and the functional constraints exhibit local smoothness. To tackle this challenging class of problems, we propose a novel linearized perturbed augmented Lagrangian method. This method incorporates a perturbation in the augmented Lagrangian function by scaling the dual variable with a sub-unitary parameter. Furthermore, we linearize the smooth components of the objective and the constraints within the perturbed"},"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":"2503.01056","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-02T23:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"44b435341ada5a7542dead1f6a698784582e437992a5cb933cc735e761b61857","abstract_canon_sha256":"8eb2636d575a798996cf44ca0304ff646e3e0122cb460f744d60f8a0cfa0ac23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:35.171120Z","signature_b64":"FXRjVTXLJyxdZitO4eLsUoFmkH6qjkDjjj2Wv74agFlsyXXLkr/vQnStV0cWtN+z7aKollvcX5oFs92dxHgACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b073ac99003e8e28b516681ff2025722565cd27f29b28725e6894a50f25746","last_reissued_at":"2026-07-05T10:22:35.170613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:35.170613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Lahcen El Bourkhissi, Panagiotis Patrinos, Quoc Tran-Dinh","submitted_at":"2025-03-02T23:33:44Z","abstract_excerpt":"This paper addresses a class of general nonsmooth and nonconvex composite optimization problems subject to nonlinear equality constraints. We assume that a part of the objective function and the functional constraints exhibit local smoothness. To tackle this challenging class of problems, we propose a novel linearized perturbed augmented Lagrangian method. This method incorporates a perturbation in the augmented Lagrangian function by scaling the dual variable with a sub-unitary parameter. Furthermore, we linearize the smooth components of the objective and the constraints within the perturbed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01056","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/2503.01056/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":"2503.01056","created_at":"2026-07-05T10:22:35.170688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01056v1","created_at":"2026-07-05T10:22:35.170688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01056","created_at":"2026-07-05T10:22:35.170688+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGYHHLEZAA7I","created_at":"2026-07-05T10:22:35.170688+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGYHHLEZAA7I4KFV","created_at":"2026-07-05T10:22:35.170688+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGYHHLEZ","created_at":"2026-07-05T10:22:35.170688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12397","citing_title":"Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4","json":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4.json","graph_json":"https://pith.science/api/pith-number/KGYHHLEZAA7I4KFVCZUB74QCK4/graph.json","events_json":"https://pith.science/api/pith-number/KGYHHLEZAA7I4KFVCZUB74QCK4/events.json","paper":"https://pith.science/paper/KGYHHLEZ"},"agent_actions":{"view_html":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4","download_json":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4.json","view_paper":"https://pith.science/paper/KGYHHLEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01056&json=true","fetch_graph":"https://pith.science/api/pith-number/KGYHHLEZAA7I4KFVCZUB74QCK4/graph.json","fetch_events":"https://pith.science/api/pith-number/KGYHHLEZAA7I4KFVCZUB74QCK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4/action/storage_attestation","attest_author":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4/action/author_attestation","sign_citation":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4/action/citation_signature","submit_replication":"https://pith.science/pith/KGYHHLEZAA7I4KFVCZUB74QCK4/action/replication_record"}},"created_at":"2026-07-05T10:22:35.170688+00:00","updated_at":"2026-07-05T10:22:35.170688+00:00"}