Abstract
The following paper describes a method for solving certain non-convex minimization problems. These problems contain properties where the feasible region may be represented as a union of convex cones. This set of cones is generated by the intersection of finitely many half-spaces passing through a defined origin. Globally the problem is non-convex, but it is locally convex within the interior of the generated cones whereas the objective function tends to infinity elsewhere. The following algorithm results in a polyhedral representation of all of the cones and an interior point in each of them. In order to solve the problem globally, a convex optimization algorithm is required to be initialized at each interior point and to converge to the local minimum over the corresponding cone. The best of these solutions is the global optimum. A study of the time complexity is presented herewith along with a detailed computational analysis.
Similar content being viewed by others
References
Agmon S (1954) The relaxation method for linear inequalities. Can J Math 6:382–392
Amanatides J (1984) Ray tracing with cones. In: Christiansen H (ed) Proceedings of the 11th annual conference on Computer graphics and interactive techniques (SIGGRAPH ’84), ACM, New York, pp 129–135
Chubanov S (2013) A polynomial projection algorithm for linear programming. Optim Online. http://www.optimization-online.org/DBHTML/2013/07/3948.html. Accessed 7 July 2013
Golub GH, Loan CFV (2013) Matrix computations. JHU Press, Baltimore
Ho C, Zimmerman S (2006) On the number of regions in an \(m\)-dimensional space cut by \(n\) hyperplanes. Gaz Aust Math Soc 33(4):260–264
Karmarkar NK (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373–395
Khachiyan LG (1979) A polynomial algorithm in linear programming. Dokl Akad Nauk SSSR 224:1093–1096
Klee V, Minty GJ (1972) How good is the simplex algorithm? Inequalities III 3:159–175
Motzkin TS, Schoenberg IJ (1954) The relaxation method for linear inequalities. Can J Math 6:393–404
Roos K (2013) Speeding up Chubanov’s method for solving a homogeneous inequality system. Optim. Online. http://www.optimization-online.org/DB_HTML/2013/09/4049.html. Accessed 20 Sept 2013
Wächter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math Program 106(1):25–57. doi:10.1007/s10107-004-0559-y
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the Fraunhofer ITWM scholarship for PhD students.
Rights and permissions
About this article
Cite this article
Belyaev, A. Generation of interior points and polyhedral representations of cones in \({\mathbb {R}}^N\) cut by \({\varvec{M}}\) planes sharing a common point. Math Meth Oper Res 83, 71–85 (2016). https://doi.org/10.1007/s00186-015-0520-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-015-0520-2