COMPUTATIONAL OPTIMIZATION AND APPLICATIONS - Journal - Bridge of Knowledge

Your account

login

Search

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

ISSN:

0926-6003

eISSN:

1573-2894

Disciplines
(Field of Science):

  • architecture and urban planning (Engineering and Technology)
  • automation, electronics, electrical engineering and space technologies (Engineering and Technology)
  • information and communication technology (Engineering and Technology)
  • mechanical engineering (Engineering and Technology)
  • family studies (Family studies)
  • economics and finance (Social studies)
  • management and quality studies (Social studies)
  • international relations (Social studies)
  • computer and information sciences (Natural sciences)
  • mathematics (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 100 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 100 Ministry scored journals list 2024
2023 100 Ministry Scored Journals List
2022 100 Ministry Scored Journals List 2019-2022
2021 100 Ministry Scored Journals List 2019-2022
2020 100 Ministry Scored Journals List 2019-2022
2019 100 Ministry Scored Journals List 2019-2022
2018 35 A
2017 35 A
2016 35 A
2015 30 A
2014 30 A
2013 35 A
2012 35 A
2011 35 A
2010 27 A

Model:

Hybrid

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2022 3.4
Points CiteScore - previous years
Year Points
2022 3.4
2021 3.4
2020 3.5
2019 3.4
2018 2.8
2017 3.1
2016 3
2015 3
2014 2.7
2013 2.8
2012 2.8
2011 2.9

Impact Factor:

Log in to see the Impact Factor.

Sherpa Romeo:

https://v2.sherpa.ac.uk/id/publication/17176

Papers published in journal

Filters

total: 1

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2018
  • Proximal primal–dual best approximation algorithm with memory
    Publication

    - COMPUTATIONAL OPTIMIZATION AND APPLICATIONS - Year 2018

    We propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...

    Full text available to download

seen 121 times