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

DOI10.1016/J.APM.2014.04.030MaRDI QIDQ1634140zbMATH OpenOpenAlexFDO

Authors Nan Lu, Feng Ma, Sanyang 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)

Recommendations

• An algorithm for the convex feasibility problem
• A new algorithm for solving the non-differentiable convex feasibility problem
• Non-interior continuation for nonlinear inequalities
• scientific article; zbMATH DE number 7071894
• On convex feasibility problems

Cites work

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

Cited in

(6)

• A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
• Iterative algorithm for solving a class of convex feasibility problem
• A new algorithm for solving the non-differentiable convex feasibility problem
• A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP
• On the circumcentered-reflection method for the convex feasibility problem
• Numerical methods for solving some matrix feasibility problems

Describes a project that uses

Uses Software

• ART3+

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

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