Mathematics of operations research, ISSN 1526-5471, 2008, Volume 33, Issue 1, pp. 216 - 234

We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate...

nonconvex | alternating projections | spectral set | subspace angle | metric regularity | linear convergence | low-rank approximation | Mathematical manifolds | Linear convergence | Mathematical theorems | Approximation | Eigenvalues | Mathematical constants | Matrices | Mathematical inequalities | Mathematical vectors | Mathematical functions | Alternating projections | Low-rank approximation | Spectral set | Metric regularity | Nonconvex | Subspace angle | MATHEMATICS, APPLIED | INVERSE EIGENVALUE PROBLEMS | ALGORITHMS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONSTRAINTS | LINEAR MATRIX INEQUALITIES | Manifolds (Mathematics) | Convergence (Mathematics) | Analysis | Methods | Studies | Euclidean space | Topological manifolds | Heuristic | Mathematics | Optimization and Control

nonconvex | alternating projections | spectral set | subspace angle | metric regularity | linear convergence | low-rank approximation | Mathematical manifolds | Linear convergence | Mathematical theorems | Approximation | Eigenvalues | Mathematical constants | Matrices | Mathematical inequalities | Mathematical vectors | Mathematical functions | Alternating projections | Low-rank approximation | Spectral set | Metric regularity | Nonconvex | Subspace angle | MATHEMATICS, APPLIED | INVERSE EIGENVALUE PROBLEMS | ALGORITHMS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONSTRAINTS | LINEAR MATRIX INEQUALITIES | Manifolds (Mathematics) | Convergence (Mathematics) | Analysis | Methods | Studies | Euclidean space | Topological manifolds | Heuristic | Mathematics | Optimization and Control

Journal Article

International journal of mathematics, ISSN 1793-6519, 2018, Volume 29, Issue 12, p. 1850084

We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots...

Crosscap number (non-orientable genus) | spanning surfaces | knot projection | alternating knot | MATHEMATICS

Crosscap number (non-orientable genus) | spanning surfaces | knot projection | alternating knot | MATHEMATICS

Journal Article

Mathematics of operations research, ISSN 1526-5471, 2019, Volume 44, Issue 2, pp. 715 - 738

Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems...

superregularity | quasi coercivity | linear regularity | cyclic projections | linear convergence | reflection-projection algorithm | Douglasâ€“Rachford algorithm | strong regularity | injectable set | quasi firm FejÃ©r monotonicity | semi-intrepid projection | CONVEX FEASIBILITY PROBLEMS | MATHEMATICS, APPLIED | COLLECTIONS | quasi firm Fejer monotonicity | FINITE CONVERGENCE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Douglas-Rachford algorithm | RELAXATION METHOD | REGULARITY | ALTERNATING PROJECTIONS | Convergence (Mathematics) | Algorithms | Research | Mathematical research | Mathematics - Optimization and Control

superregularity | quasi coercivity | linear regularity | cyclic projections | linear convergence | reflection-projection algorithm | Douglasâ€“Rachford algorithm | strong regularity | injectable set | quasi firm FejÃ©r monotonicity | semi-intrepid projection | CONVEX FEASIBILITY PROBLEMS | MATHEMATICS, APPLIED | COLLECTIONS | quasi firm Fejer monotonicity | FINITE CONVERGENCE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Douglas-Rachford algorithm | RELAXATION METHOD | REGULARITY | ALTERNATING PROJECTIONS | Convergence (Mathematics) | Algorithms | Research | Mathematical research | Mathematics - Optimization and Control

Journal Article

Foundations of computational mathematics, ISSN 1615-3383, 2008, Volume 9, Issue 4, pp. 485 - 513

... (convexity or smoothness, for example), we prove that von Neumann's method of "alternating projections" converges locally to a point in the intersection, at a linear rate associated with a modulus of regularity...

Alternating projections | Extremal principle | Variational analysis | Linear convergence | Averaged projections | Distance to ill-posedness | Nonconvexity | Metric regularity | Prox-regularity | MATRIX | MATHEMATICS, APPLIED | VARIANTS | DIFFERENTIABILITY | COMPLEXITY THEORY | PROXIMAL POINT ALGORITHM | MATHEMATICS | REGULARITY | COMPUTER SCIENCE, THEORY & METHODS | Mathematical problems | Variance analysis | Algorithms | Mathematics | Optimization and Control

Alternating projections | Extremal principle | Variational analysis | Linear convergence | Averaged projections | Distance to ill-posedness | Nonconvexity | Metric regularity | Prox-regularity | MATRIX | MATHEMATICS, APPLIED | VARIANTS | DIFFERENTIABILITY | COMPLEXITY THEORY | PROXIMAL POINT ALGORITHM | MATHEMATICS | REGULARITY | COMPUTER SCIENCE, THEORY & METHODS | Mathematical problems | Variance analysis | Algorithms | Mathematics | Optimization and Control

Journal Article

Applied and computational harmonic analysis, ISSN 1063-5203, 2016, Volume 41, Issue 3, pp. 815 - 851

We demonstrate necessary and sufficient conditions of the local convergence of the alternating projection algorithm to a unique solution up to a global phase factor...

Alternating projection | Graph connection Laplacian | Phase retrieval | Phase synchronization | Ptychography | MATHEMATICS, APPLIED | RECONSTRUCTION | RESOLUTION | X-RAY-DIFFRACTION | ELECTRON-DIFFRACTION | COMPUTED-TOMOGRAPHY | RETRIEVAL | Algorithms

Alternating projection | Graph connection Laplacian | Phase retrieval | Phase synchronization | Ptychography | MATHEMATICS, APPLIED | RECONSTRUCTION | RESOLUTION | X-RAY-DIFFRACTION | ELECTRON-DIFFRACTION | COMPUTED-TOMOGRAPHY | RETRIEVAL | Algorithms

Journal Article

Foundations of computational mathematics, ISSN 1615-3383, 2015, Volume 16, Issue 2, pp. 425 - 455

The method of alternating projections is a classical tool to solve feasibility problems...

32B20 | Linear and Multilinear Algebras, Matrix Theory | Mathematics | Tangential intersection | Separable intersection | Subanalytic set | Alternating projections | Gerchbergâ€“Saxton error reduction | Primary: 65K10 | 49J52 | Numerical Analysis | HÃ¶lder regularity | Secondary: 90C30 | Applications of Mathematics | Math Applications in Computer Science | Computer Science, general | Local convergence | Economics, general | 47H04 | FEASIBILITY PROBLEMS | MATHEMATICS, APPLIED | SPACES | ALGORITHM | MATHEMATICS | Gerchberg-Saxton error reduction | REGULARITY | SETS | COMPUTER SCIENCE, THEORY & METHODS | Holder regularity | LOJASIEWICZ INEQUALITY | Fuzzy sets | Set theory | Convergence (Mathematics) | Research | Mathematical research | Convergence | Foundations | Mathematical analysis | Texts | Projection | Feasibility | Mathematical models | Regularity | Optimization and Control

32B20 | Linear and Multilinear Algebras, Matrix Theory | Mathematics | Tangential intersection | Separable intersection | Subanalytic set | Alternating projections | Gerchbergâ€“Saxton error reduction | Primary: 65K10 | 49J52 | Numerical Analysis | HÃ¶lder regularity | Secondary: 90C30 | Applications of Mathematics | Math Applications in Computer Science | Computer Science, general | Local convergence | Economics, general | 47H04 | FEASIBILITY PROBLEMS | MATHEMATICS, APPLIED | SPACES | ALGORITHM | MATHEMATICS | Gerchberg-Saxton error reduction | REGULARITY | SETS | COMPUTER SCIENCE, THEORY & METHODS | Holder regularity | LOJASIEWICZ INEQUALITY | Fuzzy sets | Set theory | Convergence (Mathematics) | Research | Mathematical research | Convergence | Foundations | Mathematical analysis | Texts | Projection | Feasibility | Mathematical models | Regularity | Optimization and Control

Journal Article

IEEE Transactions on Image Processing, ISSN 1057-7149, 08/2010, Volume 19, Issue 8, pp. 2085 - 2098

Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a well-known and influential demosaicking algorithm based upon alternating projections (AP...

Digital images | demosaicking | Pipelines | Laboratories | polyphase representation | contraction mapping | Color | Nonlinear filters | demosaicing | Digital cameras | Computational complexity | Image reconstruction | Alternating projections | color filter array | fixed point | Signal processing algorithms | Iterative algorithms | multirate signal processing | projection onto convex sets (POCS) | FILTER ARRAY INTERPOLATION | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | ENGINEERING, ELECTRICAL & ELECTRONIC | COLOR DEMOSAICKING | Colorimetry - methods | Reproducibility of Results | Algorithms | Numerical Analysis, Computer-Assisted | Image Interpretation, Computer-Assisted - methods | Sensitivity and Specificity | Signal Processing, Computer-Assisted | Image Enhancement - methods | Pattern Recognition, Automated - methods | Technology application | Usage | Image processing | Innovations | Digital filters | Mathematical optimization | Iterative methods (Mathematics) | Studies | Theory | Filtering | Computation | Images | Tools | Projection | Mathematical models | Optimization

Digital images | demosaicking | Pipelines | Laboratories | polyphase representation | contraction mapping | Color | Nonlinear filters | demosaicing | Digital cameras | Computational complexity | Image reconstruction | Alternating projections | color filter array | fixed point | Signal processing algorithms | Iterative algorithms | multirate signal processing | projection onto convex sets (POCS) | FILTER ARRAY INTERPOLATION | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | ENGINEERING, ELECTRICAL & ELECTRONIC | COLOR DEMOSAICKING | Colorimetry - methods | Reproducibility of Results | Algorithms | Numerical Analysis, Computer-Assisted | Image Interpretation, Computer-Assisted - methods | Sensitivity and Specificity | Signal Processing, Computer-Assisted | Image Enhancement - methods | Pattern Recognition, Automated - methods | Technology application | Usage | Image processing | Innovations | Digital filters | Mathematical optimization | Iterative methods (Mathematics) | Studies | Theory | Filtering | Computation | Images | Tools | Projection | Mathematical models | Optimization

Journal Article

Constructive Approximation, ISSN 0176-4276, 12/2013, Volume 38, Issue 3, pp. 489 - 525

...}$ . Under appropriate conditions, we prove not only that the sequence of alternating projections converges, but that the limit point is fairly close to B opt , in a manner relative to the distance âˆ¥B 0âˆ’B opt âˆ¥, thereby significantly improving earlier results in the field.

Alternating projections | Manifolds | 53B25 | Low-rank approximation | Numerical Analysis | Analysis | 41A65 | Mathematics | 49Q99 | Non-convexity | Convergence | MATHEMATICS | MATRIX | COMMON POINT | APPROXIMATION | ALGORITHM | MATLAB SOFTWARE PACKAGE | Algorithms | approximation | Naturvetenskap | Low-rank | Natural Sciences | Matematik

Alternating projections | Manifolds | 53B25 | Low-rank approximation | Numerical Analysis | Analysis | 41A65 | Mathematics | 49Q99 | Non-convexity | Convergence | MATHEMATICS | MATRIX | COMMON POINT | APPROXIMATION | ALGORITHM | MATLAB SOFTWARE PACKAGE | Algorithms | approximation | Naturvetenskap | Low-rank | Natural Sciences | Matematik

Journal Article

Journal of Fourier Analysis and Applications, ISSN 1069-5869, 6/2018, Volume 24, Issue 3, pp. 719 - 758

Alternating projection (AP) of various forms, including the parallel AP (PAP), real-constrained AP (RAP) and the serial AP (SAP...

42B | Phase retrieval | Null initialization | Mathematics | 90C | Abstract Harmonic Analysis | Alternating projections | Mathematical Methods in Physics | Fourier Analysis | Signal,Image and Speech Processing | Spectral gap | 65T | Approximations and Expansions | Local convergence | Partial Differential Equations | MATHEMATICS, APPLIED | RECONSTRUCTION | INJECTIVITY | STABILITY | SIGNAL RECOVERY | ALGORITHMS | MAGNITUDE | FOURIER-TRANSFORM

42B | Phase retrieval | Null initialization | Mathematics | 90C | Abstract Harmonic Analysis | Alternating projections | Mathematical Methods in Physics | Fourier Analysis | Signal,Image and Speech Processing | Spectral gap | 65T | Approximations and Expansions | Local convergence | Partial Differential Equations | MATHEMATICS, APPLIED | RECONSTRUCTION | INJECTIVITY | STABILITY | SIGNAL RECOVERY | ALGORITHMS | MAGNITUDE | FOURIER-TRANSFORM

Journal Article

Mathematical programming, ISSN 1436-4646, 2016, Volume 162, Issue 1-2, pp. 537 - 548

We observe that Sturmâ€™s error bounds readily imply that for semidefinite feasibility problems, the method of alternating projections converges at a rate of $$\mathcal {O}\Big (k^{-\frac{1}{2^{d+1}-2}}\Big )$$ O ( k - 1 2 d + 1 - 2...

Theoretical, Mathematical and Computational Physics | Mathematics | Alternating projections | 49M20 | Mathematical Methods in Physics | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Semi-definite program (SDP) | Numerical Analysis | 90C22 | Error bounds | 65K10 | Combinatorics | Linear matrix inequality (LMI) | Regularity | Sublinear convergence | MATHEMATICS, APPLIED | OPTIMIZATION PROBLEMS | FACIAL REDUCTION | ALGORITHMS | CONVEX-OPTIMIZATION | COMPUTER SCIENCE, SOFTWARE ENGINEERING | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PROGRAMS | SETS | Studies | Semidefinite programming | Mathematical programming

Theoretical, Mathematical and Computational Physics | Mathematics | Alternating projections | 49M20 | Mathematical Methods in Physics | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Semi-definite program (SDP) | Numerical Analysis | 90C22 | Error bounds | 65K10 | Combinatorics | Linear matrix inequality (LMI) | Regularity | Sublinear convergence | MATHEMATICS, APPLIED | OPTIMIZATION PROBLEMS | FACIAL REDUCTION | ALGORITHMS | CONVEX-OPTIMIZATION | COMPUTER SCIENCE, SOFTWARE ENGINEERING | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PROGRAMS | SETS | Studies | Semidefinite programming | Mathematical programming

Journal Article

Numerical Algorithms, ISSN 1017-1398, 8/2016, Volume 72, Issue 4, pp. 1021 - 1042

.... Of the available methods with guaranteed convergence to the unique solution of this problem the easiest to implement, and perhaps the most widely used, is the alternating projections method...

Nearest correlation matrix | Numeric Computing | Theory of Computation | Algorithms | Algebra | 15A57 | Numerical Analysis | 65F30 | Computer Science | Alternating projections method | Anderson acceleration | Dykstraâ€™s correction | Positive semidefinite matrix | Indefinite matrix | CONVERGENCE ACCELERATION | MATHEMATICS, APPLIED | ALGORITHM | Dykstra's correction | INVERSE

Nearest correlation matrix | Numeric Computing | Theory of Computation | Algorithms | Algebra | 15A57 | Numerical Analysis | 65F30 | Computer Science | Alternating projections method | Anderson acceleration | Dykstraâ€™s correction | Positive semidefinite matrix | Indefinite matrix | CONVERGENCE ACCELERATION | MATHEMATICS, APPLIED | ALGORITHM | Dykstra's correction | INVERSE

Journal Article

Numerical Algorithms, ISSN 1017-1398, 9/2016, Volume 73, Issue 1, pp. 33 - 76

We systematically study the optimal linear convergence rates for several relaxed alternating projection methods and the generalized Douglas-Rachford splitting methods for finding the projection...

Principal angle | Generalized Douglas-Rachford method | Secondary 65F15, 65B05, 15A18, 90C25, 41A25 | Numeric Computing | Theory of Computation | Friedrichs angle | Convergent and semi-convergent matrix | Relaxed alternating projection method | Linear convergence | Algorithms | Algebra | Numerical Analysis | Primary 65F10, 65K05 | Computer Science | CONVEX FEASIBILITY PROBLEMS | MATHEMATICS, APPLIED | ALGORITHMS | ANGLES | SYSTEMS | ITERATIVE METHODS | SINGULAR MATRICES | OPERATORS | Matrices (mathematics) | Mathematical analysis | Eigenvalues | Projection | Subspaces | Matrix methods | Optimization | Convergence

Principal angle | Generalized Douglas-Rachford method | Secondary 65F15, 65B05, 15A18, 90C25, 41A25 | Numeric Computing | Theory of Computation | Friedrichs angle | Convergent and semi-convergent matrix | Relaxed alternating projection method | Linear convergence | Algorithms | Algebra | Numerical Analysis | Primary 65F10, 65K05 | Computer Science | CONVEX FEASIBILITY PROBLEMS | MATHEMATICS, APPLIED | ALGORITHMS | ANGLES | SYSTEMS | ITERATIVE METHODS | SINGULAR MATRICES | OPERATORS | Matrices (mathematics) | Mathematical analysis | Eigenvalues | Projection | Subspaces | Matrix methods | Optimization | Convergence

Journal Article

Linear algebra and its applications, ISSN 0024-3795, 10/2020, Volume 603, pp. 41 - 56

We investigate connections between the geometry of linear subspaces and the convergence of the alternating projection method for linear projections...

Alternating projection method | Principal angles | Oppenheim angle | Linear projections | Mathematics - Functional Analysis

Alternating projection method | Principal angles | Oppenheim angle | Linear projections | Mathematics - Functional Analysis

Journal Article

IEEE Transactions on Image Processing, ISSN 1057-7149, 04/2005, Volume 14, Issue 4, pp. 461 - 474

A technique for block-loss restoration in block-based image and video coding, dubbed recovery of image blocks using the method of alternating projections (RIBMAP), is developed...

Video coding | projections | MPEG | PSNR | block-loss recovery | Vectors | JPEG | Image restoration | Data mining | Sun | image and video transmission | Alternating projections | Interpolation | Signal restoration | error concealment | Hilbert space | Libraries | projections onto convex sets (POCS) | Error concealment | Projections onto convex sets (POCS) | Projections | Block-loss recovery | Image and video transmission | alternating projections | RECONSTRUCTION | CODED IMAGES | CONVEX-SETS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | ENGINEERING, ELECTRICAL & ELECTRONIC | CONCEALMENT | CONSTRAINTS | Computer Graphics | Reproducibility of Results | Algorithms | Information Storage and Retrieval - methods | Numerical Analysis, Computer-Assisted | Artificial Intelligence | Image Interpretation, Computer-Assisted - methods | Sensitivity and Specificity | Signal Processing, Computer-Assisted | Image Enhancement - methods | Pattern Recognition, Automated - methods | Image coding | Methods | Error recovery

Video coding | projections | MPEG | PSNR | block-loss recovery | Vectors | JPEG | Image restoration | Data mining | Sun | image and video transmission | Alternating projections | Interpolation | Signal restoration | error concealment | Hilbert space | Libraries | projections onto convex sets (POCS) | Error concealment | Projections onto convex sets (POCS) | Projections | Block-loss recovery | Image and video transmission | alternating projections | RECONSTRUCTION | CODED IMAGES | CONVEX-SETS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | ENGINEERING, ELECTRICAL & ELECTRONIC | CONCEALMENT | CONSTRAINTS | Computer Graphics | Reproducibility of Results | Algorithms | Information Storage and Retrieval - methods | Numerical Analysis, Computer-Assisted | Artificial Intelligence | Image Interpretation, Computer-Assisted - methods | Sensitivity and Specificity | Signal Processing, Computer-Assisted | Image Enhancement - methods | Pattern Recognition, Automated - methods | Image coding | Methods | Error recovery

Journal Article

Journal of Knot Theory and Its Ramifications, ISSN 0218-2165, 06/2012, Volume 21, Issue 7, pp. 1250069 - 1250017

The paper addresses the enumeration problem for k-tangles. We introduce the notion of a cascade diagram of a k-tangle projection and suggest an effective enumeration algorithm for projections based on the cascade representation...

MATHEMATICS | Tangles | LINKS | CLASSIFICATION | alternating tangles | PRIME ALTERNATING KNOTS | k-tangle enumeration | Algorithms | Pictures | Enumeration | Cascades | Projection | Knot theory | Representations

MATHEMATICS | Tangles | LINKS | CLASSIFICATION | alternating tangles | PRIME ALTERNATING KNOTS | k-tangle enumeration | Algorithms | Pictures | Enumeration | Cascades | Projection | Knot theory | Representations

Journal Article

JOURNAL OF CONVEX ANALYSIS, ISSN 0944-6532, 2016, Volume 23, Issue 3, pp. 823 - 847

We study the usage of regularity properties of collections of sets in convergence analysis of alternating projection methods for solving feasibility problems...

Alternating projections | MATHEMATICS | subdifferential | normal cone | DIFFERENTIABILITY | STATIONARITY | uniform regularity

Alternating projections | MATHEMATICS | subdifferential | normal cone | DIFFERENTIABILITY | STATIONARITY | uniform regularity

Journal Article

Optics and lasers in engineering, ISSN 0143-8166, 2019, Volume 121, pp. 96 - 103

....â€¢The proposed method is aimed at the retrieval of high-resolution phase pattern.â€¢The proposed method is based on a hybrid of PhaseCut and alternating projection...

Alternating projection | PhaseCut | Diffraction intensity | Phase retrieval | Extrapolative method | RECOVERY | RECONSTRUCTION | ALGORITHM | OPTICS | Algorithms | Numerical analysis | Mechanical engineering | Methods

Alternating projection | PhaseCut | Diffraction intensity | Phase retrieval | Extrapolative method | RECOVERY | RECONSTRUCTION | ALGORITHM | OPTICS | Algorithms | Numerical analysis | Mechanical engineering | Methods

Journal Article

18.
Full Text
A new projection method for finding the closest point in the intersection of convex sets

Computational optimization and applications, ISSN 1573-2894, 2017, Volume 69, Issue 1, pp. 99 - 132

In this paper we present a new iterative projection method for finding the closest point in the intersection of convex sets to any arbitrary point in a Hilbert space...

Convex set | Projection | Mathematics | Reflection | Statistics, general | Best approximation problem | Optimization | Nonexpansive mapping | 90C25 | Operations Research/Decision Theory | Convex and Discrete Geometry | Douglasâ€“Rachford algorithm | 47H09 | Operations Research, Management Science | 47N10 | Feasibility problem | Douglas | Rachford algorithm | MATHEMATICS, APPLIED | NONEXPANSIVE-MAPPINGS | APPROXIMATION | FEASIBILITY | LINEAR CONVERGENCE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Douglas-Rachford algorithm | REGULARITY | HILBERT-SPACE | ALTERNATING PROJECTIONS | OPERATORS | FIXED-POINTS | Methods | Algorithms | Hilbert space | Convexity | Subspaces | Iterative methods | Internet telephony | Convergence | Mathematics - Optimization and Control

Convex set | Projection | Mathematics | Reflection | Statistics, general | Best approximation problem | Optimization | Nonexpansive mapping | 90C25 | Operations Research/Decision Theory | Convex and Discrete Geometry | Douglasâ€“Rachford algorithm | 47H09 | Operations Research, Management Science | 47N10 | Feasibility problem | Douglas | Rachford algorithm | MATHEMATICS, APPLIED | NONEXPANSIVE-MAPPINGS | APPROXIMATION | FEASIBILITY | LINEAR CONVERGENCE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Douglas-Rachford algorithm | REGULARITY | HILBERT-SPACE | ALTERNATING PROJECTIONS | OPERATORS | FIXED-POINTS | Methods | Algorithms | Hilbert space | Convexity | Subspaces | Iterative methods | Internet telephony | Convergence | Mathematics - Optimization and Control

Journal Article

Journal of Optimization Theory and Applications, ISSN 0022-3239, 7/2015, Volume 166, Issue 1, pp. 213 - 233

... (that is, splitting nature) together with a linear constraint. We propose a relaxed projection method, which fully exploits the splitting structure of split variational inequality...

65K15 | Split variational inequality | Mathematics | Theory of Computation | Monotone operator | Split feasibility problem | Optimization | Projection method | Calculus of Variations and Optimal Control; Optimization | 90C25 | Operations Research/Decision Theory | 49J40 | Applications of Mathematics | Engineering, general | Separable structure | 47J25 | FIXED-POINT PROBLEM | MATHEMATICS, APPLIED | FEASIBILITY PROBLEM | ALGORITHM | ITERATIVE METHOD |

65K15 | Split variational inequality | Mathematics | Theory of Computation | Monotone operator | Split feasibility problem | Optimization | Projection method | Calculus of Variations and Optimal Control; Optimization | 90C25 | Operations Research/Decision Theory | 49J40 | Applications of Mathematics | Engineering, general | Separable structure | 47J25 | FIXED-POINT PROBLEM | MATHEMATICS, APPLIED | FEASIBILITY PROBLEM | ALGORITHM | ITERATIVE METHOD |