Partially finite convex programming, Part II: Explicit lattice models
- 1 May 1992
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 57 (1) , 49-83
- https://doi.org/10.1007/bf01581073
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Duality Relationships for Entropy-Like Minimization ProblemsSIAM Journal on Control and Optimization, 1991
- Duality and well-posedness in convex interpolation∗)Numerical Functional Analysis and Optimization, 1989
- A Dual Approach to Multidimensional $L_p$ Spectral Estimation ProblemsSIAM Journal on Control and Optimization, 1988
- Automatic continuity and openness of convex relationsProceedings of the American Mathematical Society, 1987
- A simple constraint qualification in infinite dimensional programmingMathematical Programming, 1986
- Linear Optimization and ApproximationPublished by Springer Nature ,1983
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.MATHEMATICA SCANDINAVICA, 1981
- On “best” interpolationJournal of Approximation Theory, 1976
- A Partitioning Problem with Applications in Regional DesignOperations Research, 1972
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970