A superlinearly convergent projection algorithm for solving the convex inequality problem
From MaRDI portal
Publication:1271387
DOI10.1016/S0167-6377(98)00003-0zbMath0911.90323MaRDI QIDQ1271387
Publication date: 5 May 1999
Published in: Operations Research Letters (Search for Journal in Brave)
projection algorithmconvex systemsconvex constrained linear complementarity problemconvex inequality problemglobal and superlinear rate of convergence
Related Items
The Exponential Stability for a Class of Hybrid Systems ⋮ Set intersection problems: supporting hyperplanes and quadratic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- Relaxed outer projections, weighted averages and convex feasibility
- Convergence results for an accelerated nonlinear Cimmino algorithm
- An interior points algorithm for the convex feasibility problem
- An interior point potential reduction algorithm for the linear complementarity problem
- Acceleration schemes for the method of alternating projections
- New iterative methods for linear inequalities
- Block-iterative surrogate projection methods for convex feasibility problems
- A class of methods for solving large convex systems
- On certain iterative methods for solving linear systems
- Newton's method for the solution of systems of equalities and inequalities
- Extension of Newton's method to nonlinear functions with values in a cone
- Newton's method for linear complementarity problems
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- A global quadratic algorithm for solving a system of mixed equalities and inequalities
- Cyclic subgradient projections
- Row Projection Methods for Large Nonsymmetric Linear Systems
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
- Gradient methods for solving equations and inequalities
- The method of projections for finding the common point of convex sets
- State Constraints in Convex Control Problems of Bolza
- Functional Operators (AM-21), Volume 1