A Potential Reduction Algorithm Allowing Column Generation
From MaRDI portal
Publication:4018382
DOI10.1137/0802002zbMath0767.90049OpenAlexW2059499240MaRDI QIDQ4018382
Publication date: 16 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0802002
column generationDantzig-Wolfe decompositionlinear inequalityanalytic centerpotential functionpotential reduction algorithm
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A second-order cone cutting surface method: Complexity and application, 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, A logarithmic barrier cutting plane method for convex programming, A matrix generation approach for eigenvalue optimization, A new algorithm for minimizing convex functions over convex sets, An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games, 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, Learning lyapunov functions for hybrid systems, Adaptive constraint reduction for convex quadratic programming, A cutting plane method for solving KYP-SDPs, Specialized fast algorithms for IQC feasibility and optimization problems., Solving combinatorial optimization problems using Karmarkar's algorithm, A build-up variant of the logarithmic barrier method for LP, Using selective orthonormalization to update the analytic center after addition of multiple cuts, An oracle for the discrete-time integral quadratic constraint problem, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, 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, An analytic center cutting plane algorithm for finding equilibrium points, On the complexity of approximating the maximal inscribed ellipsoid for a polytope
Uses Software
