Descent methods for quasidifferentiable minimization
DOI10.1007/BF01443620zbMATH Open0655.90068OpenAlexW2044502366MaRDI QIDQ1109687FDOQ1109687
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
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
descent methodArmijo-like searchunconditional minimizationnondifferentiable functioncontinuous and uniformly directional differentiable functionpointwise minima of convex functions
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Mathematical programming (90C99)
Cites Work
- Convex Analysis
- Methods of descent for nondifferentiable optimization
- Optimization and nonsmooth analysis
- Finding the nearest point in A polytope
- Title not available (Why is that?)
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- On minimizing the sum of a convex function and a concave function
- On quasidifferentiable mappings
- Optimization of upper semidifferentiable functions
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
- A linearization method for minimizing certain quasidifferentiable functions
- An algorithm for minimizing a certain class of quasidifferentiable functions
Cited In (18)
- Title not available (Why is that?)
- A Method for Minimization of Quasidifferentiable Functions
- On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms
- Continuous methods of unconstrained minimization of hypodifferentiable functions
- The quasi-Newton method of solution of convex variational inequalities with descent decomposition
- Title not available (Why is that?)
- A generalized steepest descent method for continuously subdifferentiable functions
- Generalized descent method for minimization of functionals
- Title not available (Why is that?)
- Minmaxmin problems revisited
- Choosing descent directions in unconstrained minimization problems
- Mathematical diagnostics via nonsmooth analysis
- A linearization method for minimizing certain quasidifferentiable functions
- An algorithm for minimizing a certain class of quasidifferentiable functions
- Randomized search directions in descent methods for minimizing certain quasidifferentiable functions
- Robust network design in telecommunications under polytope demand uncertainty
- A gradient-like method for quasidifferentiable optimization
- Unconstrained minimization of \(H\)-hyperdifferentiable 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)
