Dual coordinate ascent methods for non-strictly convex minimization
- 1 March 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 59 (1-3) , 231-247
- https://doi.org/10.1007/bf01581245
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Relaxation Methods for Problems with Strictly Convex Costs and Linear ConstraintsMathematics of Operations Research, 1991
- A Decomposition Method and Its Application to Convex ProgrammingMathematics of Operations Research, 1989
- A successive projection methodMathematical Programming, 1988
- Relaxation methods for problems with strictly convex separable costs and linear constraintsMathematical Programming, 1987
- Optimization of “$\log x$” Entropy over Linear Equality ConstraintsSIAM Journal on Control and Optimization, 1987
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- A new method for the optimization of a nonlinear function subject to nonlinear constraintsThe Computer Journal, 1970
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967