Feasible direction methods in the absence of slater's condition
- 1 January 1978
- journal article
- research article
- Published by Taylor & Francis in Mathematische Operationsforschung und Statistik. Series Optimization
- Vol. 9 (2) , 185-196
- https://doi.org/10.1080/02331937808842484
Abstract
Three popular feasible direction methods for solving convex programming problems are reformulated so that they now work in the absence of Slater’s condition or any other constraint qualification.Keywords
This publication has 5 references indexed in Scilit:
- Necessary and Sufficient Conditions for a Pareto Optimum in Convex ProgrammingEconometrica, 1977
- Convex programming and the lexicographic multicriteria problemMathematische Operationsforschung und Statistik. Series Optimization, 1977
- Characterization of optimality in convex programming without a constraint qualificationJournal of Optimization Theory and Applications, 1976
- Characterization theorems for constrained approximation problems via optimization theoryJournal of Approximation Theory, 1975
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970