pith. sign in

arxiv: 2604.24605 · v1 · submitted 2026-04-27 · 🧮 math.OC

PRP, HS and LS Conjugate Gradient Methods for Interval-Valued Multiobjective Optimization Problems

Tapas Mondal , Debdulal Ghosh , Zai-Yun Peng , Yong Zhao This is my paper

Pith reviewed 2026-05-08 02:37 UTC · model grok-4.3

classification 🧮 math.OC
keywords interval-valued optimizationmultiobjective optimizationconjugate gradient methodsPareto critical pointsglobal convergenceWolfe line searchnonlinear optimization
0
0 comments X

The pith

Three conjugate gradient variants with Wolfe line search converge globally to Pareto critical points in interval-valued multiobjective problems.

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

The paper develops algorithms based on the Polak-Ribiere-Polyak, Hestenes-Stiefel, and Liu-Storey nonlinear conjugate gradient methods for unconstrained interval-valued multiobjective optimization. It incorporates a Wolfe line search to select step lengths and proves that each variant converges globally to a Pareto critical point under suitable assumptions on the objectives. Numerical tests on benchmark problems plus performance profile comparisons show the methods are effective in practice.

Core claim

For each of the proposed variants of the nonlinear conjugate gradient method, we establish rigorous global convergence results under appropriate assumptions.

What carries the argument

The PRP, HS and LS conjugate gradient search directions applied to interval-valued vector objectives, paired with a Wolfe line search that enforces sufficient descent and curvature conditions.

If this is right

  • Each of the three variants separately reaches Pareto critical points with global convergence guarantees.
  • The Wolfe line search ensures a suitable step size range for the interval-valued case.
  • Numerical experiments on benchmark problems confirm practical performance.
  • Performance profile analysis ranks the relative efficiency of the PRP, HS and LS variants.

Where Pith is reading between the lines

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

  • The same convergence framework could apply directly to other uncertain multiobjective settings that obey the same differentiability and line-search assumptions.
  • Implementation in existing optimization software would allow immediate testing on larger interval-valued engineering design problems.
  • The approach shows that classical conjugate-gradient directions remain useful even when objectives are replaced by interval-valued functions.

Load-bearing premise

The interval-valued objective functions are continuously differentiable and the line search satisfies the standard Wolfe conditions.

What would settle it

A continuously differentiable interval-valued multiobjective problem on which one of the three methods with the Wolfe line search fails to converge to a Pareto critical point.

read the original abstract

In this article, we develop an efficient algorithm based on three special variants of the nonlinear conjugate gradient method, namely, the Polak--Ribiere--Polyak, Hestenes--Stiefel, and Liu--Story schemes for computing Pareto critical points in unconstrained interval-valued multiobjective optimization problems. The proposed algorithm incorporates a Wolfe line search strategy to determine a suitable range of step size that satisfies the standard Wolfe conditions. For each of the proposed variants of the nonlinear conjugate gradient method, we establish rigorous global convergence results under appropriate assumptions. To demonstrate the effectiveness of the proposed methods, we conduct numerical experiments on a set of benchmark test problems and present a comprehensive performance profile analysis.

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

0 major / 3 minor

Summary. The manuscript develops three variants of the nonlinear conjugate gradient method (Polak-Ribiere-Polyak, Hestenes-Stiefel, and Liu-Storey) for finding Pareto critical points in unconstrained interval-valued multiobjective optimization problems. It incorporates a Wolfe line search and claims to establish rigorous global convergence results for each variant under appropriate assumptions, supported by numerical experiments on benchmark problems with performance profile analysis.

Significance. If the convergence proofs hold, the work provides a useful extension of classical CG methods to interval-valued multiobjective problems, offering efficient algorithms for optimization under uncertainty with theoretical guarantees. The combination of adapted descent properties, Zoutendijk-type arguments in the interval setting, and empirical validation on benchmarks represents a solid contribution to the literature on multiobjective interval optimization.

minor comments (3)
  1. [Abstract] In the abstract, 'Liu--Story' should be corrected to 'Liu-Storey'.
  2. [Convergence analysis] The phrase 'appropriate assumptions' in the convergence claims (mentioned in the abstract and likely detailed in the theorems) should be replaced by an explicit list of the required conditions on the interval-valued functions, such as continuous differentiability and boundedness of the interval gradients.
  3. [Numerical experiments] The numerical section would benefit from additional details on how the interval-valued benchmark problems are constructed and how the Pareto criticality is measured in practice.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript on adapting PRP, HS, and LS conjugate gradient methods to interval-valued multiobjective optimization problems. The recommendation for minor revision is noted. However, the report lists no specific major comments after the 'MAJOR COMMENTS:' heading, so we have no individual points to address. We appreciate the recognition of the theoretical contributions and numerical validation.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper adapts standard PRP, HS, and LS conjugate gradient schemes with Wolfe line search to interval-valued multiobjective optimization, proving global convergence to Pareto critical points via adapted descent and Zoutendijk-type arguments under assumptions of continuous differentiability and Wolfe conditions. These proofs rely on interval gradient notions and Pareto criticality without reducing any claimed result to a fitted parameter, self-definition, or load-bearing self-citation. The central claims consist of independent mathematical derivations that do not collapse to the inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The abstract refers only to 'appropriate assumptions' for convergence without enumerating them; typical assumptions in this literature (continuous differentiability of the interval-valued objectives, bounded level sets, and Wolfe condition satisfaction) are not explicitly listed or justified here. No free parameters, invented entities, or ad-hoc axioms are mentioned.

pith-pipeline@v0.9.0 · 5420 in / 1169 out tokens · 34116 ms · 2026-05-08T02:37:30.976186+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

31 extracted references · 31 canonical work pages

  1. [1]

    B., Ferreira, O

    Assun¸ c˜ ao, P. B., Ferreira, O. P., Prudente, L. F.: Conditional gradient method for multiob- jective optimization. Comput. Optim. Appl.78(3), 741–768 (2021)

    work page 2021

  2. [2]

    S., Ghosh, D., Ram´ ık, J., Debnath, A

    Chauhan, R. S., Ghosh, D., Ram´ ık, J., Debnath, A. K.: Generalized Hukuhara-Clarke derivative of interval-valued functions and its properties. Soft Comput.25(23), 14629–14643 (2021)

    work page 2021

  3. [3]

    Chen, J., Bai, Y., Yu, G., Ou, X., Qin, X.: A PRP type conjugate gradient method without truncation for nonconvex vector optimization. J. Optim. Theory Appl.204, 13 (2025). 24

    work page 2025

  4. [4]

    K., Ghosh, D., Mesiar, R., Chauhan, R

    Debnath, A. K., Ghosh, D., Mesiar, R., Chauhan, R. S.: Generalized-Hukuhara subgradient and its application in optimization problem with interval-valued functions. S¯ adhan¯ a47(2), 1–16 (2022)

    work page 2022

  5. [5]

    D., Mor´ e, J

    Dolan, E. D., Mor´ e, J. J.: Benchmarking optimization software with performance profiles. Math. Program., Ser. A91, 201–213 (2002)

    work page 2002

  6. [6]

    Drummond, L. M. G., Iusem, A. N.: A projected gradient method for vector optimization problems. Comput. Optim. Appl.28(1), 5–29 (2004)

    work page 2004

  7. [7]

    Ehrgott, M.: Multicriteria Optimization, Second Edition, Springer, Berlin Heidelberg New York, (2005)

    work page 2005

  8. [8]

    E.: An explicit three-term Polak–Ribi` ere–Polyak conjugate gradient method for bicriteria optimization

    Elboulqe, Y., Maghri, M. E.: An explicit three-term Polak–Ribi` ere–Polyak conjugate gradient method for bicriteria optimization. Oper. Res. Lett.57, 107195 (2024)

    work page 2024

  9. [9]

    Fleige, J., Drummond, L. M. G., Svaiter, B. F.: Newton’s method for multiobjective optimization. SIAM J. Optim.20(2), 602–626 (2009)

    work page 2009

  10. [10]

    F.: Steepest descent methods for multicriteria optimization

    Fliege, J., Svaiter, B. F.: Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res.51(3), 479–494 (2000)

    work page 2000

  11. [11]

    K., Chauhan, R

    Ghosh, D., Debnath, A. K., Chauhan, R. S., Castillo, O.: Generalized-Hukuhara-gradient efficient-direction method to solve optimization problems with interval-valued functions and its application in least-square problems. Int. J. Fuzzy Syst.24(3), 1275–1300 (2022)

    work page 2022

  12. [12]

    Ghosh, D.: Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions. J. Appl. Math. Comput.53(1-2), 709–731 (2017)

    work page 2017

  13. [13]

    Ghosh, D.: A quasi-Newton method with rank-two update to solve interval optimization problems. Int. J. Comput. Appl. Math.3, 1719–1738 (2017)

    work page 2017

  14. [14]

    Opsearch52(2), 340–366 (2015)

    Ghosh, D., Chakraborty, D.: A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems. Opsearch52(2), 340–366 (2015)

    work page 2015

  15. [15]

    C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization

    Gilbert, J. C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim.2, 21–42 (1992)

    work page 1992

  16. [16]

    Gon¸ calves, M. L. N., Lima, F. S., Prudente, L. F.: A study of Liu-Storey conjugate gradient methods for vector optimization. Appl. Math. Comput.425, 127099 (2022)

    work page 2022

  17. [17]

    Hu, Q., Zhang, Y., Li, R., Zhu, Z.: A modified Polak-Ribi` ere-Polyak type conjugate gradient method for vector optimization. Optim. Methods Softw.40(4), 725–754 (2025)

    work page 2025

  18. [18]

    Lapucci, M., Mansueto, P.: A limited memory quasi-newton approach for multi-objective optimization. Comput. Optim. Appl.85, 33–73 (2023)

    work page 2023

  19. [19]

    Kluwer Academic Publishers, New York (1999)

    Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, New York (1999)

    work page 1999

  20. [20]

    L.: A trust-region approach for computing Pareto fronts in multiobjective optimization

    Mohammadi, A., Cust´ odio, A. L.: A trust-region approach for computing Pareto fronts in multiobjective optimization. Comput. Optim. Appl.87(1), 149–179 (2024)

    work page 2024

  21. [21]

    Mondal, T., Ghosh, D.: Steepest descent method for multiobjective optimization problems of interval-valued maps. Numer. Algorithms (2025). https://doi.org/10.1007/s11075-025-02205-7

    work page doi:10.1007/s11075-025-02205-7 2025

  22. [22]

    Communicated

    Mondal, T., Ghosh, D., Liu, J., Li, J.: Nonlinear conjugate gradient method for multiobjective optimization problems of interval-valued maps. Communicated. https://doi.org/10.48550/arXiv.2603.05814

    work page doi:10.48550/arxiv.2603.05814

  23. [23]

    E.: Interval Analysis

    Moore, R. E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)

    work page 1966

  24. [24]

    H., Singh, A.: A novel modified Liu-Storey nonlinear conjugate gradient method for solving vector optimization problems

    Peng, J., W., Zhong, D. H., Singh, A.: A novel modified Liu-Storey nonlinear conjugate gradient method for solving vector optimization problems. Optimization (2025). https://doi.org/10.1080/02331934.2025.2516452

    work page doi:10.1080/02331934.2025.2516452 2025

  25. [25]

    Y., Peng, J

    Peng, Z. Y., Peng, J. Y., Ghosh, D., Zhao, Y., Li, D.: Optimality conditions and duality results for generalized-Hukuhara subdifferentiable preinvex interval-valued vector optimiza- tion problems, Fuzzy Set Syst.,515, 109416 (2025)

    work page 2025

  26. [26]

    Y., Deng, C

    Peng, Z. Y., Deng, C. Y., Zhao, Y., Peng, J. Y.: Optimality conditions and duality for E- differentiable fractional multiobjective interval valued optimization problems with E-invexity, Set Valued Anal. Optim,6(3), 295–307 (2024)

    work page 2024

  27. [27]

    P´ erez, L. R. L., Prudente, L. F.: Nonlinear conjugate gradient methods for vector optimization. 25 SIAM J. Optim.28(3), 2690–2720 (2018)

    work page 2018

  28. [28]

    Povalej, ˇZ.: Quasi-Newton’s method for multiobjective optimization. J. Comput. Appl. Math. 255, 765–777 (2014)

    work page 2014

  29. [29]

    In: Dubois, D., Lubiano, M

    Stefanini, L.: A generalization of Hukuhara difference. In: Dubois, D., Lubiano, M. A., Prade, H., Gil, M. ´A., Grzegorzewski, P., Hryniewicz, O. (eds) Soft Methods for Handling Variability and Imprecision. Advances in Soft Computing,48, pp. 203–210, Springer, Berlin, Heidelberg, (2008)

    work page 2008

  30. [30]

    Y., Tan X

    Wen, M., Peng Z. Y., Tan X. Y., Deng C. Y.:E-semi-preinvex interval-valued functions and interval-valued programming. Journal of Chongqing Normal University (Natural Science Edition),42(2), 117–126 (2025)

    work page 2025

  31. [31]

    C.: The Karush–Kuhn–Tucker optimality conditions in an optimization problem with interval-valued objective function

    Wu, H. C.: The Karush–Kuhn–Tucker optimality conditions in an optimization problem with interval-valued objective function. Eur. J. Oper. Res.176(1), 46–59 (2007). 26

    work page 2007