Circumcentering approximate reflections for solving the convex feasibility problem
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2730-5422
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Circumcentering approximate reflections for solving the convex feasibility problem ; volume:2022 ; number:1 ; day:4 ; month:1 ; year:2022 ; pages:1-30 ; date:12.2022
Fixed point theory and algorithms for sciences and engineering ; 2022, Heft 1 (4.1.2022), 1-30, 12.2022
- Creator
-
Araújo, G. H. M.
Arefidamghani, R.
Behling, R.
Bello-Cruz, Y.
Iusem, A.
Santos, L.-R
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1186/s13663-021-00711-6
- URN
-
urn:nbn:de:101:1-2022042122030318599980
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:33 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Araújo, G. H. M.
- Arefidamghani, R.
- Behling, R.
- Bello-Cruz, Y.
- Iusem, A.
- Santos, L.-R
- SpringerLink (Online service)
Other Objects (12)
Approximate fixed points of generalized convex contractions
Convex functions and approximate Birkhoff–James orthogonality
ON APPROXIMATE: SOLVING OF THE FOURIER PROBLEMS
Convex Feasibility via Monotropic Programming
Convergence theorems of subgradient extragradient algorithm for solving variational inequalities and a convex feasibility problem
Stability of ε-approximate solutions to convex stochastic programs
Solving multiobjective mixed integer convex optimization problems
Solving animal model equations through an approximate incomplete Cholesky decomposition
Regularity and Stability for a Convex Feasibility Problem
A projection-free method for solving convex bilevel optimization problems
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Approximate Methods for Solving Chance-Constrained Linear Programs in Probability Measure Space
Approximate fixed points of generalized convex contractions
Convex functions and approximate Birkhoff–James orthogonality
ON APPROXIMATE: SOLVING OF THE FOURIER PROBLEMS
Convex Feasibility via Monotropic Programming
Convergence theorems of subgradient extragradient algorithm for solving variational inequalities and a convex feasibility problem
Stability of ε-approximate solutions to convex stochastic programs
Solving multiobjective mixed integer convex optimization problems
Solving animal model equations through an approximate incomplete Cholesky decomposition
Regularity and Stability for a Convex Feasibility Problem
A projection-free method for solving convex bilevel optimization problems
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Approximate Methods for Solving Chance-Constrained Linear Programs in Probability Measure Space
Approximate fixed points of generalized convex contractions
Convex functions and approximate Birkhoff–James orthogonality
ON APPROXIMATE: SOLVING OF THE FOURIER PROBLEMS
Convex Feasibility via Monotropic Programming
Convergence theorems of subgradient extragradient algorithm for solving variational inequalities and a convex feasibility problem
Stability of ε-approximate solutions to convex stochastic programs
Solving multiobjective mixed integer convex optimization problems
Solving animal model equations through an approximate incomplete Cholesky decomposition
Regularity and Stability for a Convex Feasibility Problem
A projection-free method for solving convex bilevel optimization problems
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling