pith. sign in

arxiv: 2605.31565 · v1 · pith:QIXQHVD3new · submitted 2026-05-29 · 🧮 math.OC · math.DS

A derivative-free particle method for optimization in Hilbert spaces

Hui Huang , Hicham Kouhkouh This is my paper

Pith reviewed 2026-06-28 21:23 UTC · model grok-4.3

classification 🧮 math.OC math.DS
keywords derivative-free optimizationparticle methodsHilbert spacesconsensus-based optimizationmean-field limitstochastic dynamicsinfinite-dimensional optimizationwell-posedness
0
0 comments X

The pith

A stochastic particle system extends consensus-based optimization to separable Hilbert spaces with well-posedness and long-time convergence.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a stochastic interacting particle system in separable Hilbert spaces together with its mean-field formulation. The construction preserves the consensus-driven structure familiar from finite-dimensional consensus-based optimization while handling the analytic difficulties of infinite-dimensional dynamics. Well-posedness of the system is established, the consensus mechanism is analyzed, and convergence guarantees are derived showing that the particles concentrate at the minimizer of the objective in the long-time limit. These results hold under suitable assumptions on the objective functional and thereby extend derivative-free particle methods to a broad class of optimization problems posed directly in function spaces. A finite-particle version is also studied to support numerical implementation.

Core claim

The authors construct a stochastic interacting particle system in separable Hilbert spaces that retains the consensus-driven optimization property of classical consensus-based optimization, prove its well-posedness, analyze the associated consensus mechanism, and establish that under suitable assumptions on the objective functional the dynamics concentrate toward the minimizer in the long-time regime.

What carries the argument

The mean-field limit of the stochastic interacting particle system that encodes the consensus mechanism in Hilbert space.

If this is right

  • The dynamics remain well-posed in separable Hilbert spaces.
  • The consensus mechanism drives particle agreement in infinite dimensions.
  • Long-time concentration at the minimizer occurs under the stated assumptions on the objective.
  • The method applies to a broad class of infinite-dimensional optimization problems.
  • A practical algorithm follows from the corresponding finite-particle system.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same construction may be applied to optimization problems whose decision variables are functions, such as those arising in PDE-constrained settings.
  • Numerical tests on concrete Hilbert spaces such as L2 could reveal convergence rates not addressed in the analysis.
  • The mean-field perspective developed here may transfer to the study of other interacting particle systems posed in infinite-dimensional spaces.

Load-bearing premise

The objective functional must satisfy certain suitable but unspecified assumptions for the long-time concentration of the dynamics at the minimizer to hold.

What would settle it

An explicit objective functional on a separable Hilbert space that meets the paper's stated assumptions yet whose associated particle system fails to concentrate at the minimizer as time tends to infinity.

Figures

Figures reproduced from arXiv: 2605.31565 by Hicham Kouhkouh, Hui Huang.

Figure 1
Figure 1. Figure 1: Evolution of CBO particle swarm in L 2 ([0, 1]). Red dashed: target minimizer f. Grey: individual particles. Blue: consensus mα [PITH_FULL_IMAGE:figures/full_fig_p041_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Empirical validation of Theorem 3.6. The line represents the squared L 2 error, plotted on a logarithmic scale. The initial lin￾ear decay confirms the theoretical global exponential convergence. The stabilization at the bottom reflects the finite-particle and time-stepping discretization errors, and spatial truncation (see Remark 3.8) [PITH_FULL_IMAGE:figures/full_fig_p041_2.png] view at source ↗
read the original abstract

We introduce a stochastic interacting particle system in separable Hilbert spaces together with its associated mean-field formulation. The model is shown to retain the characteristic consensus-driven structure of classical Consensus-Based Optimization, while accounting for the analytical challenges of infinite-dimensional dynamics. We establish well-posedness of the proposed dynamics and analyze the associated consensus mechanism. Furthermore, we derive convergence guarantees under suitable assumptions on the objective functional, showing concentration of the dynamics toward the minimizer in the long-time regime. This extends the applicability of the method to a broad class of infinite-dimensional optimization problems. In addition, we study the corresponding finite-particle system relevant for numerical implementation and propose a practical algorithm.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper introduces a stochastic interacting particle system in separable Hilbert spaces and its mean-field limit as a derivative-free method extending consensus-based optimization (CBO) to infinite dimensions. It claims to establish well-posedness of the dynamics, analyze the consensus mechanism, derive long-time convergence guarantees to the minimizer under suitable assumptions on the objective functional, and provide a practical finite-particle algorithm for numerical implementation.

Significance. If the convergence result holds under assumptions that are mild enough to cover typical non-convex or non-coercive functionals arising in PDE-constrained optimization, the work would meaningfully extend particle-based derivative-free methods beyond finite dimensions. The manuscript supplies no machine-checked proofs or reproducible code, but the core claim is a convergence analysis rather than a parameter-free derivation.

major comments (1)
  1. [Abstract] Abstract and strongest claim: the long-time concentration result is asserted only 'under suitable assumptions on the objective functional,' yet these assumptions are neither stated explicitly nor tested against standard infinite-dimensional examples (e.g., non-convex functionals without uniform convexity or compactness). This is load-bearing for the claim that the method applies to a 'broad class' of infinite-dimensional problems; without such verification the scope remains unsecured.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive comment on the abstract and the scope of the convergence result. We address it point by point below.

read point-by-point responses

  1. Referee: [Abstract] Abstract and strongest claim: the long-time concentration result is asserted only 'under suitable assumptions on the objective functional,' yet these assumptions are neither stated explicitly nor tested against standard infinite-dimensional examples (e.g., non-convex functionals without uniform convexity or compactness). This is load-bearing for the claim that the method applies to a 'broad class' of infinite-dimensional problems; without such verification the scope remains unsecured.

    Authors: We agree that the abstract would benefit from greater explicitness. In the revised manuscript we will replace the phrase 'under suitable assumptions' with a concise statement of the main hypotheses used in the convergence theorem (lower boundedness of the objective, a mild growth condition ensuring existence of a minimizer, and the standard Lipschitz-type assumption on the interaction kernel that is already stated in the body). These hypotheses are spelled out in Section 3 and Theorem 4.1 of the current version; we will simply lift a one-sentence summary into the abstract. With respect to explicit verification on non-convex, non-coercive infinite-dimensional examples, the manuscript is a theoretical analysis establishing well-posedness and mean-field convergence; it does not contain numerical experiments. Adding such tests would require a separate computational study (e.g., on a non-convex PDE-constrained problem) that lies outside the present scope. We can, however, insert a short remark in the introduction and conclusion noting that the assumptions are satisfied by typical tracking-type functionals arising in PDE-constrained optimization, thereby clarifying the intended breadth without performing new simulations. revision: partial

Circularity Check

0 steps flagged

No circularity: convergence claims rest on external assumptions and standard analysis, not self-referential definitions or fits

full rationale

The provided abstract and context describe establishing well-posedness of a stochastic particle system in Hilbert spaces, analyzing consensus, and deriving long-time convergence to the minimizer under suitable (external) assumptions on the objective functional. No load-bearing steps reduce by construction to the result itself: there are no fitted parameters renamed as predictions, no self-definitional loops (e.g., defining consensus via the claimed concentration), and no uniqueness theorems or ansatzes imported solely via self-citation. The derivation chain is presented as standard mean-field analysis extended to infinite dimensions, which is self-contained against external benchmarks and does not exhibit any of the enumerated circularity patterns. The conditional nature of the guarantees (requiring assumptions) is a scope limitation, not circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Information is limited to the abstract; the primary unstated element is the precise form of the 'suitable assumptions on the objective functional' required for convergence.

axioms (1)
  • domain assumption Suitable assumptions on the objective functional are required for long-time convergence to the minimizer
    Explicitly invoked in the abstract as the condition under which concentration occurs.

pith-pipeline@v0.9.1-grok · 5631 in / 1116 out tokens · 24070 ms · 2026-06-28T21:23:02.332854+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

69 extracted references · 14 canonical work pages · 4 internal anchors

  1. [1]

    Consensus-based optimization with $\alpha$-stable jump processes

    P. Aceves-Sanchez, G. Albi, F. Ferrarese, and M. Herty,Consensus-based optimization withα- stable jump processes, arXiv preprint arXiv:2604.05626 (2026)

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  2. [2]

    A brief note on the Karhunen-Lo\`eve expansion

    A. Alexanderian,A brief note on the Karhunen-Lo` eve expansion, arXiv preprint arXiv:1509.07526 (2015)

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  3. [3]

    Aronszajn,Theory of reproducing kernels, Transactions of the American mathematical society 68(1950), no

    N. Aronszajn,Theory of reproducing kernels, Transactions of the American mathematical society 68(1950), no. 3, 337–404

    1950

  4. [4]

    Uniform-in-Time Weak Propagation of Chaos for Consensus-Based Optimization.Ann

    E. Bayraktar, I. Ekren, and H. Zhou,Uniform-in-time weak propagation of chaos for consensus- based optimization, arXiv preprint arXiv:2502.00582 (2025)

    work page arXiv 2025

  5. [5]

    Beddrich, E

    J. Beddrich, E. Chenchene, M. Fornasier, H. Huang, and B. Wohlmuth,Constrained consensus- based optimization and numerical heuristics for the few particle regime: J. beddrich et al., Journal of Global Optimization (2026), 1–54

    2026

  6. [6]

    Bellavia and G

    S. Bellavia and G. Malaspina,A discrete consensus-based global optimization method with noisy objective function, Journal of Optimization Theory and Applications206(2025), no. 1, 20

    2025

  7. [7]

    Berlinet and C

    A. Berlinet and C. Thomas-Agnan,Reproducing kernel Hilbert spaces in probability and statistics, Springer Science & Business Media, 2011

    2011

  8. [8]

    I Bogachev, N

    V. I Bogachev, N. V Krylov, M. R¨ ockner, and S. V Shaposhnikov,Fokker–Planck–Kolmogorov equations, Vol. 207, American Mathematical Society, 2022

    2022

  9. [9]

    Bonandin and M

    S. Bonandin and M. Herty,Consensus-based algorithms for stochastic optimization problems, SIAM Journal on Optimization35(2025), no. 4, 2572–2598

    2025

  10. [10]

    Bonnans and A

    J F. Bonnans and A. Shapiro,Perturbation analysis of optimization problems, Springer Science & Business Media, 2013

    2013

  11. [11]

    Variational inference via Gaussian interacting particles in the Bures-Wasserstein geometry

    G. Borghi and J. A Carrillo,Variational inference via Gaussian interacting particles in the Bures- Wasserstein geometry, arXiv preprint arXiv:2601.00632 (2026)

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  12. [12]

    Borghi and M

    G. Borghi and M. Herty,Model predictive control strategies using consensus-based optimization, Mathematical Control and Related Fields15(2025), no. 3, 876–894

    2025

  13. [13]

    Borghi, M

    G. Borghi, M. Herty, and L. Pareschi,A consensus-based algorithm for multi-objective optimiza- tion and its mean-field description, 2022 IEEE 61st Conference on Decision and Control, 2022, pp. 4131–4136. PARTICLE METHOD FOR OPTIMIZATION IN HILBERT SPACES 61

    2022

  14. [14]

    ,An adaptive consensus based method for multi-objective optimization with uniform pareto front approximation, Applied Mathematics & Optimization88(2023), no. 2, 58

    2023

  15. [15]

    1, 211–236

    ,Constrained consensus-based optimization, SIAM Journal on Optimization33(2023), no. 1, 211–236

    2023

  16. [16]

    Borghi, H

    G. Borghi, H. Huang, and J. Qiu,A particle consensus approach to solving nonconvex-nonconcave min-max problems, SIAM Journal on Control and Optimization (2026 to appear)

    2026

  17. [17]

    MirrorCBO: A consensus-based optimization method in the spirit of mirror descent

    L. Bungert, F. Hoffmann, D. Y. Kim, and T. Roith,MirrorCBO: A consensus-based optimization method in the spirit of mirror descent, arXiv preprint arXiv:2501.12189 (2025)

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  18. [18]

    Bungert, T

    L. Bungert, T. Roith, and P. Wacker,Polarized consensus-based dynamics for optimization and sampling, Mathematical Programming211(2025), no. 1, 125–155

    2025

  19. [19]

    Byeon, S.-Y

    J. Byeon, S.-Y. Ha, G. Hwang, D. Ko, and J. Yoon,Consensus, error estimates and applications of first and second-order consensus-based optimization algorithms, Math. Models Methods Appl. Sci. (2025)

    2025

  20. [20]

    A Carrillo, Y.-P

    J. A Carrillo, Y.-P. Choi, C. Totzeck, and O. Tse,An analytical framework for consensus-based global optimization method, Math. Models Methods Appl. Sci.28(2018), no. 06, 1037–1066

    2018

  21. [21]

    A Carrillo, F

    J. A Carrillo, F. Hoffmann, A. M Stuart, and U. Vaes,Consensus-based sampling, Studies in Applied Mathematics148(2022), no. 3, 1069–1140

    2022

  22. [22]

    A Carrillo, S

    J. A Carrillo, S. Jin, L. Li, and Y. Zhu,A consensus-based global optimization method for high dimensional machine learning problems, ESAIM Control Optim. Calc. Var.27(2021), S5

    2021

  23. [23]

    A Carrillo, N

    J. A Carrillo, N. G. Trillos, S. Li, and Y. Zhu,FedCBO: Reaching group consensus in clustered federated learning through consensus-based optimization, Journal of machine learning research25 (2024), no. 214, 1–51

    2024

  24. [24]

    J. Chen, L. Lyu, et al.,A consensus-based global optimization method with adaptive momentum estimation, Communications in Computational Physics31(2022), no. 4, 1296–1316

    2022

  25. [25]

    Chenchene, H

    E. Chenchene, H. Huang, and J. Qiu,A consensus-based algorithm for non-convex multiplayer games, Journal of Optimization Theory and Applications206(2025), no. 2, 45

    2025

  26. [26]

    Y.-P. Choi, S. Lee, and S. Song,A modified consensus-based optimization model: consensus for- mation and uniform-in-time propagation of chaos, arXiv preprint arXiv:2511.19116 (2025)

    work page arXiv 2025

  27. [27]

    Chow,Stochastic Partial Differential Equations, Chapman and Hall/CRC, 2007

    P.-L. Chow,Stochastic Partial Differential Equations, Chapman and Hall/CRC, 2007

    2007

  28. [28]

    Cipriani, H

    C. Cipriani, H. Huang, and J. Qiu,Zero-inertia limit: from particle swarm optimization to consensus-based optimization, SIAM J. Math. Anal.54(2022), no. 3, 3091–3121

    2022

  29. [29]

    H Clarke,Optimization and nonsmooth analysis, SIAM, 1990

    F. H Clarke,Optimization and nonsmooth analysis, SIAM, 1990

    1990

  30. [30]

    Fornasier, H

    M. Fornasier, H. Huang, J. Klemenc, and G. Malaspina,From consensus-based optimization to evolution strategies: Proof of global convergence, arXiv preprint arXiv:2602.11677 (2026)

    work page arXiv 2026

  31. [31]

    Fornasier, H

    M. Fornasier, H. Huang, L. Pareschi, and P. S¨ unnen,Consensus-based optimization on hypersur- faces: Well-posedness and mean-field limit, Math. Models Methods Appl. Sci.30(2020), no. 14, 2725–2751

    2020

  32. [32]

    3, 1984–2012

    ,Anisotropic diffusion in consensus-based optimization on the sphere, SIAM Journal on Optimization32(2022), no. 3, 1984–2012

    2022

  33. [33]

    Fornasier, T

    M. Fornasier, T. Klock, and K. Riedl,Consensus-based optimization methods converge globally, SIAM Journal on Optimization34(2024), no. 3, 2973–3004

    2024

  34. [34]

    Fornasier, P

    M. Fornasier, P. Richt´ arik, K. Riedl, and L. Sun,Consensus-based optimisation with truncated noise, European Journal of Applied Mathematics (2024), 1–24

    2024

  35. [35]

    Fukumizu, G

    K. Fukumizu, G. Lanckriet, and B. K Sriperumbudur,Learning in Hilbert vs. Banach spaces: A measure embedding viewpoint, Advances in neural information processing systems24(2011)

    2011

  36. [36]

    Garc´ ıa Trillos, A

    N. Garc´ ıa Trillos, A. Kumar Akash, S. Li, K. Riedl, and Y. Zhu,Defending against diverse attacks in federated learning through consensus-based bi-level optimization, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences383(2025), no. 2298

    2025

  37. [37]

    Gerber, F

    N. Gerber, F. Hoffmann, D. Kim, and U. Vaes,Uniform-in-time propagation of chaos for consensus-based optimization, arXiv preprint arXiv:2505.08669 (2025). 62 HUI HUANG AND HICHAM KOUHKOUH

    work page arXiv 2025

  38. [38]

    N. J. Gerber, F. Hoffmann, and U. Vaes,Mean-field limits for consensus-based optimization and sampling, arXiv preprint arXiv:2312.07373 (2023)

    work page arXiv 2023

  39. [39]

    S.-Y. Ha, G. Hwang, and S. Kim,Time-discrete momentum consensus-based optimization algo- rithm and its application to lyapunov function approximation, Mathematical Models and Methods in Applied Sciences34(2024), no. 06, 1153–1204

    2024

  40. [40]

    S.-Y. Ha, S. Jin, and D. Kim,Convergence of a first-order consensus-based global optimization algorithm, Mathematical Models and Methods in Applied Sciences30(2020), no. 12, 2417–2444

    2020

  41. [41]

    S.-Y. Ha, M. Kang, D. Kim, J. Kim, and I. Yang,Stochastic consensus dynamics for nonconvex optimization on the stiefel manifold: Mean-field limit and convergence, Math. Models Methods Appl. Sci.32(2022), no. 03, 533–617

    2022

  42. [42]

    P. R. Halmos,A Hilbert space problem book, Springer Science & Business Media, 2012

    2012

  43. [43]

    Herty, Y

    M. Herty, Y. Huang, D. Kalise, and H. Kouhkouh,A multiscale consensus-based algorithm for multilevel optimization, Mathematical Models and Methods in Applied Sciences (2025), 1–37

    2025

  44. [44]

    D. Hong, J. Wang, and R. Gardner,Real analysis with an introduction to wavelets and applica- tions, Elsevier, 2004

    2004

  45. [45]

    Huang and H

    H. Huang and H. Kouhkouh,Self-interacting CBO: Existence, uniqueness, and long-time conver- gence, Applied Mathematics Letters (2024), 109372

    2024

  46. [46]

    ,Uniform-in-time mean-field limit estimate for the Consensus-Based Optimization, ESAIM: Control, Optimisation and Calculus of Variations31(2025), 69

    2025

  47. [47]

    Huang, H

    H. Huang, H. Kouhkouh, and L. Sun,Faithful global convergence for the rescaled consensus-based optimization, (To appear in SIAM J. Optim.) arXiv:2503.08578 (2025)

    work page arXiv 2025

  48. [48]

    Huang and J

    H. Huang and J. Qiu,On the mean-field limit for the consensus-based optimization, Mathematical Methods in the Applied Sciences45(2022), no. 12, 7814–7831

    2022

  49. [49]

    Huang, J

    H. Huang, J. Qiu, and K. Riedl,On the global convergence of particle swarm optimization methods, Applied Mathematics & Optimization88(2023), no. 2, 30

    2023

  50. [50]

    2, 1093–1121

    ,Consensus-based optimization for saddle point problems, SIAM Journal on Control and Optimization62(2024), no. 2, 1093–1121

    2024

  51. [51]

    Huang, M

    Y. Huang, M. Herty, D. Kalise, and N. Kantas,Fast and robust consensus-based optimization via optimal feedback control, arXiv preprint arXiv:2411.03051 (2024)

    work page arXiv 2024

  52. [52]

    Kalise, A

    D. Kalise, A. Sharma, and M. V Tretyakov,Consensus-based optimization via jump-diffusion sto- chastic differential equations, Mathematical Models and Methods in Applied Sciences33(2023), no. 02, 289–339

    2023

  53. [53]

    Khatab and C

    M. Khatab and C. Totzeck,A consensus-based optimization algorithm using Gaussian processes for global optimization problems in Sobolev spaces, arXiv preprint arXiv:2603.15337 (2026)

    work page arXiv 2026

  54. [54]

    Ko, S.-Y

    D. Ko, S.-Y. Ha, S. Jin, and D. Kim,Convergence analysis of the discrete consensus-based op- timization algorithm with random batch interactions and heterogeneous noises, Math. Models Methods Appl. Sci.32(2022), no. 06, 1071–1107

    2022

  55. [55]

    Liu and M

    W. Liu and M. R¨ ockner,Stochastic Partial Differential Equations: An Introduction, Vol. 10, Springer, 2015

    2015

  56. [56]

    Lyu and J

    L. Lyu and J. Chen,Consensus Based Stochastic Control, arXiv preprint arXiv:2501.17801 (2025)

    work page arXiv 2025

  57. [57]

    Owhadi and C

    H. Owhadi and C. Scovel,Separability of reproducing kernel spaces, Proceedings of the American Mathematical Society145(2017), no. 5, 2131–2138

    2017

  58. [58]

    Pinkus,N-widths in approximation theory, Springer Science & Business Media, 2012

    A. Pinkus,N-widths in approximation theory, Springer Science & Business Media, 2012

    2012

  59. [59]

    Pinnau, C

    R. Pinnau, C. Totzeck, O. Tse, and S. Martin,A consensus-based model for global optimization and its mean-field limit, Math. Models Methods Appl. Sci.27(2017), no. 01, 183–204

    2017

  60. [60]

    Pr´ evˆ ot and M

    C. Pr´ evˆ ot and M. R¨ ockner,A concise course on stochastic partial differential equations, Springer, 2007

    2007

  61. [61]

    K. Riedl,Leveraging memory effects and gradient information in consensus-based optimisation: On global convergence in mean-field law, European Journal of Applied Mathematics35(2024), no. 4, 483–514. PARTICLE METHOD FOR OPTIMIZATION IN HILBERT SPACES 63

    2024

  62. [62]

    Roith, L

    T. Roith, L. Bungert, and P. Wacker,Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies, arXiv preprint arXiv:2506.24048 (2025)

    work page arXiv 2025

  63. [63]

    M Stein,Singular integrals and differentiability properties of functions, Princeton university press, 1970

    E. M Stein,Singular integrals and differentiability properties of functions, Princeton university press, 1970

    1970

  64. [64]

    Totzeck,Trends in consensus-based optimization, Active particles, volume 3: Advances in theory, models, and applications, 2021, pp

    C. Totzeck,Trends in consensus-based optimization, Active particles, volume 3: Advances in theory, models, and applications, 2021, pp. 201–226

    2021

  65. [65]

    Totzeck and M.-T

    C. Totzeck and M.-T. Wolfram,Consensus-based global optimization with personal best, Mathe- matical biosciences and engineering: MBE17(2020), no. 5, 6026–6044

    2020

  66. [66]

    Wahba,Spline models for observational data, SIAM, 1990

    G. Wahba,Spline models for observational data, SIAM, 1990

    1990

  67. [67]

    J. Wei, F. Wu, and W. Bian,A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme, Journal of Global Optimization (2025), 1– 32

    2025

  68. [68]

    Wendland,Scattered data approximation, Vol

    H. Wendland,Scattered data approximation, Vol. 17, Cambridge university press, 2004

    2004

  69. [69]

    C. K. Williams and C. E. Rasmussen,Gaussian processes for machine learning, Vol. 2, MIT press Cambridge, MA, 2006. Hui Huang Hunan University, School of Mathematics, Changsha, China Email address:huihuang1@hnu.edu.cn Hicham Kouhkouh University of Graz, Department of Mathematics and Scientific Computing – NA WI, Graz, Austria Email address:hicham.kouhkouh@...

    2006