Skip to main content
Fixed Point Theory and Algorithms for Sciences and Engineering
Fixed Point Theory and Algorithms for Sciences and Engineering Cover Image

Optimization and Real World Applications

Fixed Point Theory and Algorithms for Sciences and Engineering welcomes submissions to the Topical Collection on “Optimization and Real World Applications” edited by Heinz Bauschke (University of British Columbia, Canada), Yunier Bello-Cruz (Northern Illinois University, USA), Radu Ioan Bot (University of Vienna, Austria), Robert Csetnek (University of Vienna, Austria), and Alexander Zaslavski (Israel Institute of Technology, Israel), which covers a wide variety of topics concerning optimization problems and their applications. 

These include (but are not limited to) 
- smooth and nonsmooth optimization problems (theory and numerical methods), 
- monotone operators and nonexpansive mappings,
- real world applications in 
                    - machine learning,
                    - image/signal processing,
                    - data classification,
                    - scientific computing
and other areas.

The collection will close for submissions on December 31st, 2023. 

Articles will undergo the journal’s standard peer-review process and are subject to all of the journal’s standard policies, including those pertaining to Collections. Articles will be added to the Collection as they are published.

Click the link below to download the PDF with all information on one page:

TC Optimization and Real World Applications


  1. A convex fair partition of a convex polygonal region is defined as a partition on which all regions are convex and have equal area and equal perimeter. The existence of such a partition for any number of regio...

    Authors: Mathilda Campillo, Maria D. Gonzalez-Lima and Bernardo Uribe
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2024 2024:13
    Content type: Research Published on:

  2. In this paper, some fixed-point theorems are stated and proved in S-multiplicative metric spaces. We also show in this paper that some fixed-point results for various S-multiplicative metric spaces are equivalent...

    Authors: Olusola Kayode Adewale, Samuel Olusola Ayodele, Babatunde Eriwa Oyelade and Emmanuella Ehui Aribike
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2024 2024:1
    Content type: Research Published on:

  3. We develop a novel randomised block-coordinate primal-dual algorithm for a class of non-smooth ill-posed convex programs. Lying midway between the celebrated Chambolle–Pock primal-dual algorithm and Tseng’s ac...

    Authors: Mathias Staudigl and Paulin Jacquot
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2023 2023:14
    Content type: Research Published on:

  5. In this paper, we introduce a new iterative forward–backward splitting algorithm with errors for solving the split monotone variational inclusion problem of the sum of two monotone operators in real Hilbert sp...

    Authors: Pattanapong Tianchai
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2023 2023:5
    Content type: Research Published on:

  6. In this work, we study a self-adaptive extragradient algorithm for approximating a common solution of a pseudomonotone equilibrium problem and fixed-point problem for multivalued nonexpansive mapping in Hadama...

    Authors: Kazeem Olalekan Aremu, Lateef Olakunle Jolaoso and Olawale Kazeem Oyewole
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2023 2023:4
    Content type: Research Published on:

  7. In this paper, a Halpern–Tseng-type algorithm for approximating zeros of the sum of two monotone operators whose zeros are J-fixed points of relatively J-nonexpansive mappings is introduced and studied. A strong ...

    Authors: Abubakar Adamu, Poom Kumam, Duangkamon Kitkuan and Anantachai Padcharoen
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2023 2023:3
    Content type: Research Published on:

  8. The circumcentered-reflection method (CRM) has been applied for solving convex feasibility problems. CRM iterates by computing a circumcenter upon a composition of reflections with respect to convex sets. Sinc...

    Authors: G. H. M. Araújo, R. Arefidamghani, R. Behling, Y. Bello-Cruz, A. Iusem and L.-R. Santos
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2022 2022:1
    Content type: Research Published on:

  9. Many iterative optimization algorithms involve compositions of special cases of Lipschitz continuous operators, namely firmly nonexpansive, averaged, and nonexpansive operators. The structure and properties of...

    Authors: Pontus Giselsson and Walaa M. Moursi
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:25
    Content type: Research Published on:

  10. In 1990, Romero presented a beautiful formula for the projection onto the set of rectangular matrices with prescribed row and column sums. Variants of Romero’s formula were rediscovered by Khoury and by Glunt,...

    Authors: Heinz H. Bauschke, Shambhavi Singh and Xianfu Wang
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:23
    Content type: Research Published on:

  11. Inverse problems consist of recovering a signal from a collection of noisy measurements. These problems can often be cast as feasibility problems; however, additional regularization is typically necessary to e...

    Authors: Howard Heaton, Samy Wu Fung, Aviv Gibali and Wotao Yin
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:21
    Content type: Research Published on:

  12. By the first welfare theorem, competitive market equilibria belong to the core and hence are Pareto optimal. Letting money be a commodity, this paper turns these two inclusions around. More precisely, by generali...

    Authors: Sjur Didrik Flåm
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:20
    Content type: Research Published on:

  14. Splitting algorithms for finding a zero of sum of operators often involve multiple steps which are referred to as forward or backward steps. Forward steps are the explicit use of the operators and backward ste...

    Authors: Minh N. Dao and Hung M. Phan
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:16
    Content type: Research Published on:

  15. It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the pot...

    Authors: Regina S. Burachik, Bethany I. Caldwell and C. Yalçın Kaya
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:15
    Content type: Research Published on:

  16. In this paper, we use a robust lower directional derivative and provide some sufficient conditions to ensure the strong regularity of a given mapping at a certain point. Then, we discuss the Hoffman estimation an...

    Authors: Malek Abbasi and Michel Théra
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:14
    Content type: Research Published on:

  18. We explore a new approach for training neural networks where all loss functions are replaced by hard constraints. The same approach is very successful in phase retrieval, where signals are reconstructed from m...

    Authors: Veit Elser
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:12
    Content type: Research Published on:

  19. This paper proposes a stochastic approximation method for solving a convex stochastic optimization problem over the fixed point set of a quasinonexpansive mapping. The proposed method is based on the existing ...

    Authors: Hideaki Iiduka
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:10
    Content type: Research Published on:

  20. String-averaging is an algorithmic structure used when handling a family of operators in situations where the algorithm in hand requires to employ the operators in a specific order. Sequential orderings are we...

    Authors: Yair Censor and Ariel Nisenbaum
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:9
    Content type: Research Published on:

  21. We propose Tseng’s extragradient methods for finding a solution of variational inequality problems associated with pseudomonotone vector fields in Hadamard manifolds. Under standard assumptions such as pseudom...

    Authors: Konrawut Khammahawong, Poom Kumam, Parin Chaipunya and Somyot Plubtieng
    Citation: Fixed Point Theory and Algorithms for Sciences and Engineering 2021 2021:5
    Content type: Research Published on:
Submit manuscript

Annual Journal Metrics

  • Citation Impact 2023
    Source Normalized Impact per Paper (SNIP): 0.832
    SCImago Journal Rank (SJR): 0.408

    Speed 2023
    Submission to first editorial decision (median days): 21
    Submission to acceptance (median days): 200

    Usage 2023
    Downloads: 350,104
    Altmetric mentions: 1

  • ISSN: 2730-5422 (electronic)