A logarithmic barrier cutting plane method for convex programming

DOI10.1007/BF02032162zbMath0836.90126OpenAlexW2054876264MaRDI QIDQ1904709

Dick den Hertog, Cornelis Roos, Tamás Terlaky, John A. Kaliski

Publication date: 2 May 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02032162

zbMATH Keywords

nonsmooth optimizationdecompositioncolumn generationinterior point methodcentral path of a linear relaxationlogarithmic barrier cutting plane algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)

Related Items

An infeasible interior-point algorithm for solving primal and dual geometric programs, A cutting plane algorithm for convex programming that uses analytic centers, A ladder method for linear semi-infinite programming, An accelerated central cutting plane algorithm for linear semi-infinite programming, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, Using regularization and second order information in outer approximation for convex MINLP, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Optimal joint pricing and lot sizing with fixed and variable capacity, Alternative regularizations for outer-approximation algorithms for convex MINLP

Uses Software

• ACCPM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Cutting planes and column generation techniques with the projective algorithm
• Newton's method for convex programming and Tschebyscheff approximation
• Solving combinatorial optimization problems using Karmarkar's algorithm
• A polynomial method of approximate centers for linear programming
• A build-up variant of the logarithmic barrier method for LP
• Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
• The Cutting-Plane Method for Solving Convex Programs
• A projected lagrangian algorithm for semi-infinite programming
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• A Potential Reduction Algorithm Allowing Column Generation
• A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
• A central cutting plane algorithm for the convex programming problem
• A Short-Cut Potential Reduction Algorithm for Linear Programming
• A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier