Id: palomar/PALOMAR-2026-11-09-000015 Url: https://github.com/bernalde/ch05-initialized-mixed-psc-return/tree/c77ce6cf002b6b96c84e640c61a5a44f9cdb6c28 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000015-v1.json Repo: https://github.com/bernalde/ch05-initialized-mixed-psc-return Tags: math.OC, msc:90C11, msc:90C30 Score: 0 Title: Initialized mixed PSC and quadratic OA finite stored return Trust: high Domain: math.OC Source: palomar Authors: David E. Bernal Neira Reviews: 0 Subject: math.OC Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-09 Formalized: true Formalizes: title=Modern computational approaches to nonlinear discrete optimization and applications in process systems engineering identifier= relationship=adapts Formalizes: title=Improved quadratic cuts for convex mixed-integer nonlinear programs identifier=doi:10.1016/j.compchemeng.2017.10.011 relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-09-000015 The actual mixed-history recursion has its own master/state/reachability and accepts every exact selector and valid finite pool. Initialization has three branches: an empty relaxation certifies original infeasibility; an admitted integral relaxation minimizer returns a direct exact original minimum without stored-event provenance or loop decisions; fractional initialization runs the mixed loop, yielding certified infeasibility or a stored original-feasible epsilon-optimum with retained decorated-event provenance, exact at epsilon zero. The bound activeY.card+1<=integers.card+1 concerns main…