Results 1 to 10 of about 78 (77)
The exactness of the ℓ1 penalty function for a class of mathematical programs with generalized complementarity constraints [PDF]
Fundamental ResearchIn a mathematical program with generalized complementarity constraints (MPGCC), complementarity relation is imposed between each pair of variable blocks.
Yukuan Hu, Xin Liu
doaj +2 more sources
Convergence rate of the modified Levenberg-Marquardt method under Hölderian local error bound
Open Mathematics, 2022 In this article, we analyze the convergence rate of the modified Levenberg-Marquardt (MLM) method under the Hölderian local error bound condition and the Hölderian continuity of the Jacobian, which are more general than the local error bound condition ...
Zheng Lin, Chen Liang, Tang Yangxin
doaj +1 more source
Topological Algebra and its Applications, 2022 Conjugate gradient methods are very popular for solving large scale unconstrained optimization problems because of their simplicity to implement and low memory requirements.
Diphofu T., Kaelo P., Tufa A.R.
doaj +1 more source
A Dai-Liao-type projection method for monotone nonlinear equations and signal processing
Demonstratio Mathematica, 2022 In this article, inspired by the projection technique of Solodov and Svaiter, we exploit the simple structure, low memory requirement, and good convergence properties of the mixed conjugate gradient method of Stanimirović et al.
Ibrahim Abdulkarim Hassan +4 more
doaj +1 more source
New inertial forward–backward algorithm for convex minimization with applications
Demonstratio Mathematica, 2023 In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces.
Kankam Kunrada +2 more
doaj +1 more source
A new conjugate gradient method for acceleration of gradient descent algorithms
Moroccan Journal of Pure and Applied Analysis, 2021 An accelerated of the steepest descent method for solving unconstrained optimization problems is presented. which propose a fundamentally different conjugate gradient method, in which the well-known parameter βk is computed by an new formula.
Rahali Noureddine +2 more
doaj +1 more source
A three-term Polak-Ribière-Polyak derivative-free method and its application to image restoration
Scientific African, 2021 In this paper, a derivative-free method for solving convex constrained nonlinear equations involving a monotone operator with a Lipschitz condition imposed on the underlying operator is introduced and studied.
Abdulkarim Hassan Ibrahim +3 more
doaj +1 more source
Halpern-type proximal point algorithm in complete CAT(0) metric spaces
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 First, Halpern-type proximal point algorithm is introduced in complete CAT(0) metric spaces. Then, Browder convergence theorem is considered for this algorithm and also we prove that Halpern-type proximal point algorithm converges strongly to a zero of ...
Heydari Mohammad Taghi, Ranjbar Sajad
doaj +1 more source
Implementation of LDG method for 3D unstructured meshes
Revista de Matemática: Teoría y Aplicaciones, 2012 This paper describes an implementation of the Local Discontinuous Galerkin method (LDG) applied to elliptic problems in 3D. The implementation of the major operators is discussed.
Filander A. Sequeira Chavarría +1 more
doaj +1 more source
Iterative algorithms with seminorm‐induced oblique projections
Abstract and Applied Analysis, Volume 2003, Issue 7, Page 387-406, 2003., 2003 A definition of oblique projections onto closed convex sets that use seminorms induced by diagonal matrices which may have zeros on the diagonal is introduced. Existence and uniqueness of such projections are secured via directional affinity of the sets with respect to the diagonal matrices involved. A block‐iterative algorithmic scheme for solving the
Yair Censor, Tommy Elfving
wiley +1 more source