7 papers · 1 filter
Vertex Loci of Max-Indicator Polytopes and Vertex Retrieval in Ball Polyhedra
Marius Costandin
The so called "max-indicator polytopes" were introduced in \cite{mainB} as an intersection of half-spaces related to the problem of finding the farthest in an intersection of balls…
Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
Marius Costandin, Beniamin Costandin
In this paper we study the problem of maximizing the distance to a given point over a polytope . Assuming that the polytope is circumscribed by a known ball we c…
A Quasi-Polynomial Algorithm for Subset-Sum Problems with At Most One Solution
Marius Costandin, Beniamin Costandin
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial tim…
On Maximizing the Distance to a Given Point over an Intersection of Balls II
Marius Costandin
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general…
On Global Maximization of Bounded Hessian Functions over Strongly Convex Domains
Marius Costandin
In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first prese…
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…