Algorithms in Nonsmooth Optimization
A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Algorithms for Multidisciplinary Applications".
Deadline for manuscript submissions: 30 November 2024 | Viewed by 78
Special Issue Editor
Interests: convex analysis; convex optimization; monotone operators; vector optimization
Special Issues, Collections and Topics in MDPI journals
Special Issue Information
Dear Colleagues,
In this Special Issue of Algorithms, we welcome contributions presenting and/or analyzing iterative methods for solving nonsmooth optimization problems and real-life applications that can be modeled in this way. A preference is given to splitting proximal point type methods and improvements of existing ones as well as iterative procedures for solving convex and nonconvex optimization problems where the involved functions lack differentiability. However, submissions on other types of iterative methods for solving nonsmooth optimization problems are welcome as well. In particular, extensions to multiobjective and vector optimization of known algorithms from scalar optimization are of special interest. Iterative methods for solving monotone inclusions, variational inequalities and equilibrium problems involving nonsmooth functions as well as continuous versions of proximal point type algorithms by means of dynamical systems and differential inclusions will also be considered. The proposed algorithms are expected to be illustrated by means of computational results; however, theoretical schemes of potential high interest can be accepted for publication as well as those hinting toward possible implementation approaches. Possible applications of the proposed iterative methods can be found in fields such as artificial intelligence, machine learning, location and logistics, game theory, image processing, etc.
Dr. Sorin-Mihai Grad
Guest Editor
Manuscript Submission Information
Manuscripts should be submitted online at mdpi.longhoe.net by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Keywords
- proximal point method
- convex optimization problem
- nonsmooth optimization problem
- splitting technique
- image processing
- machine learning
- stochastic proximal algorithm
- location theory
- game theory
