Method of alternating contractions and its applications to some convex optimization problems
From MaRDI portal
(Redirected from Publication:5010045)
Recommendations
- A polynomial-time descent method for separable convex optimization problems with linear constraints
- scientific article; zbMATH DE number 617915
- A new algorithm for minimizing convex functions over convex sets
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
- scientific article; zbMATH DE number 3860890
Cites work
- A new polynomial-time algorithm for linear programming
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
- A polynomial projection algorithm for linear feasibility problems
- A simple polynomial-time rescaling algorithm for solving linear programs
- Combinatorial optimization. Theory and algorithms.
- Convergence of sequential and asynchronous nonlinear paracontractions
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Equality relating Euclidean distance cone to positive semidefinite cone
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- Proximity Maps for Convex Sets
- Solving conic systems via projection and rescaling
- The Relaxation Method for Linear Inequalities
This page was built for publication: Method of alternating contractions and its applications to some convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010045)
