A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
From MaRDI portal
Publication:1922691
DOI10.1016/0025-5610(94)00065-2zbMath0855.90097OpenAlexW4239974430MaRDI QIDQ1922691
Dick den Hertog, Florian Jarre, Cornelis Roos, Tamás Terlaky
Publication date: 18 September 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0025-5610(94)00065-2
logarithmic barrier functionLipschitz conditionself-concordancedual geometric programminglow-complexity interior-point methods
Related Items
Optimal ellipsoidal approximations around the analytic center, Asymptotic analysis of a path-following barrier method for linearly constrained convex problems*, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, A combined homotopy interior point method for convex nonlinear programming, Market exchange models and geometric programming, Efficient algorithms for solving the \(p\)-Laplacian in polynomial time, Path-following barrier and penalty methods for linearly constrained problems, General primal-dual penalty/barrier path-following Newton methods for nonlinear programming, Efficient formulations for pricing under attraction demand models, Solving the discrete \(l_p\)-approximation problem by a method of centers, Conic formulation for \(l_p\)-norm optimization, A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming, A general class of penalty/barrier path-following Newton methods for nonlinear programming, An interior-point method for the single-facility location problem with mixed norms using a conic formulation, Long-step interior-point algorithms for a class of variational inequalities with monotone operators, A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Improving complexity of structured convex optimization problems using self-concordant barriers
