{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-09","reactions":{},"formalized":true,"formalizes":[{"title":"Modern computational approaches to nonlinear discrete optimization and applications in process systems engineering","identifier":"","relationship":"adapts"},{"title":"Improved quadratic cuts for convex mixed-integer nonlinear programs","identifier":"doi:10.1016/j.compchemeng.2017.10.011","relationship":"adapts"}]}