The convergence of the steepest descent algorithm for D.C.optimization

MaRDI QIDQ5435794zbMATH OpenFDO

Authors Chuling Shong, Zun-Quan Xia

Publication date 14 January 2008

zbMATH Keywords

D.C.optimizationdescent algorithmlower semi-continuousnonsmooth optimizationupper semi-continuous

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45) Nonsmooth analysis (49J52) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 3956829
• A generalized steepest descent method for continuously subdifferentiable functions
• scientific article; zbMATH DE number 2084880
• Convergence of implementable descent algorithms for unconstrained optimization
• A finite algorithm for a particular D.C. quadratic programming problem

Cited in

(6)

• Convergence of implementable descent algorithms for unconstrained optimization
• A dynamical approach to convex minimization coupling approximation with the steepest descent method
• Domain of differentiability of the asymptotic convergence rate of the steepest descent method
• scientific article; zbMATH DE number 3956829 (Why is no real title available?)
• The rate of convergence of the method of steepest descent in the constrained minimization problem
• A generalized steepest descent method for continuously subdifferentiable functions

This page was built for publication: The convergence of the steepest descent algorithm for D.C.optimization

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