Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem

DOI10.1016/0362-546X(95)00107-7zbMath0859.65060OpenAlexW4242119255MaRDI QIDQ4894151

M. D. Maergoiz

Publication date: 7 April 1997

Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0362-546x(95)00107-7

zbMATH Keywords

convergencenumerical examplesstepsize controlline searchlower-semi-continuous minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (1)

Two additions to “choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally Lipschitz) lower-semi-continuous minimization problem”

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization of functions having Lipschitz continuous first partial derivatives
• An application of the generalized Aitken-Steffensen method to the problem of minimizing a function
• Algorithm Models for Nondifferentiable Optimization
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• On Steepest Descent

This page was built for publication: Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem