{"public_id":"cl_8e20b37de941c22c3cffc5a8ae4a2aef","status":"active","superseded_by_public_id":null,"corpus_id":256180851,"text":"Reformulating the Hamiltonian-Jacobi-Bellman equation leads to a nonlinear non-convex optimization problem that is then relaxed into a convex semi-definite programming form.","confidence":0.95,"paper":{"corpus_id":256180851,"title":"LQR based optimal co-design for linear control systems with input and state constraints","url":"https://sah.borca.ai/papers/256180851"},"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.95,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","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_3c6962e3883d8d6e2f05966e6e7e6447","name":"nonlinear non-convex optimization problem","description":"An optimization problem with nonlinear objectives or constraints and a non-convex feasible region.","types":["optimization problem"],"url":"https://sah.borca.ai/concepts/co_3c6962e3883d8d6e2f05966e6e7e6447"},{"public_id":"co_8824398c56705702413901df9a688e88","name":"Hamiltonian-Jacobi-Bellman equation","description":"A dynamic programming equation used in optimal control to characterize the value function.","types":["equation"],"url":"https://sah.borca.ai/concepts/co_8824398c56705702413901df9a688e88"},{"public_id":"co_8c4ec5169ac3387d791c16a08542f7af","name":"convex semi-definite programming","description":"A convex optimization framework in which the decision variables include positive semidefinite matrices.","types":["optimization method"],"url":"https://sah.borca.ai/concepts/co_8c4ec5169ac3387d791c16a08542f7af"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_8e20b37de941c22c3cffc5a8ae4a2aef"}