Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming

DOI10.1016/0166-218X(94)90198-8zbMath0803.90099MaRDI QIDQ1327215

Olivier du Merle, Jean-Philippe Vial, Jean-Louis Goffin, Olivier Bahn

Publication date: 18 July 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

convex differentiable programminginterior point cutting plane algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Complexity of some cutting plane methods that use analytic centers, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, An infeasible interior-point algorithm for solving primal and dual geometric programs, A logarithmic barrier cutting plane method for convex programming, A cutting plane algorithm for convex programming that uses analytic centers, A cutting plane method from analytic centers for stochastic programming, Geometric programming approach to doping profile design optimization of metal-oxide-semiconductor devices, An accelerated central cutting plane algorithm for linear semi-infinite programming, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, Temperature-aware floorplanning via geometric programming, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Optimal joint pricing and lot sizing with fixed and variable capacity, Homogeneous analytic center cutting plane methods with approximate centers

Uses Software

• Matlab
• ACCPM

Cites Work

• Unnamed Item
• Unnamed Item
• Using central prices in the decomposition of linear programs
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• A new polynomial-time algorithm for linear programming
• A polynomial Newton 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
• The Cutting-Plane Method for Solving Convex Programs
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier