Optimization · 2016 · 13 citations · 28 references
ComputingComputer ScienceAlgorithmsComputational GeometryOptimizationConvex AnalysisConvex OptimizationKernel MethodsNonlinear ProgrammingOptimization TheoryAverage-case ComplexityBest-case ComplexityPrimal-dual AlgorithmsSecond-order Cone ProgrammingSecond-order Optimization
In this paper, we propose a large-update primal–dual interior-point algorithm for second-order cone optimization (SOCO) based on a class of kernel functions consisting of a trigonometric barrier term. The algorithm starts from a strictly feasible point and generates a sequence of points converging to an optimal solution of the problem. Using a simple analysis, we show that the algorithm has worst case iteration complexity for large-update primal–dual interior point methods which coincides with the so far best-known iteration bound for SOCO.
28
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · COMBINATORICA · 1984 · 4.8K citations
Aharon Ben‐Tal, Arkadi Nemirovski · Mathematics of Operations Research · 1998 · 2.6K citations
Applications of second-order cone programming
Miguel Sousa Lobo, Lieven Vandenberghe, Stephen Boyd et al. · Linear Algebra and its Applications · 1998 · 2.4K citations