Feasible direction methods in the absence of slater's condition

DOI10.1080/02331937808842484zbMath0395.90061OpenAlexW2088349932MaRDI QIDQ4178788

Sanjo Zlobec

Publication date: 1978

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331937808842484

zbMATH Keywords

AlgorithmConvergenceConvex ProgrammingFeasible Direction MethodsSlater's Condition

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

Input optimization: I. Optimal realizations of mathematical models ⋮ Survey of input optimization¹ ⋮ Geometry of optimality conditions and constraint qualifications: The convex case

This page was built for publication: Feasible direction methods in the absence of slater's condition