𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dimension-reducing method for unconstrained optimization

✍ Scribed by T.N. Grapsa; M.N. Vrahatis

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
762 KB
Volume
66
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new trust region method for unconstrai
A new trust region method for unconstrained optimization
✍ Zhen-Jun Shi; Jin-Hua Guo πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 179 KB

In this paper, we propose a new trust region method for unconstrained optimization problems. The new trust region method can automatically adjust the trust region radius of related subproblems at each iteration and has strong global convergence under some mild conditions. We also analyze the global

A new filled function method for unconst
A new filled function method for unconstrained global optimization
✍ Chengjun Wang; Yongjian Yang; Jing Li πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 585 KB

In this paper, a new filled function which has better properties is proposed for identifying a global minimum point for a general class of nonlinear programming problems within a closed bounded domain. An algorithm for unconstrained global optimization is developed from the new filled function. Theo

A conjugate gradient method with descent
A conjugate gradient method with descent direction for unconstrained optimization
✍ Gonglin Yuan; Xiwen Lu; Zengxin Wei πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 726 KB

A modified conjugate gradient method is presented for solving unconstrained optimization problems, which possesses the following properties: (i) The sufficient descent property is satisfied without any line search; (ii) The search direction will be in a trust region automatically; (iii) The Zoutendi

A trust-region method with a conic model
A trust-region method with a conic model for unconstrained optimization
✍ Shao-Jian Qu; Su-Da Jiang πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 216 KB

## Abstract In this paper, we propose and analyze a new conic trust‐region algorithm for solving the unconstrained optimization problems. A new strategy is proposed to construct the conic model and the relevant conic trust‐region subproblems are solved by an approximate solution method. This approx

New spectral PRP conjugate gradient meth
New spectral PRP conjugate gradient method for unconstrained optimization
✍ Zhong Wan; ZhanLu Yang; YaLin Wang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 230 KB

In this paper, a new spectral PRP conjugate gradient algorithm has been developed for solving unconstrained optimization problems, where the search direction was a kind of combination of the gradient and the obtained direction, and the steplength was obtained by the Wolfe-type inexact line search. I