Duality in convex programming: a linearization approach 1
- 1 January 1979
- journal article
- research article
- Published by Taylor & Francis in Mathematische Operationsforschung und Statistik. Series Optimization
- Vol. 10 (2) , 171-178
- https://doi.org/10.1080/02331937908842560
Abstract
We propose a local linearization of convex programs, and a corresponding duality theory, which retains the properties of classical duality without assuming constraint qualification.Keywords
This publication has 12 references indexed in Scilit:
- Calculating the cone of directions of constancyJournal of Optimization Theory and Applications, 1978
- Characterization of optimality in convex programming without a constraint qualificationJournal of Optimization Theory and Applications, 1976
- Convex analysis treated by linear programmingMathematical Programming, 1973
- Envelope programming and a minimax theoremJournal of Mathematical Analysis and Applications, 1972
- Duality in Nonlinear Programming: A Simplified Applications-Oriented DevelopmentSIAM Review, 1971
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theoryJournal of Mathematical Analysis and Applications, 1969
- Duality in nonlinear programmingQuarterly of Applied Mathematics, 1962
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961
- A Nonlinear Programming Technique for the Optimization of Continuous Processing SystemsManagement Science, 1961
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959