Circumcentering approximate reflections for solving the convex feasibility problem
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2730-5422
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
-
Araújo, G. H. M.
Arefidamghani, R.
Behling, R.
Bello-Cruz, Y.
Iusem, A.
Santos, L.-R
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1186/s13663-021-00711-6
- URN
-
urn:nbn:de:101:1-2022042122030318599980
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:33 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Araújo, G. H. M.
- Arefidamghani, R.
- Behling, R.
- Bello-Cruz, Y.
- Iusem, A.
- Santos, L.-R
- SpringerLink (Online service)
Ähnliche Objekte (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