A finitely convergent algorithm for convex inequalities
From MaRDI portal
Publication:3959019
DOI10.1109/TAC.1982.1103081zbMath0495.49022OpenAlexW2137197631MaRDI QIDQ3959019
Publication date: 1982
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.1982.1103081
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems ⋮ Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization ⋮ Finitely convergent iterative methods with overrelaxations revisited ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ A new finitely convergent algorithm for systems of nonlinear inequalities ⋮ On the finite convergence of a projected cutter method
This page was built for publication: A finitely convergent algorithm for convex inequalities
