Publication | Closed Access

An infeasible interior-point algorithm for solving primal and dual geometric programs

Mathematical ProgrammingEngineeringInfeasible Interior-point AlgorithmConvex OptimizationComputational ComplexityQuadratic ProgrammingSemidefinite ProgrammingDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationComputational GeometryDual Geometric Programs