Penalty-proximal methods in convex programming
- 1 October 1987
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 55 (1), 1-21
- https://doi.org/10.1007/bf00939042
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Numerical methods for nondifferentiable convex optimizationPublished by Springer Nature ,1987
- An algorithm for linearly constrained convex nondifferentiable minimization problemsJournal of Mathematical Analysis and Applications, 1985
- A descent algorithm for nonsmooth convex optimizationMathematical Programming, 1984
- A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex FunctionsMathematics of Operations Research, 1983
- MONOTONE OPERATORS AND AUGMENTED LAGRANGIAN METHODS IN NONLINEAR PROGRAMMINGPublished by Elsevier ,1978
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976
- Necessary and sufficient conditions for a penalty method to be exactMathematical Programming, 1975
- A method of conjugate subgradients for minimizing nondifferentiable functionsPublished by Springer Nature ,1975
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970