Convergence of the Steepest Descent Method for Minimizing
Convex Functions

QR Code

Convergence of the Steepest Descent Method for Minimizing Convex Functions

Kiwiel and Murty (1996) discuss the convergence properties of a class of steepest descent algorithm for minimizing a continuously differentiable quasiconvex function f on mo. Under mild conditions, we prove that the limit infimum of IIVflXo)1I is zero and that false convergence does not occur even w...

Full description

Bibliographic Details
Main Authors:	Abu Hassan, Malik, Monsi, Mansor, Leong, Wah June
Format:	Article
Language:	English English
Published:	Universiti Putra Malaysia Press 2002
Online Access:	http://psasir.upm.edu.my/id/eprint/3718/ http://psasir.upm.edu.my/id/eprint/3718/1/Convergence_of_the_Steepest_Descent_Method_for_Minimizing.pdf

Similar Items

A Switching Criterion in Hybrid Quasi-Newton BFGS - Steepest Descent Direction
by: Abu Hassan, Malik, et al.
Published: (1999)

Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

Blind signal separation using steepest descent method
by: Dam, Hai Huyen, et al.
Published: (2007)

A class of diagonal quasi-newton methods for large-scale convex minimization
by: Leong, Wah June
Published: (2015)

A new gradient method via quasi-Cauchy relation which guarantees descent
by: Abu Hassan, Malik, et al.
Published: (2009)

Convergence of a positive definite symmetric rank one method with restart
by: Leong, Wah June, et al.
Published: (2009)

A new inexact line search method for convex optimization problems
by: Moyi, Aliyu Usman, et al.
Published: (2013)

Using Pattern Search Methods for Minimizing Clustering Problems
by: Shabanzadeh, Parvaneh, et al.
Published: (2010)

Convergence of symmetric rank-one method based on modified Quasi-Newton equation
by: Khiyabani, Farzin Modarres, et al.
Published: (2010)

Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016)

Convergence and stability of line search methods for unconstrained optimization.
by: Leong, Wah June, et al.
Published: (2013)

On the Modifications of a Broyden's Single Parameter Rank-Two Quasi-Newton Method for Unconstrained Minimization
by: Leong, Wah June
Published: (1999)

A multiperson pursuit problem on a closed convex set in Hilbert space
by: Leong, Wah June, et al.
Published: (2008)

Scaling symmetric rank one update for unconstrained optimization
by: Abu Hassan, Malik, et al.
Published: (2002)

Jacobian computation-free Newton's method for systems of nonlinear equations.
by: Yusuf, Mohammed Waziri, et al.
Published: (2010)

Scaling symmetric rank one update for unconstrained optimization
by: Abu Hassan, Malik, et al.
Published: (2003)

Newton method for nonlinear system with singular Jacobian using diagonal updating
by: Yusuf, Mohammed Waziri, et al.
Published: (2010)

A new Newtons method with diagonal Jacobian approximation for systems of nonlinear equations
by: Yusuf, Mohammed Waziri, et al.
Published: (2010)

Two-step diagonal Newton method for large-scale systems of nonlinear equations
by: Waziri, Mohammed Yusuf, et al.
Published: (2011)

Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems
by: Zulkifli, Munierah, et al.
Published: (2023)

The Convergent Generalized Central Paths for Linearly Constrained Convex Programming
by: Qian, X., et al.
Published: (2018)

On the convergence of the Newton's method in the interval symmetric single step procedure
by: Mohammad Rusli, Syaida Fadhilah, et al.
Published: (2014)

A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
by: Qian, X., et al.
Published: (2018)

Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
by: Dang, Y., et al.
Published: (2016)

On geodesic strongly E-convex sets and geodesic strongly E-convex functions
by: Kilicman, Adem, et al.
Published: (2015)

An efficient solver for systems of nonlinear equations with singular Jacobian via diagonal updating
by: Waziri, Mohammed Yusuf, et al.
Published: (2010)

A low memory solver for integral equations of Chandrasekhar type in the radiative transfer problems
by: Yusuf, Muhammad Waziri, et al.
Published: (2011)

Convergence and Stability of Line Search Methods for Unconstrained Optimization
by: Leong, Wah, et al.
Published: (2013)

The sufficient descent condition of nonlinear conjugate gradient method
by: Basri, Sri Mazzura, et al.
Published: (2018)

A new gradient method via least change secant update
by: Leong, Wah June, et al.
Published: (2011)

Scaled memoryless symmetric rank one method for large-scale optimization.
by: Leong, Wah June, et al.
Published: (2011)

A family of least change diagonally quasi-Newton methods for nonlinear equations
by: Leong, Wah June, et al.
Published: (2010)

Scaled memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2008)

On the Structure of Convex Piecewise Quadratic Functions
by: Sun, Jie
Published: (1992)

On the minima and convexity of Epstein zeta function
by: Lim, S. C., et al.
Published: (2008)

Positive-definite memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2011)

A characterization of maximal Lyapunov function for stability of a nonlinear system
by: Abedi, Fakhreddin, et al.
Published: (2010)

A hybrid descent method for optimal sigmoid filter design
by: Chan, Kit, et al.
Published: (2014)

Stochastic mirror descent method for distributed multi-agent optimization
by: Li, J., et al.
Published: (2016)

A quadratically convergent method for minimizing a sum of euclidean norms with linear constraints
by: Zhou, Guanglu
Published: (2007)