Logarithmic Barrier Decomposition Methods for Semi-infinite Programming

DOI10.1111/J.1475-3995.1997.TB00084.XMaRDI QIDQ3842985zbMATH OpenOpenAlexFDO

Authors John A. Kaliski, David J. Haglin, C. Roos, Tamás Terlaky

Publication date 5 May 1999

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.1997.tb00084.x

zbMATH Keywords

column generationcomputational studyinterior point methodlinear cutslogarithmic barrier decomposition algorithmssemi-infinite programming

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Recommendations

• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
• scientific article; zbMATH DE number 708836
• Two logarithmic barrier methods for convex semi-infinite problems.
• A logarithmic barrier cutting plane method for convex programming

Cites work

• A build-up variant of the logarithmic barrier method for LP
• A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
• A central cutting plane algorithm for the convex programming problem
• A logarithmic barrier cutting plane method for convex programming
• A projected lagrangian algorithm for semi-infinite programming
• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
• Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
• scientific article; zbMATH DE number 45207 (Why is no real title available?)
• scientific article; zbMATH DE number 590363 (Why is no real title available?)
• scientific article; zbMATH DE number 708836 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 839542 (Why is no real title available?)
• New descent rules for solving the linear semi-infinite programming problem
• Newton's method for convex programming and Tschebyscheff approximation
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Semi-infinite programming duality for order restricted statistical inference models
• Some outer approximation methods for semi-infinite optimization problems
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(12)

• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
• A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
• Linear semi-infinite programming theory: an updated survey
• Global convergence of a class of smooth penalty methods for semi-infinite programming
• Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
• A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
• Two logarithmic barrier methods for convex semi-infinite problems.
• A logarithm barrier method for semi-definite programming
• scientific article; zbMATH DE number 708836 (Why is no real title available?)
• A quasi-Newton interior point method for semi-infinite programming
• Polynomial Interior Point Cutting Plane Methods
• A parallel algorithm for semi-infinite programming

This page was built for publication: Logarithmic Barrier Decomposition Methods for Semi-infinite Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3842985)