Randomized search directions in descent methods for minimizing certain quasidifferentiable functions

DOI10.1080/02331938608843159MaRDI QIDQ3783076zbMATH OpenOpenAlexFDO

Authors Krzysztof C. Kiwiel

Publication date 1986

Published in Optimization (Search for Journal in Brave)

Full work available at URL http://pure.iiasa.ac.at/id/eprint/2521/1/CP-84-056.pdf

zbMATH Keywords

randomizationdescent methodsnondifferentiable optimizationquasidifferential calculusrandom choice of two search directions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Descent methods for quasidifferentiable minimization
• Random Search Algorithms with Sufficient Descent for Minimization of Functions
• A Method for Minimization of Quasidifferentiable Functions
• Quasidifferentiable functions: Necessary conditions and descent directions
• scientific article; zbMATH DE number 4020857

Cites work

• A linearization method for minimizing certain quasidifferentiable functions
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• Algorithms for a class of nondifferentiable problems
• Approximation procedures based on the method of multipliers
• Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
• On quasidifferentiable mappings

Cited in

(2)

• Descent methods for quasidifferentiable minimization
• scientific article; zbMATH DE number 2014390 (Why is no real title available?)

This page was built for publication: Randomized search directions in descent methods for minimizing certain quasidifferentiable functions

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