A non-interior continuation algorithm for solving the convex feasibility problem

DOI10.1016/j.apm.2014.04.030zbMath1428.90122OpenAlexW2003991201MaRDI QIDQ1634140

Nan Lu, Feng Ma, San-Yang Liu

Publication date: 17 December 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2014.04.030

zbMATH Keywords

convex feasibility problemlocal quadratic convergenceglobal linear convergencenon-interior continuation algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

Iterative algorithm for solving a class of convex feasibility problem ⋮ A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP ⋮ Numerical methods for solving some matrix feasibility problems

Uses Software

• ART3+

Cites Work

• Unnamed Item
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
• A smoothing-type algorithm for solving system of inequalities
• Modified block iterative algorithm for solving convex feasibility problems in Banach spaces
• Convergence results for an accelerated nonlinear Cimmino algorithm
• A parallel subgradient projections method for the convex feasibility problem
• A successive projection method
• Generalized Bregman projections in convex feasibility problems
• Non-interior continuation methods for solving semidefinite complementarity problems
• Modified hybrid block iterative algorithm for convex feasibility problems and generalized equilibrium problems for uniformly quasi-\(\varphi \)-asymptotically nonexpansive mappings
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• How good are projection methods for convex feasibility problems?
• A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
• Iterative approaches to convex feasibility problems in Banach spaces
• Fundamentals of Computerized Tomography
• On the string averaging method for sparse common fixed‐point problems
• Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
• On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
• A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
• On Projection Algorithms for Solving Convex Feasibility Problems
• Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
• The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP

This page was built for publication: A non-interior continuation algorithm for solving the convex feasibility problem