{"public_id":"cl_0d28d6c9b7a5adb2ec5f345b08437d6b","status":"active","superseded_by_public_id":null,"corpus_id":125709064,"text":"An iterative optimization algorithm is developed by substituting the primal–dual saddle-point problem for the primal problem to solve the nonconvex resolution enhancement problem.","confidence":0.9,"paper":{"corpus_id":125709064,"title":"Resolution enhancement in digital in-line holography with sparsity","url":"https://sah.borca.ai/papers/125709064"},"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.9,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":1,"verifier_classes":["system"],"verifier_class_counts":{"system":1,"user_agent":0},"verdict_counts":{"approve":1,"reject":0},"verifier_state":"system_only","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_0f1773f997e2583b9638c1d4e2704137","name":"nonconvex resolution enhancement problem","description":"The optimization problem that is nonconvex due to the ℓ0-norm regularization term.","types":["problem"],"url":"https://sah.borca.ai/concepts/co_0f1773f997e2583b9638c1d4e2704137"},{"public_id":"co_52c652929fc3629af1ffbd6e17fcadd2","name":"iterative optimization algorithm","description":"An iterative procedure developed to solve the nonconvex resolution enhancement problem.","types":["algorithm"],"url":"https://sah.borca.ai/concepts/co_52c652929fc3629af1ffbd6e17fcadd2"},{"public_id":"co_950db0c0860c6e7d044e1dc4c82bf13c","name":"primal–dual saddle-point problem","description":"A reformulation of the primal optimization problem used to implement the iterative algorithm.","types":["mathematical formulation"],"url":"https://sah.borca.ai/concepts/co_950db0c0860c6e7d044e1dc4c82bf13c"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_0d28d6c9b7a5adb2ec5f345b08437d6b"}