Descent methods for quasidifferentiable minimization

DOI10.1007/BF01443620MaRDI QIDQ1109687zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4085417
• Descent methods for convex essentially smooth minimization
• scientific article; zbMATH DE number 3972657
• Methods of descent for nondifferentiable optimization
• A gradient-like method for quasidifferentiable optimization
• scientific article; zbMATH DE number 1832463
• scientific article; zbMATH DE number 3956829
• The quasi-Newton method of solution of convex variational inequalities with descent decomposition
• Publication:4955984
• Randomized search directions in descent methods for minimizing certain quasidifferentiable functions

Cites work

• scientific article; zbMATH DE number 3750660 (Why is no real title available?)
• A linearization method for minimizing certain quasidifferentiable functions
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• An algorithm for minimizing a certain class of quasidifferentiable functions
• An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
• Convex Analysis
• Finding the nearest point in A polytope
• Methods of descent for nondifferentiable optimization
• On minimizing the sum of a convex function and a concave function
• On quasidifferentiable mappings
• On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
• Optimization and nonsmooth analysis
• Optimization of upper semidifferentiable functions

Cited in

(18)

• Continuous methods of unconstrained minimization of hypodifferentiable functions
• scientific article; zbMATH DE number 6135092 (Why is no real title available?)
• Choosing descent directions in unconstrained minimization problems
• The quasi-Newton method of solution of convex variational inequalities with descent decomposition
• A Method for Minimization of Quasidifferentiable Functions
• Robust network design in telecommunications under polytope demand uncertainty
• A gradient-like method for quasidifferentiable optimization
• scientific article; zbMATH DE number 58789 (Why is no real title available?)
• Mathematical diagnostics via nonsmooth analysis
• On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms
• Unconstrained minimization of \(H\)-hyperdifferentiable functions
• Minmaxmin problems revisited
• A generalized steepest descent method for continuously subdifferentiable functions
• A linearization method for minimizing certain quasidifferentiable functions
• An algorithm for minimizing a certain class of quasidifferentiable functions
• Generalized descent method for minimization of functionals
• scientific article; zbMATH DE number 205762 (Why is no real title available?)
• Randomized search directions in descent methods for minimizing certain quasidifferentiable functions

This page was built for publication: Descent methods for quasidifferentiable minimization

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