{"schema_version":"1.0","canonical_url":"https://patentable.app/patents/US-9753892","patent":{"patent_number":"US-9753892","title":"Method for solving quadratic programs for convex sets with linear equalities by an alternating direction method of multipliers with optimized step sizes","assignee":null,"inventors":[],"filing_date":"2014-02-20T00:00:00.000Z","publication_date":"2017-09-05T00:00:00.000Z","cpc_codes":["G06F","G05B","G05B","G06F","G06F"],"num_claims":14,"abstract":"A method solves a convex quadratic program (QP) for a convex set. Constrains of the QP include sets of linear equalities and linear inequalities. The solving uses an Alternating Direction Method of Multipliers (ADMM). Variables of the convex QP include a linear subspace constrained variable vector and a set constrained variable vector. The method solves the linear subspace constrained variable vector while keeping the set constrained variable vector fixed using an optimal step size and a Lagrangian multiplier, and solves the set of constrained variable vector while keeping linear subspace constrained variable vector fixed using the optimal step size and the Lagrangian multiplier. Then, the Lagrangian multiplier is updated. A feasible solution is outputted if a termination condition for the feasible solution is satisfied, and an infeasible solution is signaled if a termination condition for the satisfied for the infeasible solution is satisfied. Otherwise, the steps are repeated."},"analysis":{"summary":null,"layman_explanation":null,"technical_analysis":null,"business_analysis":null,"faqs":null,"topics":[],"tech_cluster":null},"seo":{"title":"Method for solving quadratic programs for convex sets with linear equalities by an alternating direction method of multipliers with optimized step sizes","description":"A method solves a convex quadratic program (QP) for a convex set. Constrains of the QP include sets of linear equalities and linear inequalities. The solving uses an Alternating Direction Method of Mu","keywords":[]},"attribution":{"source":"Patentable","source_url":"https://patentable.app","canonical_url":"https://patentable.app/patents/US-9753892","license":"CC-BY-4.0-like","license_terms":"AI-generated analysis on this page (summary, layman_explanation, technical_analysis, business_analysis, faqs) may be reused with attribution and a visible link back to the canonical URL above. Patent abstracts, claims, and bibliographic data are USPTO public domain.","required_link":"https://patentable.app/patents/US-9753892","citation_suggestion":"Patentable. \"Method for solving quadratic programs for convex sets with linear equalities by an alternating direction method of multipliers with optimized step sizes\" (US-9753892). https://patentable.app/patents/US-9753892","copyright_holder":"Nomic Interactive Technology LLC"},"links":{"html":"https://patentable.app/patents/US-9753892","json":"https://patentable.app/api/llm-context/US-9753892","site":"https://patentable.app","llms_txt":"https://patentable.app/llms.txt"},"generated_at":"2026-06-06T04:59:10.353Z"}