Nonlinear Convex Analysis and Optimization: An International Journal on Numerical, Computation and Applications
https://bangmodjmcs.com/index.php/ncao
<p><strong>NCAO </strong>is a peer-reviewed, open-access international journal, that devotes to the publication of original articles of current interest in every theoretical, fixed point theory, numerical optimization, and optimization technique and their applications to science and engineering. All manuscripts are refereed under the same standards as those used by the finest-quality printed mathematical journals. Accepted papers will be published online in their final form as an NCAO formatted PDF. and will be published in two issues annually in June and December.</p>TaCS-CoE & CaRE Networken-USNonlinear Convex Analysis and Optimization: An International Journal on Numerical, Computation and Applications 2822-0064<p><strong>Open Access Policy</strong></p> <p>This journal provides immediate open access to its content on the principle that making research freely available to the public.</p> <figure class="wp-block-image size-large is-resized"><img class="wp-image-433" tabindex="0" role="button" src="https://ncao.design.blog/wp-content/uploads/2022/02/messageimage_1644940561501-1.jpg?w=808" sizes="(max-width: 342px) 100vw, 342px" srcset="https://ncao.design.blog/wp-content/uploads/2022/02/messageimage_1644940561501-1.jpg?w=339 339w, https://ncao.design.blog/wp-content/uploads/2022/02/messageimage_1644940561501-1.jpg?w=677 677w, https://ncao.design.blog/wp-content/uploads/2022/02/messageimage_1644940561501-1.jpg?w=150 150w, https://ncao.design.blog/wp-content/uploads/2022/02/messageimage_1644940561501-1.jpg?w=300 300w" alt="" width="342" height="88" data-attachment-id="433" data-permalink="https://ncao.design.blog/messageimage_1644940561501-1/" data-orig-file="https://ncao.design.blog/wp-content/uploads/2022/02/messageimage_1644940561501-1.jpg" data-orig-size="808,210" data-comments-opened="1" data-image-meta="{"aperture":"0","credit":"","camera":"","caption":"","created_timestamp":"0","copyright":"","focal_length":"0","iso":"0","shutter_speed":"0","title":"","orientation":"0"}" data-image-title="messageimage_1644940561501-1" data-image-description="" data-image-caption="" data-medium-file="https://ncao.design.blog/wp-content/uploads/2022/02/messageimage_1644940561501-1.jpg?w=300" data-large-file="https://ncao.design.blog/wp-content/uploads/2022/02/messageimage_1644940561501-1.jpg?w=750" /></figure> <p><strong>Publication Charges</strong></p> <p>There are no charges to submit and publish an article in the <em>Nonlinear Convex Analysis and Optimization</em> <em>(NCAO)</em>: An International Journal on Numerical, Computation and Applications. All articles published in our journal are open access and are freely and widely available to all readers via the journal website.</p>On the Class of Wei-Yao-Liu Conjugate Gradient Methods for Vector Optimization
https://bangmodjmcs.com/index.php/ncao/article/view/71
<p>Vector optimization problems (VOPs) are crucial research areas with widespread applications. The scalarization approach is commonly used to solve VOPs by transforming vector-valued functions into single-objective optimization. Despite its elegance, this method has the drawback of subjective weight selections. Alternatively, we propose five conjugate gradient (CG) methods designed for VOPs, where the set of Pareto-optimal points are obtained without weight selections, the methods are Wei-Yao-Liu (WYL) and four of its variants. Three of these methods lack sufficient descent conditions (SDC) in this context. However, we establish their global convergence using Wolfe line search. The remaining two methods fulfill SDC with the Wolfe line search, and their global convergence is further verified using the Wolfe line search. Importantly, our approach does not rely on regular restart or convexity assumptions associated with objective functions. We conduct numerical experiments to showcase the effectiveness of our methods, comparing them with the nonnegative PRP method. Through these experiments, we demonstrate the practical implementations of our proposed techniques.</p>Jamilu YahayaPoom KumamSani SalisuAuta Jonathan Timothy
Copyright (c) 2024 Jamilu Yahaya, Poom Kumam, Sani Salisu, Auta Jonathan Timothy
https://creativecommons.org/licenses/by-nc-nd/4.0
2024-06-302024-06-303112310.58715/ncao.2024.3.1A Descent Matrix-free Nonlinear Conjugate Gradient Algorithm for Impulse Noise Removal
https://bangmodjmcs.com/index.php/ncao/article/view/96
<p>The convergence of the Polak, Ribieāre-Polyak (PRP) conjugate gradient (CG) method requires some modifications for improved theoretical properties. In this article, we explore an optimal choice of the Perry conjugacy condition to propose a hybrid CG parameter for solving optimization and inverse problems, particularly in an image reconstruction model. <br />This parameter is selected to satisfy a combination of revised version of the PRP and Dai-Yuan (DY) CG methods. The numerical implementation includes inexact line search, showcasing the scheme's robustness (highest number of solved functions) compared to other known CG algorithms. The efficiency is shown in terms of Real error (RelErr), peak signal noise ratio (PNSR), and CPU time in seconds for impulse noise removal while for unconstrained minimization problems, the study evaluated the efficiency based on number of iterations, function evaluation, and CPU time in seconds. An interesting feature of the proposed method is its ability to converges to the minimizer regardless of the initial guess, relying on certain established assumptions.</p>Nasiru SalihuPoom KumamIbrahim Mohammed SulaimanSuraj Salihu
Copyright (c) 2024 Nasiru Salihu, Professor, Ibrahim Mohammed Sulaiman, Suraj Salihu
https://creativecommons.org/licenses/by-nc-nd/4.0
2024-06-302024-06-3031254610.58715/ncao.2024.3.2