Journal of Optimization Theory and Applications

Scope/Rationale:
In the past decades, copositivity gained popularity as a key concept for optimization, which can handle nonconvex, mixed-integer and polynomial optimization problems. On occasion of the 75th anniversary of copositivity (2027), we are aiming to cover the area in a comprehensive and concise way and expect this collection to become a major reference source for researchers and teachers in mathematics, computer science, engineering and economics. The purpose of this collection is manifold: to collect as many reliable historical facts about the early days of copositivity as possible, to present an overview of the diverse streams of research since then, and to provide an up-to-date survey of recent advances and future perspectives, with a scope as comprehensive as possible. In particular, we welcome submissions focusing on computationally tractable procedures, involving ideas from copositivity.


Tentative Schedule
Announcement Date: 1 March 2025                
Submission deadline: 31 March 2026                
First Round of Reviews: 30 September 2026            
Targeted Publication Date: 15 June 2027                

Guest Editors
Petra Renáta Rigó (Lead Guest Editor)  petra.rigo@uni-corvinus.hu
Immanuel Bomze immanuel.bomze@univie.ac.at
Mirjam Dür mirjam.duer@math.uni-augsburg.de
Marianna E.-Nagy marianna.eisenberg-nagy@uni-corvinus.hu
Tibor Illés illes@math.bme.hu

Note:  The issue will be based on invitation of selected contributors.
           Other submissions will be rejected or transferred to regular submissions.

Prof. Q. H. Ansari’s work significantly advances the fields of optimization, variational inequalities, and game theory, with particular contributions to non-smooth analysis, convex analysis, and fixed-point theory. 

His research has broad applications in economics, engineering, and applied mathematics, addressing both theoretical challenges and practical problems in these domains. The scope of his work spans vector optimization, set optimization, equilibrium problems, and abstract economies, making a profound impact on optimization theory and its interdisciplinary applications.

Honoring his work through this special issue acknowledges his impactful legacy and encourages further advancements in optimization and its diverse applications. The proposed special issue would focus on cutting-edge research in areas closely aligned with Prof. Ansari’s interests, including but not limited to:

• Variational Inequalities
• Nonsmooth Optimization
• Generalized Convexity and Monotonicity
• Fixed Point Theory and Applications
• Vector Optimization
• Set Optimization
• Applications of Optimization in Machine Learning and Engineering

Guest Editors:
Prof. Jen-Chih Yao, China Medical University, Taichung, Taiwan
         Email:   yaojc@math.nsysu.edu.tw
Prof. Hong-Kun Xu, Hangzhou Dianzi University, Hangzhou, China
         Email:    xuhk@hdu.edu.cn
 

Announcement Date: October 15, 2024                                          

Submission deadline: March 15, 2025

Scope:
In recent decades, researchers have increasingly tackled with optimization challenges that defy resolution through conventional convex or monotonic frameworks, in view of applications in science, engineering and other disciplines. Consequently, novel methodologies are emerging in nonsmooth, variational, and convex analysis. This special issue aims to publish original high-quality papers centered around the broad area of convexity, monotonicity and their extensions, and variational analysis, in and beyond optimization. Thus, it sheds new light on classical results and opens new approaches to face ‘‘nonconvex problems’’ in both theoretical and practical scenarios. Some of the papers collected in the special issue will be presented at the XIV International Symposium on Generalized Convexity and Monotonicity, to be held on September 2-6, 2024, in Pisa, Italy. So that, other researchers working in the area will also be welcome to contribute.
 

Contributions may include, but are not limited to the following topics:
* Algorithms for fixed point, (quasi-) variational inequality and optimization problems;
* Quadratic optimization problems;
* (Quasi-) Variational inequalities, equilibrium problems and related topics;
* Robust optimization;
* Set optimization;
* Vector optimization.

Guest Editors:
Riccardo Cambini, University of Pisa, riccardo.cambini@unipi.it
Fabian Flores-Bazan, University of Concepcion, faflores@udec.cl
Nicolas Hadjisavvas, University of the Aegean, nhad@aegean.gr
Rita Pini, University of Milano – Bicocca, rita.pini@unimib.it

Timing:
Submission deadline: March 31,  2025
Targeted Publication Date: December 2025
 

Computational optimization plays a pivotal role in contemporary artificial intelligence (AI) research and development, becoming an essential tool for enhancing the efficiency and performance of these systems. As the volume of data and the complexity of AI algorithms continue to grow, the ability to optimally allocate computational resources, minimize processing time and energy consumption, and improve the quality of modeling and predictions becomes critically important. Therefore, investigating and developing new methods of computational optimization directly impacts the pace of scientific progress in the AI field and facilitates the broader implementation of artificial intelligence technologies across various aspects of life.

Submission deadline:   31 December  2024

Guest editors:
Roland Hildebrand (Univ. Grenoble Alpes, CNRS, Grenoble)
Engeny Burnaev (Skolkovo Institute of Science and Technology, Russia) 
Martin Takac (MBZUAI )
Alexander Gasnikov (Moscow institute of Physics and Technology)