Polynomial Interior Point Cutting Plane Methods
From MaRDI portal
Recommendations
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- A homogenized cutting plane method to solve the convex feasibility problem.
Cites work
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- A build-up variant of the logarithmic barrier method for LP
- A long-step, cutting plane algorithm for linear and convex programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- Multiple cuts in the analytic center cutting plane method
- On Finding Primal- and Dual-Optimal Bases
- On Vaidya's Volumetric Cutting Plane Method for Convex Programming
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- Solving combinatorial optimization problems using Karmarkar's algorithm
- The volumetric barrier for convex quadratic constraints
- The volumetric barrier for semidefinite programming.
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
Cited in
(20)- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs
- A unifying framework for several cutting plane methods for semidefinite programming
- A homogenized cutting plane method to solve the convex feasibility problem.
- An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
- A matrix generation approach for eigenvalue optimization
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- A logarithmic barrier cutting plane method for convex programming
- An algorithm for solving the convex feasibility problem
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Using selective orthonormalization to update the analytic center after addition of multiple cuts
- scientific article; zbMATH DE number 7559394 (Why is no real title available?)
- Research on probabilistic methods for control system design
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Constrained integer fractional programming problem with box constraints
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- A feasible directions method for nonsmooth convex optimization
- Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
This page was built for publication: Polynomial Interior Point Cutting Plane Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4653547)
