Analysis on Newton projection method for the split feasibility problem

DOI10.1007/S10589-016-9884-3zbMATH Open1375.90286OpenAlexW2551514487MaRDI QIDQ2012236FDOQ2012236

Authors: Biao Qu, Changyu Wang, Naihua Xiu 

Publication date: 28 July 2017

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-016-9884-3

Recommendations

• A new iterative method for the split feasibility problem
• Gradient projection method with a new step size for the split feasibility problem
• A splitting-relaxed projection method for solving the split feasibility problem
• Several solution methods for the split feasibility problem
• The relaxed inexact projection methods for the split feasibility problem

zbMATH Keywords

split feasibility problemgeneralized Jacobianprojection operatorNewton projection methodglobal convergence and convergence rate

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Cites Work

• On Projection Algorithms for Solving Convex Feasibility Problems
• A multiprojection algorithm using Bregman projections in a product space
• Iterative oblique projection onto convex sets and the split feasibility problem
• A nonsmooth version of Newton's method
• Optimization and nonsmooth analysis
• Strongly Regular Generalized Equations
• Semismooth and Semiconvex Functions in Constrained Optimization
• A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A new halfspace-relaxation projection method for the split feasibility problem
• Strong Stability in Variational Inequalities
• A New Exact Penalty Function
• Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
• A feasible semismooth asymptotically Newton method for mixed complementarity problems
• Solving variational inequality problems via smoothing-nonsmooth reformulations
• Some recent advances in projection-type methods for variational inequalities
• A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
• A globally convergent Newton method for solving strongly monotone variational inequalities
• Convergence of the gradient projection method for generalized convex minimization
• A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem
• An interior-point affine-scaling trust-region method for semismooth equations with box constraints
• A computable generalized Hessian of the D-gap function and Newton-type methods for variational inequality problems
• Study of a primal-dual algorithm for equality constrained minimization
• On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
• Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP
• A hybrid Newton method for solving the variational inequality problem via the D-gap function
• On a semi-smooth Newton method and its globalization
• Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
• Applications of semi-smooth Newton methods to variational inequalities
• Smoothing SQP algorithm for semismooth equations with box constraints
• A smoothing homotopy method for variational inequality problems on polyhedral convex sets
• Linear Stability of Generalized Equations Part I: Basic Theory
• Linear Stability of Generalized Equations, Part II: Applications to Nonlinear Programming

Cited In (9)

• The split feasibility problem and its solution algorithm
• General splitting methods with linearization for the split feasibility problem
• On inertial non-Lipschitz stepsize algorithms for split feasibility problems
• A dynamical system method for solving the split convex feasibility problem
• The strong convergence of Douglas-Rachford methods for the split feasibility problem
• A dynamical system with fixed-time convergence for solving the split feasibility problem and applications to signal recovery
• A new fixed-time stability of neural network to solve split convex feasibility problems
• Internal perturbation projection algorithm for the extended split equality problem and the extended split equality fixed point problem
• Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem

This page was built for publication: Analysis on Newton projection method for the split feasibility problem

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