A Modification of Steepest Descent Method for Solving Large-Scaled Unconstrained Optimization Problems

International Journal of Engineering and Technology(UAE)- United Arab Emirates

doi 10.14419/ijet.v7i3.28.20969

Full Text

Abstract

Available in

Date

Authors

Publisher

Science Publishing Corporation

Related search

Accelerated Double Direction Method for Solving Unconstrained Optimization Problems

Mathematical Problems in Engineering
MathematicsEngineering
2014English

The Hybrid BFGS-CG Method in Solving Unconstrained Optimization Problems

Abstract and Applied Analysis
Applied MathematicsAnalysis
2014English

A Recursive Method for Solving Unconstrained Tangential Interpolation Problems

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
1999English

A Relaxed Hybrid Steepest Descent Method for Common Solutions of Generalized Mixed Equilibrium Problems and Fixed Point Problems

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2011English

The Steepest Descent Gravitational Method for Linear Programming

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1989English

Steepest Descent

2010English

Solving a Large Scale Nonlinear Unconstrained Optimization Problems by Using New Coefficient of Conjugate Gradient Method With Exact Line Search Direction

International Journal of Engineering and Technology(UAE)
ArchitectureHardwareEngineeringChemical EngineeringBiotechnologyEnvironmental EngineeringComputer Science
2018English

A New Scaled Hybrid Modified BFGS Algorithms for Unconstrained Optimization

Applied Mathematical Sciences
2013English

Global Convergence of the TMR Method for Unconstrained Optimization Problems

Communications in Applied Analysis
ModelingApplied MathematicsNumerical AnalysisAnalysisSimulation
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy