Descent methods for quasidifferentiable minimization

DOI10.1007/BF01443620zbMath0655.90068OpenAlexW2044502366MaRDI QIDQ1109687

Krzysztof C. Kiwiel

Publication date: 1988

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01443620

zbMATH Keywords

descent methodArmijo-like searchunconditional minimizationnondifferentiable functioncontinuous and uniformly directional differentiable functionpointwise minima of convex functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Mathematical programming (90C99)

Related Items

Mathematical diagnostics via nonsmooth analysis, Robust network design in telecommunications under polytope demand uncertainty, Minmaxmin problems revisited, A generalized steepest descent method for continuously subdifferentiable functions

Cites Work

• Unnamed Item
• Optimization of upper semidifferentiable functions
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
• Methods of descent for nondifferentiable optimization
• On quasidifferentiable mappings
• Optimization and nonsmooth analysis
• On minimizing the sum of a convex function and a concave function
• A linearization method for minimizing certain quasidifferentiable functions
• An algorithm for minimizing a certain class of quasidifferentiable functions
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
• Finding the nearest point in A polytope
• Convex Analysis