Algorithms for a class of nondifferentiable problems
From MaRDI portal
Publication:1136702
DOI10.1007/BF00933357zbMath0426.90079MaRDI QIDQ1136702
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
algorithmsconvergence analysisdualitynonlinear programmingnondifferentiable optimizationmin- max problems
Related Items
Smooth transformation of the generalized minimax problem, Randomized search directions in descent methods for minimizing certain quasidifferentiable functions, Approximation procedures based on the method of multipliers, A quadratic approximation method for minimizing a class of quasidifferentiable functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplier methods: A survey
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Approximation procedures based on the method of multipliers
- Combined Primal-Dual and Penalty Methods for Constrained Minimization
- Generalized Gradients and Applications
- Subproblem and Overall Convergence for a Method-of-Centers Algorithm
- On Penalty and Multiplier Methods for Constrained Minimization
- On the Goldstein-Levitin-Polyak gradient projection method
- Dual Variable Metric Algorithms for Constrained Optimization
- Optimization of lipschitz continuous functions