{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YYR2OKUMJ2AKDBTQAZ7MJ3ULCR","short_pith_number":"pith:YYR2OKUM","schema_version":"1.0","canonical_sha256":"c623a72a8c4e80a18670067ec4ee8b146db16c2546295b5ddf480a0eed0a6893","source":{"kind":"arxiv","id":"1412.4329","version":1},"attestation_state":"computed","paper":{"title":"A Novel Augmented Lagrangian Approach for Inequalities and Convergent Any-Time Non-Central Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marc Toussaint","submitted_at":"2014-12-14T09:10:57Z","abstract_excerpt":"Motivated by robotic trajectory optimization problems we consider the Augmented Lagrangian approach to constrained optimization. We first propose an alternative augmentation of the Lagrangian to handle the inequality case (not based on slack variables) and a corresponding \"central\" update of the dual parameters. We proove certain properties of this update: roughly, in the case of LPs and when the \"constraint activity\" does not change between iterations, the KKT conditions hold after just one iteration. This gives essential insight on when the method is efficient in practise. We then present ou"},"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":"1412.4329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-14T09:10:57Z","cross_cats_sorted":[],"title_canon_sha256":"6257a79ef136b7251d62d2ea8e1d284d6feac0acb087c04e4981748b4b43e358","abstract_canon_sha256":"d73873bc3f3370aaecdb9996dc95f88a903b138d53a02d6197318a3a58bad096"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:19.516387Z","signature_b64":"xO+HDAiKXkuVdOVaiodyuWg00/LehZAvPNUNsUXshkAljsdCWrzOUxRy8WgdSgTxjDA435sUnMc258SGBnSBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c623a72a8c4e80a18670067ec4ee8b146db16c2546295b5ddf480a0eed0a6893","last_reissued_at":"2026-05-18T02:31:19.515794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:19.515794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Augmented Lagrangian Approach for Inequalities and Convergent Any-Time Non-Central Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marc Toussaint","submitted_at":"2014-12-14T09:10:57Z","abstract_excerpt":"Motivated by robotic trajectory optimization problems we consider the Augmented Lagrangian approach to constrained optimization. We first propose an alternative augmentation of the Lagrangian to handle the inequality case (not based on slack variables) and a corresponding \"central\" update of the dual parameters. We proove certain properties of this update: roughly, in the case of LPs and when the \"constraint activity\" does not change between iterations, the KKT conditions hold after just one iteration. This gives essential insight on when the method is efficient in practise. We then present ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4329","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":"1412.4329","created_at":"2026-05-18T02:31:19.515863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4329v1","created_at":"2026-05-18T02:31:19.515863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4329","created_at":"2026-05-18T02:31:19.515863+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYR2OKUMJ2AK","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYR2OKUMJ2AKDBTQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYR2OKUM","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09127","citing_title":"IMPACT: An Implicit Active-Set Augmented Lagrangian for Fast Contact-Implicit Trajectory Optimization","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09127","citing_title":"IMPACT: An Implicit Active-Set Augmented Lagrangian for Fast Contact-Implicit Trajectory Optimization","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR","json":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR.json","graph_json":"https://pith.science/api/pith-number/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/graph.json","events_json":"https://pith.science/api/pith-number/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/events.json","paper":"https://pith.science/paper/YYR2OKUM"},"agent_actions":{"view_html":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR","download_json":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR.json","view_paper":"https://pith.science/paper/YYR2OKUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4329&json=true","fetch_graph":"https://pith.science/api/pith-number/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/graph.json","fetch_events":"https://pith.science/api/pith-number/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/action/storage_attestation","attest_author":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/action/author_attestation","sign_citation":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/action/citation_signature","submit_replication":"https://pith.science/pith/YYR2OKUMJ2AKDBTQAZ7MJ3ULCR/action/replication_record"}},"created_at":"2026-05-18T02:31:19.515863+00:00","updated_at":"2026-05-18T02:31:19.515863+00:00"}