Superlinear rate of convergence and optimal acceleration schemes in the solution of convex inequality problems.

MaRDI QIDQ2768022zbMATH OpenFDO

Authors Ubaldo M. García-Palomares

Publication date 9 April 2002

zbMATH Keywords

quadratic programmingaccelerationconvex inequality problem

Mathematics Subject Classification ID

Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Recommendations

• A superlinearly convergent projection algorithm for solving the convex inequality problem
• scientific article; zbMATH DE number 1053661
• scientific article; zbMATH DE number 125259
• An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
• Incomplete projection algorithms for solving the convex feasibility problem

Cited in

(2)

• scientific article; zbMATH DE number 125259 (Why is no real title available?)
• Set intersection problems: supporting hyperplanes and quadratic programming

This page was built for publication: Superlinear rate of convergence and optimal acceleration schemes in the solution of convex inequality problems.

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