Algorithms for a class of nondifferentiable problems
From MaRDI portal
Publication:1136702
Cites work
- Approximation procedures based on the method of multipliers
- Combined Primal-Dual and Penalty Methods for Constrained Minimization
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Dual Variable Metric Algorithms for Constrained Optimization
- Generalized Gradients and Applications
- scientific article; zbMATH DE number 3466447 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3612784 (Why is no real title available?)
- scientific article; zbMATH DE number 3309656 (Why is no real title available?)
- scientific article; zbMATH DE number 3344465 (Why is no real title available?)
- Multiplier methods: A survey
- On Penalty and Multiplier Methods for Constrained Minimization
- On the Goldstein-Levitin-Polyak gradient projection method
- Optimization of lipschitz continuous functions
- Subproblem and Overall Convergence for a Method-of-Centers Algorithm
Cited in
(4)- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- Approximation procedures based on the method of multipliers
- Smooth transformation of the generalized minimax problem
- Randomized search directions in descent methods for minimizing certain quasidifferentiable functions
This page was built for publication: Algorithms for a class of nondifferentiable problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1136702)
