A superlinearly convergent projection algorithm for solving the convex inequality problem
type: Item
instance of: scholarly article
title: A superlinearly convergent projection algorithm for solving the convex inequality problem
zbMATH Open document ID: 0911.90323
DOI: 10.1016/S0167-6377(98)00003-0
published in: Operations Research Letters
publication date: 1999-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 1223284
zbMATH Keywords: convex systems
zbMATH Keywords: convex inequality problem
zbMATH Keywords: projection algorithm
zbMATH Keywords: global and superlinear rate of convergence
zbMATH Keywords: convex constrained linear complementarity problem
author: Ubaldo M. García-Palomares
MaRDI profile type: Publication
cites work: Newton's method for linear complementarity problems
cites work: An interior points algorithm for the convex feasibility problem
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Row Projection Methods for Large Nonsymmetric Linear Systems
cites work: On the behavior of a block-iterative projection method for solving convex feasibility problems
cites work: Q4312993
cites work: Cyclic subgradient projections
cites work: Q4010376
cites work: Q5520839
cites work: Relaxed outer projections, weighted averages and convex feasibility
cites work: A global quadratic algorithm for solving a system of mixed equalities and inequalities
cites work: A class of methods for solving large convex systems
cites work: Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
cites work: Acceleration schemes for the method of alternating projections
cites work: The method of projections for finding the common point of convex sets
cites work: Q3477904
cites work: On certain iterative methods for solving linear systems
cites work: Convergence results for an accelerated nonlinear Cimmino algorithm
cites work: Block-iterative surrogate projection methods for convex feasibility problems
cites work: An interior point potential reduction algorithm for the linear complementarity problem
cites work: Q5589748
cites work: Functional Operators (AM-21), Volume 1
cites work: NE/SQP: A robust algorithm for the nonlinear complementarity problem
cites work: Gradient methods for solving equations and inequalities
cites work: Newton's method for the solution of systems of equalities and inequalities
cites work: Extension of Newton's method to nonlinear functions with values in a cone
cites work: Q4094660
cites work: State Constraints in Convex Control Problems of Bolza
cites work: New iterative methods for linear inequalities
cites work: On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
description: scientific article; zbMATH DE number 1223284