X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (2961) 2961
Conference Proceeding (151) 151
Newspaper Article (33) 33
Book Chapter (29) 29
Book / eBook (20) 20
Publication (5) 5
Dissertation (4) 4
Government Document (2) 2
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics, applied (1815) 1815
optimization (1696) 1696
mathematics (1513) 1513
algorithms (1295) 1295
operations research & management science (1229) 1229
convex and discrete geometry (708) 708
studies (687) 687
operations research/decision theory (643) 643
analysis (637) 637
convergence (632) 632
mathematical models (524) 524
mathematical analysis (494) 494
statistics, general (464) 464
algorithm (370) 370
operation research/decision theory (349) 349
theory of computation (349) 349
combinatorics (346) 346
methods (342) 342
convex optimization (336) 336
computer science (256) 256
convexity (254) 254
convex analysis (252) 252
feasibility (244) 244
operations research, mathematical programming (241) 241
approximation (239) 239
operations research, management science (233) 233
engineering, electrical & electronic (231) 231
applications of mathematics (226) 226
iterative methods (223) 223
calculus of variations and optimal control; optimization (222) 222
computer science, interdisciplinary applications (221) 221
computer science, software engineering (214) 214
mathematical optimization (210) 210
projection (203) 203
linear programming (201) 201
numerical analysis (199) 199
mathematical modeling and industrial mathematics (192) 192
automation & control systems (191) 191
convex programming (189) 189
mathematical programming (189) 189
nonlinear programming (180) 180
minimization (172) 172
convex feasibility problem (163) 163
90c25 (149) 149
constraints (149) 149
systems (149) 149
computation (146) 146
computational geometry (143) 143
inequalities (143) 143
mathematical methods in physics (141) 141
operators (138) 138
research (138) 138
hilbert space (137) 137
usage (137) 137
mathematics of computing (136) 136
mathematics, general (135) 135
convex functions (133) 133
engineering, general (123) 123
global optimization (120) 120
design (117) 117
applied mathematics (115) 115
convex feasibility (114) 114
mathematics - optimization and control (114) 114
convex (113) 113
computer science, general (112) 112
operations research (112) 112
robustness (110) 110
decomposition (109) 109
computer simulation (107) 107
theoretical, mathematical and computational physics (107) 107
uncertainty (106) 106
convex feasibility problems (102) 102
quadratic programming (101) 101
iterative algorithms (100) 100
engineering (97) 97
theorems (97) 97
semidefinite programming (96) 96
complexity (94) 94
integer programming (93) 93
stability (93) 93
regularization (91) 91
polynomials (90) 90
management science (89) 89
real functions (88) 88
sets (85) 85
65k05 (84) 84
banach space (84) 84
electrical engineering (81) 81
programming (81) 81
economic models (80) 80
economics / management science (79) 79
engineering, multidisciplinary (79) 79
mapping (77) 77
nonexpansive-mappings (77) 77
mathematics, interdisciplinary applications (75) 75
convex-optimization (71) 71
duality (71) 71
programs (71) 71
projection methods (70) 70
90c30 (68) 68
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (3196) 3196
Japanese (12) 12
Chinese (3) 3
French (2) 2
Portuguese (2) 2
Spanish (2) 2
German (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Computers and Operations Research, ISSN 0305-0548, 03/2020, Volume 115, p. 104724
Journal Article
SIAM Review, ISSN 0036-1445, 9/1996, Volume 38, Issue 3, pp. 367 - 426
Journal Article
Numerical Algorithms, ISSN 1017-1398, 8/2016, Volume 72, Issue 4, pp. 835 - 864
The purpose of this paper is to study split feasibility problems and fixed point problems concerning left Bregman strongly relatively nonexpansive mappings in p-uniformly convex and uniformly smooth Banach spaces... 
Strong convergence | Uniformly smooth | Numeric Computing | Theory of Computation | Left Bregman strongly nonexpansive mappings | Split feasibility problem | Fixed point problem | Algorithms | Algebra | 49J53 | 90C25 | Numerical Analysis | Computer Science | 65K10 | 49M37 | Uniformly convex | PROJECTION | MATHEMATICS, APPLIED | NONEXPANSIVE OPERATORS | THEOREMS | SETS | CQ ALGORITHM
Journal Article
Inverse Problems, ISSN 0266-5611, 08/2004, Volume 20, Issue 4, pp. 1261 - 1266
.... The split feasibility problem (SFP) is to find x is an element of C with Ax is an element of Q, if such x exists... 
VARIATIONAL-INEQUALITIES | PROJECTION | MATHEMATICS, APPLIED | CONVEX-SETS | PHYSICS, MATHEMATICAL | INEXACT NEWTON METHODS
Journal Article
Fixed Point Theory and Applications, ISSN 1687-1820, 12/2015, Volume 2015, Issue 1, pp. 1 - 18
In this paper, our aim is to introduce a viscosity type algorithm for solving proximal split feasibility problems and prove the strong convergence of the sequences generated by our iterative schemes in Hilbert spaces... 
Moreau-Yosida approximate | Mathematical and Computational Biology | proximal split feasibility problems | Hilbert spaces | Mathematics | Topology | strong convergence | 49J53 | 90C25 | Analysis | Mathematics, general | 65K10 | Applications of Mathematics | 49M37 | Differential Geometry | prox-regularity | MATHEMATICS | PROJECTION | SET | CONVEX | CQ ALGORITHM | Usage | Convergence (Mathematics) | Hilbert space | Iterative methods (Mathematics) | Operators | Algorithms | Mathematical analysis | Norms | Feasibility | Mathematical models | Iterative methods | Convergence
Journal Article
Computational Optimization and Applications, ISSN 0926-6003, 04/2012, Volume 51, Issue 3, pp. 1065 - 1088
.... It is shown that they often have a computational advantage over alternatives that have been proposed for solving the same problem and that this makes them successful in many real-world applications... 
Linear inequalities | Sparse matrices | Numerical evaluation | Optimization | Projection methods | Convex feasibility problems | MATHEMATICS, APPLIED | SET | BEHAVIOR | IMAGE-RECONSTRUCTION | RESTORATION | ALGORITHMS | RECOVERY | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | FIXED-POINTS | STRONG-CONVERGENCE | SPARSE SYSTEMS | Computer science | Censorship | Analysis | Methods | Studies | Patents | Effectiveness | Computation | Inequalities | Projection | Feasibility | Dealing
Journal Article
Inverse Problems, ISSN 0266-5611, 10/2005, Volume 21, Issue 5, pp. 1791 - 1799
.... The split feasibility problem (SFP) is to find x is an element of C with Ax is an element of Q, if such points exist... 
VARIATIONAL-INEQUALITIES | PROJECTION | MATHEMATICS, APPLIED | CONVEX-SETS | ALGORITHMS | PHYSICS, MATHEMATICAL
Journal Article