A Potential Reduction Algorithm Allowing Column Generation
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 679864
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- Column generation decomposition with the degenerate constraints in the subproblem
- Generalized column generation for linear programming
- Row-reduced column generation for degenerate master problems
Cited in
(28)- Solving combinatorial optimization problems using Karmarkar's algorithm
- A build-up variant of the logarithmic barrier method for LP
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
- Methods of centers for variational inequalities and linear programming
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Complexity of some cutting plane methods that use analytic centers
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Potential-reduction methods in mathematical programming
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Specialized fast algorithms for IQC feasibility and optimization problems.
- Using selective orthonormalization to update the analytic center after addition of multiple cuts
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- A logarithmic barrier cutting plane method for convex programming
- A new algorithm for minimizing convex functions over convex sets
- A cutting plane algorithm for convex programming that uses analytic centers
- A cutting plane method from analytic centers for stochastic programming
- Complexity estimates of some cutting plane methods based on the analytic barrier
- An oracle for the discrete-time integral quadratic constraint problem
- A cutting plane method for solving KYP-SDPs
- Using extra dual cuts to accelerate column generation
- An analytic center cutting plane algorithm for finding equilibrium points
- Adaptive constraint reduction for convex quadratic programming
- An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games
- Learning lyapunov functions for hybrid systems
- A sparse smoothing Newton method for solving discrete optimal transport problems
- A second-order cone cutting surface method: Complexity and application
- A matrix generation approach for eigenvalue optimization
This page was built for publication: A Potential Reduction Algorithm Allowing Column Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018382)
