Analysis on Newton projection method for the split feasibility problem
From MaRDI portal
Publication:2012236
DOI10.1007/s10589-016-9884-3zbMath1375.90286OpenAlexW2551514487MaRDI QIDQ2012236
Biao Qu, Nai-Hua Xiu, Chang-Yu Wang
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
projection operatorgeneralized Jacobiansplit feasibility problemNewton projection methodglobal convergence and convergence rate
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30)
Related Items
Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem, A dynamical system method for solving the split convex feasibility problem, Internal perturbation projection algorithm for the extended split equality problem and the extended split equality fixed point problem, The split feasibility problem and its solution algorithm, General splitting methods with linearization for the split feasibility problem, The strong convergence of Douglas-Rachford methods for the split feasibility problem
Cites Work
- Unnamed Item
- Study of a primal-dual algorithm for equality constrained minimization
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- On a semi-smooth Newton method and its globalization
- Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
- A multiprojection algorithm using Bregman projections in a product space
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- Convergence of the gradient projection method for generalized convex minimization
- On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
- Some recent advances in projection-type methods for variational inequalities
- A hybrid Newton method for solving the variational inequality problem via the D-gap function
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- A nonsmooth version of Newton's method
- A globally convergent Newton method for solving strongly monotone variational inequalities
- Smoothing SQP algorithm for semismooth equations with box constraints
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- A smoothing homotopy method for variational inequality problems on polyhedral convex sets
- A new halfspace-relaxation projection method for the split feasibility problem
- A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem
- Optimization and nonsmooth analysis
- Strongly Regular Generalized Equations
- Semismooth and Semiconvex Functions in Constrained Optimization
- Linear Stability of Generalized Equations Part I: Basic Theory
- Linear Stability of Generalized Equations, Part II: Applications to Nonlinear Programming
- A computable generalized Hessian of the D-gap function and Newton-type methods for variational inequality problems
- A New Exact Penalty Function
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Strong Stability in Variational Inequalities
- A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
- A note on the CQ algorithm for the split feasibility problem
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP
