[
    {
        "id": "osp-13808",
        "type": "article-journal",
        "title": "Solving Unconstrained Optimization Problems by a New Conjugate Gradient Method with Sufficient Descent Property",
        "author": [
            {
                "family": "Rahpeymaii",
                "given": "Farzad"
            },
            {
                "family": "Rostami",
                "given": "Majid"
            }
        ],
        "URL": "https://omanscience.com/en/articles/solving-unconstrained-optimization-problems-by-a-new-conjugate-gradient-method-with-sufficient-descent-property",
        "language": "en",
        "issued": {
            "date-parts": [
                [
                    2023
                ]
            ]
        },
        "container-title": "Sultan Qaboos University Journal for Science",
        "volume": "27",
        "issue": "2",
        "page": "90-99",
        "DOI": "10.53539/squjs.vol27iss2pp90-99",
        "publisher": "Sultan Qaboos University",
        "ISSN": "2308-3921",
        "abstract": "There have been some conjugate gradient methods with strong convergence but numerical instability and conversely‎. Improving these methods is an interesting idea to produce new methods with both strong convergence and‎‏ ‎numerical stability‎. ‎In this paper‎, ‎a new hybrid conjugate gradient method is introduced based on the Fletcher ‎formula (CD) with strong convergence and the Liu and Storey formula (LS) with good numerical results‎. ‎New directions satisfy the sufficient descent property‎, ‎independent of line search‎. ‎Under some mild assumptions‎, ‎the global convergence of new hybrid method is proved‎. ‎Numerical results on unconstrained CUTEst test problems show that the new algorithm is ‎very robust and efficient‎."
    }
]