Showing 2020Show all
2 papers · 1 filter
math.OC2020
Unconstraint minimization of continuous convex functions. Application to LP
Beniamin Costandin, Marius Costandin, Petru Dobra
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper…
math.OC2020
Maximizing The Distance To A "Far Enough" Point Over The Intersection Of Hyper-Disks
Marius-Simion Costandin, Bogdan Gavrea, Beniamin Costandin
We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the…