A homogeneous method for unconstrained optimization

DOI10.1080/09720502.2004.10700379MaRDI QIDQ5691688zbMATH OpenOpenAlexFDO

Authors S. V. Alexopoulos

Publication date 27 September 2005

Published in Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720502.2004.10700379

zbMATH Keywords

ABS methodhomogeneous functionsunconstrained optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Recommendations

• scientific article; zbMATH DE number 2130407
• A FAST conic method for function minimization
• scientific article; zbMATH DE number 1424368
• A new conic method for unconstrained minimization
• A parallel minimization algorithm based on a 1 homogeneous model

Cites work

• A class of direct methods for linear systems
• A FAST conic method for function minimization
• An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions
• scientific article; zbMATH DE number 2130407 (Why is no real title available?)
• scientific article; zbMATH DE number 45283 (Why is no real title available?)
• Optimization. Algorithms and consistent approximations

Cited in

(6)

• Homogeneous algorithms for multiextremal optimization
• scientific article; zbMATH DE number 4164052 (Why is no real title available?)
• scientific article; zbMATH DE number 3914101 (Why is no real title available?)
• A numerical study on the robustness and efficiency of the PL homotopy algorithm for solving unconstrained optimization problems
• A modified Hooke-Jeeves method
• A monotone gradient method via weak secant equation for unconstrained optimization

This page was built for publication: A homogeneous method for unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691688)