A finitely convergent algorithm for convex inequalities

DOI10.1109/TAC.1982.1103081MaRDI QIDQ3959019zbMATH OpenOpenAlexFDO

Authors Masao Fukushima

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

zbMATH Keywords

convex functionsSlater conditionsubgradient methods

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of reduced gradient type (90C52)

Cited in

(8)

• A new finitely convergent algorithm for systems of nonlinear inequalities
• Subgradient projectors: extensions, theory, and characterizations
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
• Finitely convergent iterative methods with overrelaxations revisited
• On the finite convergence of a projected cutter method
• A new -generalized projection method of strongly sub-feasible directions for inequality constrained optimization
• A generalized projection-based scheme for solving convex constrained optimization problems
• Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems

This page was built for publication: A finitely convergent algorithm for convex inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3959019)