A logarithmic barrier cutting plane method for convex programming
From MaRDI portal
Recommendations
- A long-step, cutting plane algorithm for linear and convex programming
- Polynomial Interior Point Cutting Plane Methods
- A projection cutting plane algorithm for convex programming problems
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
Cites work
- scientific article; zbMATH DE number 3650307 (Why is no real title available?)
- scientific article; zbMATH DE number 3659282 (Why is no real title available?)
- scientific article; zbMATH DE number 3748729 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 776084 (Why is no real title available?)
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
- A Potential Reduction Algorithm Allowing Column Generation
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- A build-up variant of the logarithmic barrier method for LP
- A central cutting plane algorithm for the convex programming problem
- A polynomial method of approximate centers for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A projected lagrangian algorithm for semi-infinite programming
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
- Cutting planes and column generation techniques with the projective algorithm
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- 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
Cited in
(15)- A long-step, cutting plane algorithm for linear and convex programming
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- A cutting plane algorithm for convex programming that uses analytic centers
- A ladder method for linear semi-infinite programming
- Two logarithmic barrier methods for convex semi-infinite problems.
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- Using regularization and second order information in outer approximation for convex MINLP
- Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity*
- Optimal joint pricing and lot sizing with fixed and variable capacity
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- On controlling the parameter in the logarithmic barrier term for convex programming problems
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints
This page was built for publication: A logarithmic barrier cutting plane method for convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904709)
