Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems

DOI10.1137/18M1217395zbMath1476.90235OpenAlexW3190732217MaRDI QIDQ5010045

Sergei Chubanov

Publication date: 24 August 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/18m1217395

zbMATH Keywords

linear programmingconvex optimizationcombinatorial optimization

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial projection algorithm for linear feasibility problems
• A new polynomial-time algorithm for linear programming
• Equality relating Euclidean distance cone to positive semidefinite cone
• Convergence of sequential and asynchronous nonlinear paracontractions
• Solving conic systems via projection and rescaling
• A polynomial algorithm for convex quadratic optimization subject to linear inequalities
• Proximity Maps for Convex Sets
• On the non-polynomiality of the relaxation method for systems of linear inequalities
• Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• The Relaxation Method for Linear Inequalities
• Combinatorial optimization. Theory and algorithms.
• A simple polynomial-time rescaling algorithm for solving linear programs

This page was built for publication: Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems