Abstract
We consider a decomposition approach to the problem of finding the orthogonal projection of a given point onto a convex polyhedral cone represented by a finite set of its generators. The reducibility of an arbitrary linear optimization problem to such projection problem potentially makes this approach one of the possible new ways to solve large-scale linear programming problems. Such an approach can be based on the idea of a recurrent dichotomy that splits the original large-scale problem into a binary tree of conical projections corresponding to a successive decomposition of the initial cone into the sum of lesser subcones. The key operation of this approach consists in solving the problem of projecting a certain point onto a cone represented as the sum of two subcones with the smallest possible modification of these subcones and their arbitrary selection. Three iterative algorithms implementing this basic operation are proposed, their convergence is proved, and numerical experiments demonstrating both the computational efficiency of the algorithms and certain challenges in their application are performed.
REFERENCES
NEOS Server: State-of-the-Art Solvers for Numerical Optimization. https://neos-server.org/neos/
IBM ILOG CPLEX Optimizer. https://www.ibm.com/products/ilog-cplex-optimization-studio/cplex-optimizer
The Leader in Decision Intelligence Technology — Gurobi Optimization. https://www.gurobi.com
Cardinal Optimizer (COPT). https://www.shanshu.ai/copt
GNU Linear Programming Kit (GLPK).. https://www.gnu.org/software/glpk/
Open Source Linear and Mixed-Integer Programming Software and Solvers. https://www.gurobi.com/resources/ open-source-linear-and-mixed-integer-programming-software-and-solvers/
E. A. Nurminski, “Single-projection procedure for linear optimization,” J. Global Optim. 66 (1), 95–110 (2016). https://doi.org/10.1007/s10898-015-0337-9
E. A. Nurminski, “Projection onto polyhedra in outer representation,” Comput. Math. Math. Phys. 48, 367–375 (2008).
E. V. Shikin, Linear Spaces and Mappings (URSS, Moscow, 2022) [in Russian].
E. A. Nurminski, Follow-Up on Conversion of Outer Projection to Inner (2022).
Yu. E. Nesterov, “Efficiency of coordinate descent methods on huge-scale optimization problems,” SIAM J. Optim. 22 (2), 341–362 (2022). https://doi.org/10.1137/100802001
H. H. Bauschke and J. M. Borwein, “On the convergence of von Neumann’s alternating projection algorithm for two sets,” Set-Valued Anal. 1, 185–212 (1993).
Z. Q. Luo and P. Tseng, “On the convergence of the coordinate descent method for convex differentiable minimization,” J. Optim. Theory Appl. 72, 7–35 (1992).
S. J. Wright, “Coordinate descent algorithms,” Math. Progr. 151 (1), 3–34 (2015). https://doi.org/10.1007/s10107-015-0892-3
Funding
This work was carried out at the Far-East Mathematical Research Center and was supported by the Ministry of Science and Higher Education of the Russian Federation (agreement no. 075-02-2023-946 of February 16, 2023, for the realization of programs for the development of regional centers for mathematical research and education).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The author of this work declares that he has no conflicts of interest.
Additional information
Translated from Trudy Instituta Matematiki i Mekhaniki UrO RAN, Vol. 29, No. 3, pp. 73 - 87, 2023 https://doi.org/10.21538/0134-4889-2023-29-3-73-87.
Translated by E. Vasil’eva
Publisher's Note Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
Rights and permissions
About this article
Cite this article
Nurminski, E.A. A Bicomposition of Conical Projections. Proc. Steklov Inst. Math. 323 (Suppl 1), S179–S193 (2023). https://doi.org/10.1134/S0081543823060160
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543823060160