Conjugate gradient path method without line search technique for derivative-free unconstrained optimization
type: Item
instance of: scholarly article
title: Conjugate gradient path method without line search technique for derivative-free unconstrained optimization
zbMATH Open document ID: 1355.49030
author: Jueyu Wang
author: Detong Zhu
published in: Numerical Algorithms
publication date: 2017-01-10T00:00:00Z
review text: The authors propose a conjugate gradient path method combined with derivative-free techniques for solving the unsconstrained nonlinear minimization of nonlinear functions. The technique is based on the use of quadratic polynomials to approximate the function to be optimized.
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 6673278
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: derivative-free optimization
reviewed by: Guy Jumarie
describes a project that uses: NEWUOA
describes a project that uses: DFO
describes a project that uses: UOBYQA
MaRDI profile type: Publication
full work available at URL: s11075-016-0124-9
OpenAlex ID: W2308696994
cites work: Q3539529
cites work: Q3404746
cites work: Q4421356
cites work: Recent progress in unconstrained nonlinear optimization without derivatives
cites work: Geometry of interpolation sets in derivative free optimization
cites work: Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
cites work: Introduction to Derivative-Free Optimization
cites work: Q4524222
cites work: Mathematical theory of optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: On the geometry phase in model-based algorithms for derivative-free optimization
cites work: Handbook of test problems in local and global optimization
cites work: Encyclopedia of Optimization
cites work: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
cites work: Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
cites work: Numerical Optimization
cites work: UOBYQA: unconstrained optimization by quadratic approximation
cites work: Q5493584
cites work: Test examples for nonlinear programming codes
cites work: Global Convergence of Radial Basis Function Trust Region Derivative-Free Algorithms
cites work: On the local convergence of a derivative-free algorithm for least-squares minimization
cites work: A Derivative-Free Algorithm for Least-Squares Minimization
DOI: 10.1007/S11075-016-0124-9
description: scientific article; zbMATH DE number 6673278