• Home
  • Search
  • A New Conjugate Direction Algorithm for Unconstrained Function Minimization
  • https://doi.org/10.1115/detc1990-0051Copy DOI Icon

A New Conjugate Direction Algorithm for Unconstrained Function Minimization

  • Sep 16, 1990
  • Bailin Li +1 more
Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

Abstract Based on the properties of conjugate vectors, a new algorithm for unconstrained function minimization is developed. The algorithm belongs to the direct search method and is a conjugate direction-type method with the property of quadratic termination. Comparing with some convensional direct search methods including the modified Powell method, the number of one dimensional search is greatly reduced. In addition, the algorithm presented in this paper is simple in calculating and easy in coding, and it has the capability of accelerating along the ridges. The method presented is compared with two direct search methods including the modified Powell method on many test problems. Numerical results show the robustness and efficiency of the new algorithm.

Similar Papers
  • Research Article
  • Citations197

Optimal conditioning of self-scaling variable Metric algorithms

  • Dec 01, 1976
  • Mathematical Programming
  • Shmuel S Oren +1
  • Research Article
  • Citations24

A descent method for a reformulation of the second-order cone complementarity problem

  • Feb 20, 2007
  • Journal of Computational and Applied Mathematics
  • Jein-Shan Chen +1
  • Single Book
  • Citations7513

Numerical Methods for Unconstrained Optimization and Nonlinear Equations

  • Jan 01, 1996
  • J E Dennis +1
  • Conference Article
  • Citations11

Antenna Array Synthesis Using Derivative, Non-Derivative and Random Search Optimization

  • Apr 01, 2008
  • Stephen J Blank +1
  • Research Article
  • Citations6

Calibration of parameters in Dynamic Energy Budget models using Direct-Search methods.

  • Dec 07, 2018
  • Journal of Mathematical Biology
  • J V Morais +2
  • Single Report

Convergence Theory for Unconstrained Minimization,

  • Sep 30, 1980
  • Garth P Mccormick
  • Research Article
  • Citations52

Iterated local search with Powell’s method: a memetic algorithm for continuous global optimization

  • Feb 24, 2010
  • Memetic Computing
  • Oliver Kramer
  • Research Article
  • Citations8

Direct search methods for the fast optimisation of batch distillation processes

  • Oct 22, 2022
  • Separation and Purification Technology
  • Laszlo Hegely
  • Research Article

Optimization of Doubly Fed Induction Generator Equivalent Circuit Parameters by Direct Search Method

  • Apr 04, 2017
  • Zenodo (CERN European Organization for Nuclear Research)
  • Mamidi Ramakrishna Rao
  • Research Article
  • Citations6

The numerical computation of kinetic parameters for contracting interface reactions

  • Jun 01, 1976
  • Journal of Thermal Analysis
  • A C Norris +2
  • Conference Article
  • Citations1

Artificial neural network controller for multi-link structures

  • Jan 05, 1995
  • D.L Styer +1
  • Conference Article
  • Citations9

Weight optimization of a machine for airborne wind turbines

  • Oct 01, 2014
  • Christoph Gammeter +3
  • PDF
  • Research Article

In Accurate CG-Algorithm for Unconstrained Optimization Problems

  • May 31, 2004
  • AL-Rafidain Journal of Computer Sciences and Mathematics
  • Nidhal Al-Assady +2
  • Research Article
  • Citations7

Geometric Rescaling Algorithms for Submodular Function Minimization

  • Jul 06, 2021
  • Mathematics of Operations Research
  • Dan Dadush +2
  • Book Chapter
  • Citations26

Genetic Algorithms Versus Simulated Annealing: Satisfaction of Large Sets of Algebraic Mechanical Design Constraints

  • Jan 01, 1994
  • A C Thornton
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.